#607848 (PyPy3) No.1266 7 Colors

• 問題: No.1266 7 Colors
• ユーザー: tcltk
• 提出日時: 2021-01-21 14:50:57
• 言語: PyPy3 (7.3.15)
• 結果: MLE
• 実行時間: -
• コード長: 1,940 bytes
• コンパイル時間: 377 ms
• コンパイル使用メモリ: 81,920 KB
• 実行使用メモリ: 1,703,972 KB
• 最終ジャッジ日時: 2024-12-24 14:46:45
• 合計ジャッジ時間: 82,008 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 2 MLE * 1
other	TLE * 16 MLE * 3

ソースコード

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
#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)
def dfs(G, colors, seen, city, color):
    next_colors = set([color])
    i = (color + 1) % 7
    while colors[city][i]:
        next_colors.add(i)
        i = (i + 1) % 7
        if i == color:
            break
    i = (color - 1) % 7
    while colors[city][i]:
        next_colors.add(i)
        i = (i - 1) % 7
        if i == color:
            break
    n = 0
    for next_color in next_colors:
        if not seen[city][next_color]:
            n += 1
            seen[city][next_color] = True
        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 main():
    N, M, Q = map(int, input().split())
    colors = [[False for _ in range(7)] for _ in range(N)]
    for i in range(N):
        s = input()
        for j in range(7):
            if s[j] == '1':
                colors[i][j] = True
    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)
    color = 0
    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)
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX