#570694 (PyPy3) No.1266 7 Colors

• 問題: No.1266 7 Colors
• ユーザー: brthyyjp
• 提出日時: 2020-10-23 23:28:55
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 2,081 ms / 3,000 ms
• コード長: 2,513 bytes
• コンパイル時間: 259 ms
• コンパイル使用メモリ: 81,920 KB
• 実行使用メモリ: 169,856 KB
• 最終ジャッジ日時: 2024-07-21 13:25:48
• 合計ジャッジ時間: 23,654 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
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
import sys
import io, os
input = sys.stdin.buffer.readline
n,m,q = map(int, input().split())
S = [list(str(input())) for _ in range(n)]
#print(S)
S = [s[2:-3] for s in S]
g = [[] for _ in range(n)]
for i in range(m):
    u, v = map(int, input().split())
    u, v = u-1, v-1
    g[u].append(v)
    g[v].append(u)
def Find(x, par):
    if par[x] < 0:
        return x
    else:
        par[x] = Find(par[x], par)
        return par[x]
def Unite(x, y, par, rank):
    x = Find(x, par)
    y = Find(y, par)
    if x != y:
        if rank[x] < rank[y]:
            par[y] += par[x]
            par[x] = y
        else:
            par[x] += par[y]
            par[y] = x
            if rank[x] == rank[y]:
                rank[x] += 1
def Same(x, y, par):
    return Find(x, par) == Find(y, par)
def Size(x, par):
    return -par[Find(x, par)]
N = n*7
par = [-1]*N
rank = [0]*N
for c in range(7):
    for v in range(n):
        for u in g[v]:
            if S[v][c] == '1' and S[u][c] == '1':
                Unite(n*c+v, n*c+u, par, rank)
for c in range(7):
    for v in range(n):
        if S[v][c] == '1':
            if c == 0:
                if S[v][6] == '1':
                    Unite(v, n*6+v, par, rank)
                if S[v][1] == '1':
                    Unite(v, n*1+v, par, rank)
            elif c == 6:
                if S[v][0] == '1':
                    Unite(n*6+v, v, par, rank)
                if S[v][5] == '1':
                    Unite(n*6+v, n*5+v, par, rank)
            else:
                if S[v][c-1] == '1':
                    Unite(n*c+v, n*(c-1)+v, par, rank)
                if S[v][c+1] == '1':
                    Unite(n*c+v, n*(c+1)+v, par, rank)
for i in range(q):
    t, x, y = map(int, input().split())
    if t == 2:
        x -= 1
        print(Size(x, par))
    else:
        x, y = x-1, y-1
        S[x][y] = '1'
        for u in g[x]:
            if S[u][y] == '1':
                Unite(n*y+x, n*y+u, par, rank)
        if y == 0:
            if S[x][6] == '1':
                Unite(x, n*6+x, par, rank)
            if S[x][1] == '1':
                Unite(x, n*1+x, par, rank)
        elif y == 6:
            if S[x][0] == '1':
                Unite(n*6+x, x, par, rank)
            if S[x][5] == '1':
                Unite(n*6+x, n*5+x, par, rank)
        else:
            if S[x][y-1] == '1':
                Unite(n*y+x, n*(y-1)+x, par, rank)
            if S[x][y+1] == '1':
                Unite(n*y+x, n*(y+1)+x, par, rank)
        #print(par)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX