CodeForces/Problem377D.java at master · raymondcho/CodeForces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
package CodeForces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.StringTokenizer;

public class Problem377D
{
	public static void main(String[] args) throws IOException
	{
		class entry implements Comparable<entry>
		{
			int time;
			int workn;
			int code;
			public entry(int time, int workn, int code)
			{
				this.time = time;
				this.workn = workn;
				this.code = code;
			}
			public int compareTo(entry e2)
			{
				if (this.time < e2.time)
				{
					return -1;
				}
				if (this.time > e2.time)
				{
					return 1;
				}
				if (this.code != e2.code)
				{
					return this.code-e2.code;
				}
				else
				{
					return this.workn - e2.workn;
				}
			}
		}

		fastinput.init(System.in);
		int n = fastinput.nextInt();
		ArrayList<entry> entryarray = new ArrayList<entry>(n*3);

		for (int i = 1; i <= n; i++)
		{
			int li = fastinput.nextInt();
			int vi = fastinput.nextInt();
			int ri = fastinput.nextInt();

			entryarray.add(new entry(li, i, 1));
			entryarray.add(new entry(vi, i, 2));
			entryarray.add(new entry(ri, i, 3));
		}
		Collections.sort(entryarray);

		int highcount = 0;
		int highindex = 1;
		HashMap<Integer, LinkedList<Integer>> workingset = new HashMap<Integer, LinkedList<Integer>>();
		int[] closed = new int[n+1];

		for (int i = 0; i < entryarray.size(); i++)
		{
			entry a = entryarray.get(i);
			if (a.code == 1)
			{
				workingset.put(a.workn, new LinkedList<Integer>());
			}
			if (a.code == 2)
			{
				for (int j = i-1; j >= 0; j--)
				{
					if (entryarray.get(j).code == 1)
					{
						LinkedList<Integer> w = workingset.get(entryarray.get(j).workn);
						if (w != null && closed[entryarray.get(j).workn] == 0)
						{
							w.add(a.workn);
							if (w.size() > highcount)
							{
								highcount = w.size();
								highindex = entryarray.get(j).workn;
							}
							workingset.put(entryarray.get(j).workn, w);
						}
					}
					if (entryarray.get(j).workn == a.workn)
					{
						break;
					}
				}
			}
			if (a.code == 3)
			{
				closed[a.workn] = 1;
			}
		}
		LinkedList<Integer> highest = workingset.get(highindex);
		System.out.println(highest.size());
		ListIterator<Integer> it1 = highest.listIterator();
		while (it1.hasNext())
		{
			Integer ab = it1.next();
			System.out.print(ab+" ");
		}
		System.out.println("");
	}

	public static class fastinput
	{
		static BufferedReader bf;
		static StringTokenizer st;

		static void init(InputStream input)
		{
			bf = new BufferedReader(new InputStreamReader(input));
			st = new StringTokenizer("");
		}

		static String nextline() throws IOException
		{
			return bf.readLine();
		}

		static String next() throws IOException
		{
			while (!st.hasMoreTokens())
			{
				st = new StringTokenizer(bf.readLine());
			}
			return st.nextToken();
		}

		static int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}

		static long nextLong() throws IOException
		{
			return Long.parseLong(next());
		}
	}
}