#607861 (PyPy3) No.1266 7 Colors

• 問題: No.1266 7 Colors
• ユーザー: tcltk
• 提出日時: 2021-01-21 15:41:06
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,405 ms / 3,000 ms
• コード長: 4,331 bytes
• コンパイル時間: 907 ms
• コンパイル使用メモリ: 82,176 KB
• 実行使用メモリ: 131,200 KB
• 最終ジャッジ日時: 2024-12-24 15:43:04
• 合計ジャッジ時間: 21,898 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
#region Header
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
from queue import PriorityQueue
import bisect
import heapq
def input():
    return sys.stdin.readline()[:-1]
sys.setrecursionlimit(1000000)
#endregion
# _INPUT = """3 2 3
# 1010000
# 1000000
# 0010000
# 1 2
# 1 3
# 2 1 0
# 1 1 2
# 2 1 0
# """
# sys.stdin = io.StringIO(_INPUT)
# サイズを保持する Union-Find tree
class UnionFind():
    parents = []
    sizes = []
    count = 0
    def __init__(self, n):
        self.count = n
        self.parents = [i for i in range(n)]
        self.sizes = [1 for i in range(n)]
    def find(self, i):
        if self.parents[i] == i:
            return i
        else:
            self.parents[i] = self.find(self.parents[i])
            return self.parents[i]
    def unite(self, i, j):
        root_i = self.find(i)
        root_j = self.find(j)
        if root_i == root_j:
            return
        elif root_i < root_j:
            self.parents[root_j] = root_i
            self.sizes[root_i] += self.sizes[root_j]
        else:
            self.parents[root_i] = root_j
            self.sizes[root_j] += self.sizes[root_i]
    def same(self, i, j):
        return self.find(i) == self.find(j)
    def size(self, i):
        return self.sizes[self.find(i)]
# def dfs(G, colors, seen, city, color):
#     next_colors = set([color])
#     seen[city][color] = True
#     i = (color + 1) % 7
#     while colors[city][i] and (i not in next_colors):
#         if not seen[city][i]:
#             seen[city][i] = True
#             next_colors.add(i)
#         i = (i + 1) % 7
#     i = (color - 1) % 7
#     while colors[city][i] and (i not in next_colors):
#         if not seen[city][i]:
#             seen[city][i] = True
#             next_colors.add(i)
#         i = (i - 1) % 7
#     n = 0
#     for next_color in next_colors:
#         n += 1
#         for next_city in G[city]:
#             if colors[next_city][next_color] and (not seen[next_city][next_color]):
#                 n += dfs(G, colors, seen, next_city, next_color)
#     return n
def add_color(uf, N, G, colors, city, color):
    if colors[city][color]:
        return
    colors[city][color] = True
    i = (color + 1) % 7
    while colors[city][i] and (not uf.same(city * 7 + color, city * 7 + i)):
        uf.unite(city * 7 + color, city * 7 + i)
        i = (i + 1) % 7
    i = (color - 1) % 7
    while colors[city][i] and (not uf.same(city * 7 + color, city * 7 + i)):
        uf.unite(city * 7 + color, city * 7 + i)
        i = (i - 1) % 7
    for next_city in G[city]:
        if colors[next_city][color]:
            uf.unite(city * 7 + color, next_city * 7 + color)
def main():
    # N, M, Q = map(int, input().split())
    # colors = [None for _ in range(N)]
    # for i in range(N):
    #     s = input()
    #     colors[i] = [(s[j] == '1') for j in range(7)]
    # G = [list() for _ in range(N)]
    # for _ in range(M):
    #     _u, _v = map(int, input().split())
    #     G[_u-1].append(_v-1)
    #     G[_v-1].append(_u-1)
    # for _ in range(Q):
    #     t, x, y = map(int, input().split())
    #     if t == 1:
    #         colors[x-1][y-1] = True
    #     else:
    #         seen = [[False for _ in range(7)] for _ in range(N)]
    #         n = dfs(G, colors, seen, x-1, 0)
    #         print(n)
    N, M, Q = map(int, input().split())
    uf = UnionFind(N * 7)
    colors_s = [input() for _ in range(N)]
    G = [list() for _ in range(N)]
    for _ in range(M):
        u, v = map(int, input().split())
        u -= 1
        v -= 1
        G[u].append(v)
        G[v].append(u)
    colors = [[False] * 7 for _ in range(N)]
    for city in range(N):
        for color in range(7):
            if colors_s[city][color] == '1':
                add_color(uf, N, G, colors, city, color)
    for _ in range(Q):
        t, x, y = map(int, input().split())
        if t == 1:
            add_color(uf, N, G, colors, x - 1, y - 1)
        else:
            n = uf.size((x - 1) * 7 + 0)
            print(n)
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX