-
Notifications
You must be signed in to change notification settings - Fork 0
/
Submission3
96 lines (81 loc) · 2.35 KB
/
Submission3
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
-----------------------------------------Parenting Partnering Returns (7pts, 12pts)---------------------------------
import java.util.*
fun main(args: Array<String>) {
val scan = Scanner(System.`in`)
var kotlin = scan.nextLine().toInt()
for (k in 1..kotlin) {
var n = scan.nextLine().toInt()
val t = Array(n, { IntArray(2) })
val pos = IntArray(n)
var ca = 0
var cb = 0
var ja = 0
var jb = 0
var answer = ""
var flag=true
for (i in 0..n - 1) {
answer += "a"
}
var ans = StringBuilder(answer)
var c = 0
var j = 0
var used = 0
for (i in 0..n - 1) {
t[i] = scan.nextLine().split(" ").map { it.trim().toInt() }.toIntArray()
pos[i] = i
}
for (i in 0..n - 1) {
for (j in 0..n - 2) {
if (t[j][0] > t[j + 1][0]) {
var temp = t[j][0]
t[j][0] = t[j + 1][0]
t[j + 1][0] = temp
temp = t[j][1]
t[j][1] = t[j + 1][1]
t[j + 1][1] = temp
temp = pos[j]
pos[j] = pos[j + 1]
pos[j + 1] = temp
}
}
}
for (i in 0..n - 1) {
var x = t[i][0]
var y = t[i][1]
if(cb<=x && cb!=0)
{
ca=0
cb=0
used--
}
if(jb<=x && jb!=0)
{
ja=0
jb=0
used--
}
if(used<2)
{
if ((ca == 0 && cb == 0)) {
ca = x
cb = y
ans[pos[i]] = 'C'
} else if ((ja == 0 && jb == 0)) {
ja = x
jb = y
ans[pos[i]] = 'J'
}
used++
}
else {
flag=false
break
}
}
if(flag==false)
println("Case #${k}: IMPOSSIBLE")
else
println("Case #${k}: ${ans}")
}
}
-------------------------------------------------------------------------------------------------------