CSES - Aalto Competitive Programming 2024 - wk2 - Wed - Results
Submission details
Task:Astralis session I
Sender:aalto2024b_007
Submission time:2024-09-11 17:28:20 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#20.05 sdetails
#30.05 sdetails
#40.05 sdetails
#50.05 sdetails
#60.05 sdetails
#70.05 sdetails
#80.05 sdetails
#90.05 sdetails
#100.05 sdetails
#110.05 sdetails
#120.05 sdetails
#130.05 sdetails
#14ACCEPTED0.05 sdetails
#150.05 sdetails
#160.05 sdetails
#170.05 sdetails
#180.05 sdetails
#190.05 sdetails
#200.05 sdetails
#21ACCEPTED0.05 sdetails
#220.05 sdetails
#230.05 sdetails
#240.05 sdetails
#250.05 sdetails
#26ACCEPTED0.05 sdetails
#27ACCEPTED0.05 sdetails
#280.05 sdetails
#29ACCEPTED0.05 sdetails
#300.05 sdetails
#310.05 sdetails
#320.05 sdetails
#33ACCEPTED0.05 sdetails
#340.05 sdetails
#35ACCEPTED0.06 sdetails
#360.05 sdetails
#370.05 sdetails
#380.05 sdetails
#390.06 sdetails
#40ACCEPTED0.05 sdetails
#410.05 sdetails
#420.08 sdetails
#43ACCEPTED0.08 sdetails
#44ACCEPTED0.08 sdetails
#45ACCEPTED0.08 sdetails
#460.08 sdetails
#470.08 sdetails
#48ACCEPTED0.08 sdetails
#490.08 sdetails
#500.08 sdetails
#510.08 sdetails
#52ACCEPTED0.35 sdetails
#530.33 sdetails
#540.33 sdetails
#550.33 sdetails
#560.32 sdetails
#570.33 sdetails
#580.34 sdetails
#590.30 sdetails
#600.30 sdetails
#610.32 sdetails

Code

from collections import defaultdict

def dfs(node, graph, color, colors):
    colors[node] = color
    for neighbor in graph[node]:
        if colors[neighbor] == 0:
            if not dfs(neighbor, graph, 3 - color, colors):
                return False
        elif colors[neighbor] == color:
            return False
    return True

def partition_galaxy(n, edges):
    graph = defaultdict(list)
    for a, b in edges:
        graph[a].append(b)
        graph[b].append(a)
    
    colors = [0] * (n + 1)
    
    if not dfs(1, graph, 1, colors):
        return "No", ""
    
    partition = ['U' if colors[i] == 1 else 'M' for i in range(1, n + 1)]
    
    if partition.count('U') != partition.count('M'):
        return "No", ""
    
    return "Yes", ''.join(partition)

n = int(input())
edges = [list(map(int, input().split())) for _ in range(n-1)]

result, partition = partition_galaxy(n, edges)
print(result)
if result == "Yes":
    print(partition)

Test details

Test 1

Verdict: ACCEPTED

input
2
1 2

correct output
Yes
MU

user output
Yes
UM

Test 2

Verdict:

input
6
1 3
2 3
2 6
4 6
...

correct output
No

user output
Yes
UUMUMM

Test 3

Verdict:

input
6
1 2
2 3
3 6
2 4
...

correct output
No

user output
Yes
UMUUMM

Test 4

Verdict:

input
6
1 6
1 4
2 4
2 3
...

correct output
No

user output
Yes
UUMMUM

Test 5

Verdict:

input
6
2 4
1 4
2 6
1 3
...

correct output
Yes
MUMUMU

user output
Yes
UUMMUM

Test 6

Verdict:

input
8
1 8
5 8
3 5
3 6
...

correct output
Yes
MUMUMUUM

user output
No

Test 7

Verdict:

input
8
1 4
1 6
3 6
1 5
...

correct output
Yes
MUUMMUMU

user output
Yes
UUUMMMUM

Test 8

Verdict:

input
8
1 7
1 3
1 8
2 8
...

correct output
No

user output
Yes
UUMUMUMM

Test 9

Verdict:

input
8
2 3
3 8
7 8
5 8
...

correct output
Yes
MMUMUMUU

user output
No

Test 10

Verdict:

input
10
4 8
4 7
1 7
3 4
...

correct output
Yes
MUMMMUMUUU

user output
Yes
UUMUUUMMMM

Test 11

Verdict:

input
10
3 4
4 5
4 8
4 10
...

correct output
No

user output
Yes
UUMUMMUMUM

Test 12

Verdict:

input
10
1 3
2 3
2 6
6 10
...

correct output
Yes
MMMUUMUMUU

user output
Yes
UUMUUMMMMU

Test 13

Verdict:

input
10
1 10
1 3
6 10
8 10
...

correct output
No

user output
Yes
UMMMUUUUMM

Test 14

Verdict: ACCEPTED

input
10
1 6
1 4
2 4
2 9
...

correct output
No

user output
No

Test 15

Verdict:

input
12
4 10
4 11
9 11
6 11
...

correct output
Yes
UUUMUMMUMUMM

user output
No

Test 16

Verdict:

input
12
1 2
1 8
5 8
3 8
...

correct output
Yes
MUMMMUUMUUUM

user output
No

Test 17

Verdict:

input
14
9 12
6 9
3 6
3 11
...

correct output
No

user output
Yes
UMMMUUMUMMUUUM

Test 18

Verdict:

input
14
13 14
7 13
3 7
7 10
...

correct output
Yes
UMMMMUMUUMUUMU

user output
No

Test 19

Verdict:

input
14
1 3
3 8
3 7
8 9
...

correct output
Yes
MUUUMMUUUMMMMU

user output
No

Test 20

Verdict:

input
16
4 12
1 4
12 16
11 12
...

correct output
No

user output
Yes
UMMMUUMUMUMUMUUM

Test 21

Verdict: ACCEPTED

input
18
12 13
13 17
8 13
12 15
...

correct output
No

user output
No

Test 22

Verdict:

input
100
24 28
28 65
28 58
54 65
...

correct output
Yes
MMUUMUMMUMUMUUMUUMMUUUMMMUUUUM...

user output
No

Test 23

Verdict:

input
100
57 98
24 57
24 34
25 34
...

correct output
Yes
MUUMUMUUUMMUMMUMUMMMMMUUUMUUMM...

user output
No

Test 24

Verdict:

input
100
6 41
6 20
6 18
6 88
...

correct output
Yes
MMMMUMMMUMUUMMUUUMMMUUUUUMUUUU...

user output
No

Test 25

Verdict:

input
100
24 100
92 100
62 100
88 100
...

correct output
Yes
MUUMMUUMMUMUMUMUUUUUUMMMUMUMUM...

user output
No

Test 26

Verdict: ACCEPTED

input
100
65 83
68 83
65 87
21 65
...

correct output
No

user output
No

Test 27

Verdict: ACCEPTED

input
100
12 87
12 56
41 56
11 41
...

correct output
No

user output
No

Test 28

Verdict:

input
100
13 29
13 38
13 34
10 13
...

correct output
Yes
MMMMUUMUMMUUMMUUMMMUMMUUMMUUUU...

user output
No

Test 29

Verdict: ACCEPTED

input
100
77 94
52 77
53 77
53 56
...

correct output
No

user output
No

Test 30

Verdict:

input
100
56 59
56 76
17 76
17 75
...

correct output
No

user output
Yes
UUMMMUMMUUMUUUUMUMUUMMUMMUMMMU...
Truncated

Test 31

Verdict:

input
100
19 70
70 86
27 86
27 31
...

correct output
Yes
MMMMUMMUMMUUMMUMUUUMMMUMUMUUMU...

user output
No

Test 32

Verdict:

input
200
28 148
28 122
28 137
122 178
...

correct output
Yes
UUMUMMMUUMMUMMMUMMUUMUMUMUMMMU...

user output
No

Test 33

Verdict: ACCEPTED

input
200
57 98
57 153
34 153
98 109
...

correct output
No

user output
No

Test 34

Verdict:

input
200
6 177
6 20
6 158
88 158
...

correct output
Yes
MUUMUMMMUMUUMUUUUUUMUMMMMUUMMU...

user output
No

Test 35

Verdict: ACCEPTED

input
200
142 178
119 142
142 155
119 140
...

correct output
No

user output
No

Test 36

Verdict:

input
200
83 150
68 83
68 158
135 158
...

correct output
Yes
MMMUUUUUUMUUUMUMUUMMMUMUUUMMUM...

user output
Yes
UUUUUMUUMMUUMMUMMUMUMMMMUMUUMM...
Truncated

Test 37

Verdict:

input
200
20 177
87 177
121 177
137 177
...

correct output
Yes
MMUMUMMMUUUMUMUMMMUMUMUUUUUUMM...

user output
Yes
UUMUUUUUMUMUUUUUUMMMUMMMMMMUUM...
Truncated

Test 38

Verdict:

input
200
13 139
13 38
13 34
10 38
...

