# HIIT Open 2016

 Start: 2016-05-28 11:00:00 End: 2016-05-28 16:00:00

CSES - HIIT Open 2016 - Results
History
2016-05-28 15:00:25
2016-05-28 13:39:35
2016-05-28 13:09:34
 Task: Graph painting Sender: Verto Submission time: 2016-05-28 13:09:34 Language: Python2 Status: READY Result: TIME LIMIT EXCEEDED

## Test results

 test verdict time (s) #1 ACCEPTED 0.06 / 1.00 details #2 ACCEPTED 0.05 / 1.00 details #3 TIME LIMIT EXCEEDED -- / 1.00 details

## Code

```import sys
def asints(s):
return [int(x.strip()) for x in s.split()]
def asoneint(s):
return int(s.strip())

class Node:
def __init__(self, name):
self.name = name
self.neighbors = []
self.color = None
def connect(self, other):
self.neighbors.append(other)
other.neighbors.append(self)
def debug(self):
print "{}: {}".format(self.name, [x.name for x in self.neighbors])

t = asoneint(lines[0])
linei = 1
for testi in range(t):
nodes = {}
n, m = asints(lines[linei])
linei += 1
for i in range(1, n+1):
nodes[i] = Node(i)
for i in range(m):
a, b = asints(lines[linei])
linei += 1
nodes[a].connect(nodes[b])
#for node in nodes.values():
#	node.debug()
#print
for node in nodes.values():
n_red = 0
n_blue = 0
for neigh in node.neighbors:
if neigh.color is None:
continue
elif neigh.color == 'R':
n_red += 1
else:
n_blue += 1
if n_red > n_blue:
node.color = 'B'
else:
node.color = 'R'
for node in sorted(nodes.values(), key=lambda x:x.name):
print node.color,
print

```

## Test details

### Test 1

Verdict: ACCEPTED

input
```100 7 1 2 5 8 28 2 7 6 7 4 6 2 3 3 5 7 8 4 8 5 7 5 6 4 7 6 8 1 4 2 6 4 5 3 8 2 8 ...```
view   save

correct output
```B R B B B B R R B B R B R B B R R B B B B R R R B B B R B R B B B B R B R R B R B R B B B B R B R B R B B B R B R B R B R R B R B R R R R R B B R B R R R R B R R R R B B R R R B B B R B R R R R B R B B B R B R B B R R B R B B B R R ...```
view   save

user output
```R R R R B R R R B R B R B R B R B R B R R R R B R R B R B R B R B B R R R B B R R R B R R B B R B R B R R R B R B R B R B R B R R B R B R B R B R R R B B R R R B R B R R R R B B R B R R B B R R R B R B B R B R R B R B B R R R R B R ...```
view   save

### Test 2

Verdict: ACCEPTED

input
```10 38 36 18 28 20 37 22 38 17 33 17 30 26 34 12 37 1 18 36 37 33 34 24 34 18 22 3 11 3 28 29 33 16 35 25 38 10 23 ...```
view   save

correct output
```R R B R B R R R R R B B R B R ... R R B B B R R B R B R B R B R ... B B R R R R B R B B B R R B R ... R R B R B B R B B R R R B B B B R B B B R R ... R R B B R R R B R R B R R R B ... B R R B R B B B R R R R B B R R B B B R R B R B B B B B ... R R B R R R R R B R B B R R R ... R R B R B B R R B R B B B R B ...```
view   save

user output
```R R R R R R R R R R B R R R R ... R R R R R B R R R R R R R B R ... R R R R R R R R R R R R R R R ... R B R R B B R R R R R R R R R R R R R R B R ... R B R R R R R R R R R B R B B ... R R R R R B B R R B R R B R R R R R R R R R R R R R R R ... R R R R R R R R R R R R R R R ... R R R R R R R B R R R R B R B ...```
view   save

### Test 3

Verdict: TIME LIMIT EXCEEDED

input
```1 100000 200000 89300 98492 33853 56822 92967 99427 42461 62590 20195 38987 80870 85808 20624 64006 62088 88344 8872 92190 42562 66966 12882 52315 1520 96552 45353 90886 94940 99227 53663 62317 43160 66687 93275 93293 97160 97656 ...```
view   save

correct output
`R R R R B R R R B B B R B B B ...`
view   save

user output
(no output)
view   save