-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcodejam3(python).py
More file actions
61 lines (59 loc) · 1.29 KB
/
codejam3(python).py
File metadata and controls
61 lines (59 loc) · 1.29 KB
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
import numpy as np
t=int(input())
for i in range(t):
n=int(input())
b=[]
flag=0
for j in range(n):
a=list(map(int,input().split()))
b.append(a)
b.sort()
jo=-1
co=-1
jc=-1
cc=-1
y=0
c = np.zeros((n,4),dtype=int)
#print(c)
c[0][2]=1
for j in range(n):
c[j][0]=b[j][0]
c[j][1]=b[j][1]
jo=c[0][0]
jc=c[0][1]
j=1
while co==-1 and j<n:
if jc<=c[j][0]:
jc=c[j][1]
jo=c[j][0]
c[j][2]=1
else:
co=c[j][0]
cc=c[j][1]
c[j][2]=2
j+=1
y=j
for j in range(y,n):
if jc<=c[j][0]:
jc=c[j][0]
jo=c[j][0]
c[j][2]=1
elif cc<=c[j][0]:
co=c[j][0]
cc=c[j][1]
c[j][2]=2
else:
flag=-1
ans=""
if flag == -1:
ans="IMPOSSIBLE"
else:
for j in range(n):
for k in range(n):
if b[j][0]==c[k][0] and b[j][1]==c[k][1] and c[k][3]==0:
if c[k][2] == 1:
ans += 'C'
else:
ans += 'J'
print("Case #"+str(i+1)+": "+ans)
i+=1