correct output
Yes
MUMMUUMUUMUUMMUMMMMUMMUMUUUMMU...

user output
No

Test 39

Verdict:

input
200
84 198
77 198
52 198
53 77
...

correct output
Yes
MMMUMUMMMUUUUMUUUMMMMMUMUMUUUU...

user output
No

Test 40

Verdict: ACCEPTED

input
200
56 112
76 112
56 182
56 114
...

correct output
No

user output
No

Test 41

Verdict:

input
200
19 114
19 70
70 86
19 27
...

correct output
Yes
MMMUMUUUUUMUMMMMMMMUUMMUMMMMUM...

user output
Yes
UMMMMMUMUUUUMMUUUMMMUUUMMMUUMU...
Truncated

Test 42

Verdict:

input
1000
811 883
397 883
137 397
546 883
...

correct output
Yes
MMMMMUUMUMUUUUUUMUMUMMMMUMMUMM...

user output
No

Test 43

Verdict: ACCEPTED

input
1000
393 736
393 398
398 407
351 393
...

correct output
No

user output
No

Test 44

Verdict: ACCEPTED

input
1000
507 955
340 955
507 813
418 955
...

correct output
No

user output
No

Test 45

Verdict: ACCEPTED

input
1000
230 974
230 440
440 752
752 977
...

correct output
No

user output
No

Test 46

Verdict:

input
1000
406 944
778 944
68 944
545 778
...

correct output
Yes
UMUMMUMUUMUUMUUMUMMUUMUUMUUUUM...

user output
No

Test 47

Verdict:

input
1000
771 921
368 921
121 921
121 810
...

correct output
Yes
UMMUUUUUMUMMUMUMUUUUMMMMUMUUMM...

user output
No

Test 48

Verdict: ACCEPTED

input
1000
290 518
518 738
518 554
290 997
...

correct output
No

user output
No

Test 49

Verdict:

input
1000
370 791
390 791
390 835
585 835
...

correct output
Yes
MMUUUUUMMMUMMUMMMMMMUUMMUMMMMU...

user output
No

Test 50

Verdict:

input
1000
111 804
778 804
520 804
520 829
...

correct output
Yes
MMMUMUUUUUMMMUMMMMMUUMMUMMUUUU...

user output
No

Test 51

Verdict:

input
1000
627 823
399 627
27 399
27 945
...

correct output
Yes
MMUMMMMUUMMUUMUUUUUMUMMUMMMMMU...

user output
No

Test 52

Verdict: ACCEPTED

input
100000
26991 68205
21905 68205
3029 26991
21905 29288
...

correct output
No

user output
No

Test 53

Verdict:

input
100000
41845 94618
94618 96640
65841 94618
9894 96640
...

correct output
Yes
UMUUUMMUUUMMUMMUMUMMMUMMMUMUMU...

user output
No

Test 54

Verdict:

input
100000
11081 29940
11081 90273
11081 56653
56653 73314
...

correct output
Yes
UMMUUMMMUUMMMMMUUMMUUUMUMMMUUU...

user output
No

Test 55

Verdict:

input
100000
27549 31873
27549 48777
48777 71940
48777 59266
...

correct output
Yes
MMMMUUMUUMUMUMMUUUMMUMMMUMUUUM...

user output
No

Test 56

Verdict:

input
100000
2460 57807
2460 59927
56550 59927
35046 56550
...

correct output
Yes
MMMUUMMUMMUUUMMUMUMMMUMUUMUMUM...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 34, in <module>
    result...

Test 57

Verdict:

input
100000
13089 77222
77222 89616
36711 89616
27645 77222
...

correct output
Yes
UMUUUMMMUUUUMMUMMMUUMMUUMUMUMU...

user output
No

Test 58

Verdict:

input
100000
35805 70440
70440 82302
64483 82302
64483 96767
...

correct output
Yes
MMMUUMMMUUUMMMUUMUUMUMMUUUMUUM...

user output
No

Test 59

Verdict:

input
100000
16206 68738
37820 68738
55519 68738
55519 77758
...

correct output
Yes
MMUUUMUUMUUMUUMUMMMMMUMUUUUUUU...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 34, in <module>
    result...

Test 60

Verdict:

input
100000
47137 86808
47137 80136
47137 73346
73346 78144
...

correct output
Yes
UUMUMMUUUUMMMMMMMMUUMMMMMMUUMU...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 34, in <module>
    result...

Test 61

Verdict:

input
100000
39438 53660
53660 60245
20924 60245
20924 38669
...

correct output
No

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 34, in <module>
    result...