oj.uz

Submission #1048129

# Submission time Handle Problem Language Result Execution time Memory
1048129 2024-08-07T23:57:05 Z RauPro Mergers (JOI19_mergers) PyPy 3
70 / 100
 1576 ms 262144 KB 
import os
import sys
from collections import *
from heapq import *
from math import gcd, floor, ceil, sqrt
from copy import deepcopy
from itertools import permutations, combinations, product
from bisect import bisect_left, bisect_right
from functools import lru_cache, reduce
import operator
from random import getrandbits

# Para mejorar el rendimiento de la entrada/salida
input = lambda: sys.stdin.readline().strip()
flush = lambda: sys.stdout.flush()
print = lambda *args, **kwargs: sys.stdout.write(' '.join(map(str, args)) + kwargs.get("end", "\n")) and flush()

# Optimización de la recursión para Python
sys.setrecursionlimit(100000)


# Funciones para lectura de múltiples tipos de datos
def ints(): return map(int, input().split())
def strs(): return input().split()
def chars(): return list(input().strip())
def mat(n): return [list(ints()) for _ in range(n)]  # Matriz de n x m donde m es el número de enteros en una línea


# Constantes útiles
INF = float('inf')
MOD = 1000000007  # Modulo por defecto, cambiar si se necesita otro
abcd = "abcdefghijklmnopqrstuvwxyz"

# Algunas funciones útiles
def add(x, y, mod=MOD): return (x + y) % mod
def sub(x, y, mod=MOD): return (x - y) % mod
def mul(x, y, mod=MOD): return (x * y) % mod

# Inverso multiplicativo de a modulo m (cuando m es primo)
def invmod(a, mod=MOD): return powmod(a, mod - 2, mod)

def lcm(a, b): return a * b // gcd(a, b)

RANDOM = getrandbits(32)

class Wrapper(int):
    def __init__(self, x):
        int.__init__(x)
    def __hash__(self):
        return super(Wrapper, self).__hash__() ^ RANDOM


depth = []
parent = []
visited = []
AL = []
uf = None


class UF:
    def __init__(self, n):
        self.parent = list(range(n))
        self.size = [1] * n
        self.num_sets = n

    def find(self, a):
        acopy = a
        while a != self.parent[a]:
            a = self.parent[a]
        while acopy != a:
            self.parent[acopy], acopy = a, self.parent[acopy]
        return a

    def union(self, a, b):
        a, b = self.find(a), self.find(b)
        self.num_sets -= 1
        self.parent[b] = a
        self.size[a] += self.size[b]

    def set_size(self, a):
        return self.size[self.find(a)]

    def __len__(self):
        return self.num_sets


# Tree compression from vertex a to b
def path_compression(a, b):
    a = uf.find(a)
    b = uf.find(b)
    while a != b:
        if depth[a] < depth[b]:
            b, a = a, b
        uf.union(parent[a], a)
        a = uf.find(parent[a])


def dfs(u, lvl, p):
    global AL, visited, parent, depth, uf
    stack = [(u, lvl, p)]
    while stack:
        u, lvl, p = stack.pop()
        for v in AL[u]:
            if not visited[v]:
                stack.append((v, lvl+1, u))
        visited[u] = True
        depth[u] = lvl
        parent[u] = p
def main():
    global AL, visited, parent, depth, uf
    n, m = ints()
    AL = [[] for i in range(n+1)]
    for i in range(n-1):
        u,v = ints()
        AL[u].append(v)
        AL[v].append(u)
    tree_groups = [[] for i in range(n+1)]
    for i in range(n):
        g = int(input())
        tree_groups[g].append(i+1)

    #print(tree_groups)
    visited = [False] * (n+1)
    parent = [0] * (n+1)
    depth = [0] * (n + 1)
    dfs(1, 0, 1)

    #print(depth, parent)
    uf = UF(n+1)
    for group in tree_groups:
        for i in range(1, len(group)):
            path_compression(group[0], group[i])

    AL_aux = [set() for i in range(n+1)]
    for u in range(1, n+1):
        for v in AL[u]:
            if uf.find(u) != uf.find(v):
                AL_aux[uf.find(u)].add(uf.find(v))

    ans = sum([1 for it in AL_aux if len(it) == 1])
    #print(ans)
    #print(AL_aux)
    print((ans + 1) // 2)




if __name__ == "__main__":
    main()

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 24108 KB Output is correct
2 Correct 73 ms 24088 KB Output is correct
3 Correct 68 ms 23856 KB Output is correct
4 Correct 68 ms 23856 KB Output is correct
5 Correct 66 ms 23904 KB Output is correct
6 Correct 68 ms 23892 KB Output is correct
7 Correct 67 ms 23856 KB Output is correct
8 Correct 68 ms 24088 KB Output is correct
9 Correct 67 ms 23836 KB Output is correct
10 Correct 66 ms 23852 KB Output is correct
11 Correct 82 ms 24064 KB Output is correct
12 Correct 72 ms 23864 KB Output is correct
13 Correct 92 ms 23980 KB Output is correct
14 Correct 66 ms 24008 KB Output is correct
15 Correct 67 ms 23856 KB Output is correct
16 Correct 66 ms 23856 KB Output is correct
17 Correct 74 ms 23852 KB Output is correct
18 Correct 70 ms 24084 KB Output is correct
19 Correct 68 ms 23852 KB Output is correct
20 Correct 74 ms 23856 KB Output is correct
21 Correct 68 ms 24080 KB Output is correct
22 Correct 71 ms 24112 KB Output is correct
23 Correct 66 ms 23824 KB Output is correct
24 Correct 75 ms 23872 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 24108 KB Output is correct
2 Correct 73 ms 24088 KB Output is correct
3 Correct 68 ms 23856 KB Output is correct
4 Correct 68 ms 23856 KB Output is correct
5 Correct 66 ms 23904 KB Output is correct
6 Correct 68 ms 23892 KB Output is correct
7 Correct 67 ms 23856 KB Output is correct
8 Correct 68 ms 24088 KB Output is correct
9 Correct 67 ms 23836 KB Output is correct
10 Correct 66 ms 23852 KB Output is correct
11 Correct 82 ms 24064 KB Output is correct
12 Correct 72 ms 23864 KB Output is correct
13 Correct 92 ms 23980 KB Output is correct
14 Correct 66 ms 24008 KB Output is correct
15 Correct 67 ms 23856 KB Output is correct
16 Correct 66 ms 23856 KB Output is correct
17 Correct 74 ms 23852 KB Output is correct
18 Correct 70 ms 24084 KB Output is correct
19 Correct 68 ms 23852 KB Output is correct
20 Correct 74 ms 23856 KB Output is correct
21 Correct 68 ms 24080 KB Output is correct
22 Correct 71 ms 24112 KB Output is correct
23 Correct 66 ms 23824 KB Output is correct
24 Correct 75 ms 23872 KB Output is correct
25 Correct 70 ms 23876 KB Output is correct
26 Correct 134 ms 28952 KB Output is correct
27 Correct 123 ms 27436 KB Output is correct
28 Correct 145 ms 28132 KB Output is correct
29 Correct 103 ms 27672 KB Output is correct
30 Correct 123 ms 28692 KB Output is correct
31 Correct 69 ms 23856 KB Output is correct
32 Correct 111 ms 28184 KB Output is correct
33 Correct 64 ms 23852 KB Output is correct
34 Correct 111 ms 27416 KB Output is correct
35 Correct 106 ms 27668 KB Output is correct
36 Correct 134 ms 29332 KB Output is correct
37 Correct 121 ms 28184 KB Output is correct
38 Correct 68 ms 23904 KB Output is correct
39 Correct 124 ms 29204 KB Output is correct
40 Correct 121 ms 28440 KB Output is correct
41 Correct 124 ms 28952 KB Output is correct
42 Correct 117 ms 28948 KB Output is correct
43 Correct 105 ms 27416 KB Output is correct
44 Correct 65 ms 23916 KB Output is correct
45 Correct 105 ms 27152 KB Output is correct
46 Correct 124 ms 29268 KB Output is correct
47 Correct 70 ms 23924 KB Output is correct
48 Correct 134 ms 29976 KB Output is correct
49 Correct 109 ms 27876 KB Output is correct
50 Correct 100 ms 27672 KB Output is correct
51 Correct 129 ms 29208 KB Output is correct
52 Correct 115 ms 28408 KB Output is correct
53 Correct 118 ms 29200 KB Output is correct
54 Correct 118 ms 28696 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 24108 KB Output is correct
2 Correct 73 ms 24088 KB Output is correct
3 Correct 68 ms 23856 KB Output is correct
4 Correct 68 ms 23856 KB Output is correct
5 Correct 66 ms 23904 KB Output is correct
6 Correct 68 ms 23892 KB Output is correct
7 Correct 67 ms 23856 KB Output is correct
8 Correct 68 ms 24088 KB Output is correct
9 Correct 67 ms 23836 KB Output is correct
10 Correct 66 ms 23852 KB Output is correct
11 Correct 82 ms 24064 KB Output is correct
12 Correct 72 ms 23864 KB Output is correct
13 Correct 92 ms 23980 KB Output is correct
14 Correct 66 ms 24008 KB Output is correct
15 Correct 67 ms 23856 KB Output is correct
16 Correct 66 ms 23856 KB Output is correct
17 Correct 74 ms 23852 KB Output is correct
18 Correct 70 ms 24084 KB Output is correct
19 Correct 68 ms 23852 KB Output is correct
20 Correct 74 ms 23856 KB Output is correct
21 Correct 68 ms 24080 KB Output is correct
22 Correct 71 ms 24112 KB Output is correct
23 Correct 66 ms 23824 KB Output is correct
24 Correct 75 ms 23872 KB Output is correct
25 Correct 68 ms 23856 KB Output is correct
26 Correct 284 ms 65816 KB Output is correct
27 Correct 281 ms 54036 KB Output is correct
28 Correct 117 ms 27416 KB Output is correct
29 Correct 66 ms 23856 KB Output is correct
30 Correct 67 ms 23864 KB Output is correct
31 Correct 329 ms 54296 KB Output is correct
32 Correct 106 ms 27240 KB Output is correct
33 Correct 288 ms 52548 KB Output is correct
34 Correct 291 ms 57364 KB Output is correct
35 Correct 130 ms 29464 KB Output is correct
36 Correct 263 ms 53016 KB Output is correct
37 Correct 118 ms 28436 KB Output is correct
38 Correct 166 ms 29208 KB Output is correct
39 Correct 266 ms 63256 KB Output is correct
40 Correct 105 ms 27408 KB Output is correct
41 Correct 282 ms 57128 KB Output is correct
42 Correct 257 ms 53016 KB Output is correct
43 Correct 68 ms 24092 KB Output is correct
44 Correct 239 ms 52248 KB Output is correct
45 Correct 284 ms 54040 KB Output is correct
46 Correct 111 ms 28440 KB Output is correct
47 Correct 118 ms 27148 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 66328 KB Output is correct
2 Correct 291 ms 89864 KB Output is correct
3 Correct 140 ms 29616 KB Output is correct
4 Correct 108 ms 27160 KB Output is correct
5 Correct 68 ms 23864 KB Output is correct
6 Correct 67 ms 23852 KB Output is correct
7 Correct 105 ms 27408 KB Output is correct
8 Correct 471 ms 64536 KB Output is correct
9 Correct 131 ms 29360 KB Output is correct
10 Correct 348 ms 54804 KB Output is correct
11 Correct 87 ms 24088 KB Output is correct
12 Correct 327 ms 54092 KB Output is correct
13 Correct 440 ms 67536 KB Output is correct
14 Correct 324 ms 79128 KB Output is correct
15 Correct 258 ms 61720 KB Output is correct
16 Correct 118 ms 28952 KB Output is correct
17 Correct 66 ms 24088 KB Output is correct
18 Correct 362 ms 90648 KB Output is correct
19 Correct 325 ms 78528 KB Output is correct
20 Correct 124 ms 28756 KB Output is correct
21 Correct 80 ms 24084 KB Output is correct
22 Correct 325 ms 66996 KB Output is correct
23 Correct 136 ms 29976 KB Output is correct
24 Correct 370 ms 60916 KB Output is correct
25 Correct 295 ms 81436 KB Output is correct
26 Correct 101 ms 28160 KB Output is correct
27 Correct 109 ms 27668 KB Output is correct
28 Correct 126 ms 28952 KB Output is correct
29 Correct 115 ms 28440 KB Output is correct
30 Correct 120 ms 29204 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 24108 KB Output is correct
2 Correct 73 ms 24088 KB Output is correct
3 Correct 68 ms 23856 KB Output is correct
4 Correct 68 ms 23856 KB Output is correct
5 Correct 66 ms 23904 KB Output is correct
6 Correct 68 ms 23892 KB Output is correct
7 Correct 67 ms 23856 KB Output is correct
8 Correct 68 ms 24088 KB Output is correct
9 Correct 67 ms 23836 KB Output is correct
10 Correct 66 ms 23852 KB Output is correct
11 Correct 82 ms 24064 KB Output is correct
12 Correct 72 ms 23864 KB Output is correct
13 Correct 92 ms 23980 KB Output is correct
14 Correct 66 ms 24008 KB Output is correct
15 Correct 67 ms 23856 KB Output is correct
16 Correct 66 ms 23856 KB Output is correct
17 Correct 74 ms 23852 KB Output is correct
18 Correct 70 ms 24084 KB Output is correct
19 Correct 68 ms 23852 KB Output is correct
20 Correct 74 ms 23856 KB Output is correct
21 Correct 68 ms 24080 KB Output is correct
22 Correct 71 ms 24112 KB Output is correct
23 Correct 66 ms 23824 KB Output is correct
24 Correct 75 ms 23872 KB Output is correct
25 Correct 70 ms 23876 KB Output is correct
26 Correct 134 ms 28952 KB Output is correct
27 Correct 123 ms 27436 KB Output is correct
28 Correct 145 ms 28132 KB Output is correct
29 Correct 103 ms 27672 KB Output is correct
30 Correct 123 ms 28692 KB Output is correct
31 Correct 69 ms 23856 KB Output is correct
32 Correct 111 ms 28184 KB Output is correct
33 Correct 64 ms 23852 KB Output is correct
34 Correct 111 ms 27416 KB Output is correct
35 Correct 106 ms 27668 KB Output is correct
36 Correct 134 ms 29332 KB Output is correct
37 Correct 121 ms 28184 KB Output is correct
38 Correct 68 ms 23904 KB Output is correct
39 Correct 124 ms 29204 KB Output is correct
40 Correct 121 ms 28440 KB Output is correct
41 Correct 124 ms 28952 KB Output is correct
42 Correct 117 ms 28948 KB Output is correct
43 Correct 105 ms 27416 KB Output is correct
44 Correct 65 ms 23916 KB Output is correct
45 Correct 105 ms 27152 KB Output is correct
46 Correct 124 ms 29268 KB Output is correct
47 Correct 70 ms 23924 KB Output is correct
48 Correct 134 ms 29976 KB Output is correct
49 Correct 109 ms 27876 KB Output is correct
50 Correct 100 ms 27672 KB Output is correct
51 Correct 129 ms 29208 KB Output is correct
52 Correct 115 ms 28408 KB Output is correct
53 Correct 118 ms 29200 KB Output is correct
54 Correct 118 ms 28696 KB Output is correct
55 Correct 68 ms 23856 KB Output is correct
56 Correct 284 ms 65816 KB Output is correct
57 Correct 281 ms 54036 KB Output is correct
58 Correct 117 ms 27416 KB Output is correct
59 Correct 66 ms 23856 KB Output is correct
60 Correct 67 ms 23864 KB Output is correct
61 Correct 329 ms 54296 KB Output is correct
62 Correct 106 ms 27240 KB Output is correct
63 Correct 288 ms 52548 KB Output is correct
64 Correct 291 ms 57364 KB Output is correct
65 Correct 130 ms 29464 KB Output is correct
66 Correct 263 ms 53016 KB Output is correct
67 Correct 118 ms 28436 KB Output is correct
68 Correct 166 ms 29208 KB Output is correct
69 Correct 266 ms 63256 KB Output is correct
70 Correct 105 ms 27408 KB Output is correct
71 Correct 282 ms 57128 KB Output is correct
72 Correct 257 ms 53016 KB Output is correct
73 Correct 68 ms 24092 KB Output is correct
74 Correct 239 ms 52248 KB Output is correct
75 Correct 284 ms 54040 KB Output is correct
76 Correct 111 ms 28440 KB Output is correct
77 Correct 118 ms 27148 KB Output is correct
78 Correct 312 ms 66328 KB Output is correct
79 Correct 291 ms 89864 KB Output is correct
80 Correct 140 ms 29616 KB Output is correct
81 Correct 108 ms 27160 KB Output is correct
82 Correct 68 ms 23864 KB Output is correct
83 Correct 67 ms 23852 KB Output is correct
84 Correct 105 ms 27408 KB Output is correct
85 Correct 471 ms 64536 KB Output is correct
86 Correct 131 ms 29360 KB Output is correct
87 Correct 348 ms 54804 KB Output is correct
88 Correct 87 ms 24088 KB Output is correct
89 Correct 327 ms 54092 KB Output is correct
90 Correct 440 ms 67536 KB Output is correct
91 Correct 324 ms 79128 KB Output is correct
92 Correct 258 ms 61720 KB Output is correct
93 Correct 118 ms 28952 KB Output is correct
94 Correct 66 ms 24088 KB Output is correct
95 Correct 362 ms 90648 KB Output is correct
96 Correct 325 ms 78528 KB Output is correct
97 Correct 124 ms 28756 KB Output is correct
98 Correct 80 ms 24084 KB Output is correct
99 Correct 325 ms 66996 KB Output is correct
100 Correct 136 ms 29976 KB Output is correct
101 Correct 370 ms 60916 KB Output is correct
102 Correct 295 ms 81436 KB Output is correct
103 Correct 101 ms 28160 KB Output is correct
104 Correct 109 ms 27668 KB Output is correct
105 Correct 126 ms 28952 KB Output is correct
106 Correct 115 ms 28440 KB Output is correct
107 Correct 120 ms 29204 KB Output is correct
108 Correct 1525 ms 225168 KB Output is correct
109 Correct 1299 ms 168184 KB Output is correct
110 Correct 1317 ms 167716 KB Output is correct
111 Runtime error 1576 ms 262144 KB Execution killed with signal 9
112 Halted 0 ms 0 KB -