236262026-01-26 17:24:15vyrallBizonyításpython3Time limit exceeded 15/501.09s6964 KiB
from collections import deque

n, q = map(int, input().split())
adj = [[] for _ in range(500)]

def possible_bfs(graph, start, end):
    visited = [False] * 500
    queue = deque()
    visited[start] = True
    queue.append(start)
    while queue:
        curr = queue.popleft()
        if curr == end:
            return True
        for nextNode in graph[curr]:
            if not visited[nextNode]:
                visited[nextNode] = True
                queue.append(nextNode)

    return False

for _ in range(q):
    t, x, y = map(int, input().split())
    if t == 1:
        adj[x - 1].append(y - 1)
    else:
        if possible_bfs(adj, x-1, y-1):
            print("IGEN")
        else:
            print("NEM")
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted18ms3568 KiB
2Time limit exceeded1.075s3892 KiB
subtask20/10
3Accepted28ms3324 KiB
4Accepted122ms3636 KiB
5Accepted713ms4148 KiB
6Accepted628ms4152 KiB
7Time limit exceeded1.08s4148 KiB
8Accepted23ms3452 KiB
9Accepted24ms3380 KiB
10Accepted199ms3636 KiB
11Accepted912ms4148 KiB
12Accepted449ms4148 KiB
subtask315/15
13Accepted19ms3380 KiB
14Accepted25ms3576 KiB
15Accepted19ms3380 KiB
16Accepted23ms3392 KiB
17Accepted19ms3380 KiB
18Accepted20ms3384 KiB
19Accepted18ms3572 KiB
20Accepted20ms3428 KiB
21Accepted21ms3380 KiB
22Accepted21ms3384 KiB
23Accepted24ms3376 KiB
24Accepted19ms3380 KiB
25Accepted24ms3384 KiB
26Accepted24ms3380 KiB
27Accepted20ms3388 KiB
28Accepted20ms3380 KiB
29Accepted24ms3380 KiB
30Accepted19ms3764 KiB
31Accepted21ms3380 KiB
32Accepted18ms3380 KiB
33Accepted20ms3380 KiB
34Accepted19ms3576 KiB
35Accepted19ms3576 KiB
36Accepted21ms3568 KiB
37Accepted23ms3380 KiB
38Accepted21ms3380 KiB
subtask40/25
39Accepted19ms3380 KiB
40Time limit exceeded1.083s3636 KiB
41Accepted28ms3324 KiB
42Accepted122ms3636 KiB
43Accepted713ms4148 KiB
44Accepted628ms4152 KiB
45Time limit exceeded1.08s4148 KiB
46Accepted23ms3452 KiB
47Accepted24ms3380 KiB
48Accepted199ms3636 KiB
49Accepted912ms4148 KiB
50Accepted449ms4148 KiB
51Accepted25ms3576 KiB
52Accepted19ms3380 KiB
53Accepted23ms3392 KiB
54Accepted19ms3380 KiB
55Accepted20ms3384 KiB
56Accepted18ms3572 KiB
57Accepted20ms3428 KiB
58Accepted21ms3380 KiB
59Accepted21ms3384 KiB
60Accepted24ms3376 KiB
61Accepted19ms3380 KiB
62Accepted24ms3384 KiB
63Accepted24ms3380 KiB
64Accepted20ms3388 KiB
65Accepted20ms3380 KiB
66Accepted24ms3380 KiB
67Accepted19ms3764 KiB
68Accepted21ms3380 KiB
69Accepted18ms3380 KiB
70Accepted20ms3380 KiB
71Accepted19ms3576 KiB
72Accepted19ms3576 KiB
73Accepted21ms3568 KiB
74Accepted23ms3380 KiB
75Accepted21ms3380 KiB
76Time limit exceeded1.083s3636 KiB
77Accepted606ms3656 KiB
78Time limit exceeded1.085s3636 KiB
79Accepted708ms3636 KiB
80Time limit exceeded1.085s3636 KiB
81Time limit exceeded1.085s3740 KiB
82Time limit exceeded1.085s3640 KiB
83Time limit exceeded1.08s3848 KiB
84Time limit exceeded1.085s3636 KiB
85Time limit exceeded1.085s3744 KiB
86Time limit exceeded1.085s3624 KiB
87Time limit exceeded1.08s3808 KiB
88Time limit exceeded1.085s3636 KiB
89Time limit exceeded1.085s3828 KiB
90Time limit exceeded1.085s4148 KiB
91Time limit exceeded1.087s6964 KiB
92Time limit exceeded1.085s4148 KiB
93Time limit exceeded1.085s6452 KiB
94Time limit exceeded1.085s4124 KiB
95Time limit exceeded1.09s4408 KiB
96Time limit exceeded1.083s5592 KiB
97Time limit exceeded1.085s6500 KiB
98Time limit exceeded1.085s3892 KiB
99Time limit exceeded1.085s4932 KiB
100Time limit exceeded1.075s4508 KiB
101Time limit exceeded1.075s4404 KiB
102Time limit exceeded1.075s4596 KiB
103Time limit exceeded1.082s4636 KiB
104Time limit exceeded1.08s4508 KiB