-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3.java
202 lines (164 loc) · 4.76 KB
/
3.java
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
public class Solution implements Runnable {
static class SortPair implements Comparator<Pair>
{
public int compare(Pair a, Pair b)
{
if(a.a != b.a)
return a.a - b.a;
return a.b - b.b;
}
}
static class Pair
{
int a,b,in;
Pair(int aa, int bb,int ii)
{
a = aa;
b = bb;
in=ii;
}
public String toString()
{
return "["+a+" "+b+"]";
}
}
static void fill(int a[],int i,int n)
{
for(;i<=n;i++)a[i]=1;
}
static void solve(InputReader sc, PrintWriter out, int testcase)
{
int a[] = new int[1442];
int b[] = new int[1442];
int n = sc.nextInt();
Pair[] p = new Pair[n];
for(int i=0;i<n;i++)
{
int s = sc.nextInt(), e =sc.nextInt();
p[i] = new Pair(s,e,i);
}
char ans[] = new char[n];
Arrays.sort(p,new SortPair());
for(int j=0;j<n;j++)
{
int s = p[j].a;
int e = p[j].b;
int in = p[j].in;
if(a[s]!=1)
{
fill(a,s,e-1);
ans[p[j].in]='C';
}
else if(b[s]!=1)
{
fill(b,s,e-1);
ans[p[j].in]='J';
}
else
{
out.println("Case #"+testcase+": IMPOSSIBLE");
return;
}
}
out.println("Case #"+testcase+": "+new String(ans));
}
public void run() {
InputReader sc = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
int t = sc.nextInt();
for(int i=1;i<=t;i++)
{
solve(sc,out,i);
}
out.close();
}
/* Java Templates
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars==-1)
throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
}
catch (IOException e) {
throw new InputMismatchException();
}
if(numChars <= 0)
return -1;
}
return buf[curChar++];
}
public String nextLine() {
String str = "";
try {
str = br.readLine();
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
public int nextInt() {
int c = read();
while(isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if(c<'0'||c>'9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
while (!isSpaceChar(c));
return res * sgn;
}
public String readString() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
}
while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next() {
return readString();
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
*/
public static void main(String args[]) throws Exception {
new Thread(null, new Solution(),"Main",1<<27).start();
}
}