Submission #65245984


Source Code Expand

Copy
N,M,Q=map(int,input().split())
D=[False]*N
res=[set() for i in range(N)]
for i in range(Q):
A=list(map(int,input().split()))
if A[0]==1:
_,x,y=A
x-=1
res[x].add(y)
elif A[0]==2:
_,x=A
x-=1
D[x]=True
else:
_,x,y=A
x-=1
if D[x]:
print("Yes")
else:
if y in res[x]:
print("Yes")
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
N,M,Q=map(int,input().split())
D=[False]*N
res=[set() for i in range(N)]
for i in range(Q):
    A=list(map(int,input().split()))
    if A[0]==1:
        _,x,y=A
        x-=1
        res[x].add(y)
    elif A[0]==2:
        _,x=A
        x-=1
        D[x]=True
    else:
        _,x,y=A
        x-=1
        if D[x]:
            print("Yes")
        else:
            if y in res[x]:
                print("Yes")
            else:
                print("No")

Submission Info

Submission Time
Task C - 403 Forbidden
User kotafuku
Language Python (PyPy 3.10-v7.3.12)
Score 300
Code Size 478 Byte
Status AC
Exec Time 371 ms
Memory 112144 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 43
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt, 01_random_30.txt, 01_random_31.txt, 01_random_32.txt, 01_random_33.txt, 01_random_34.txt, 01_random_35.txt, 01_random_36.txt, 02_handmade_01.txt, 02_handmade_02.txt, 02_handmade_03.txt, 02_handmade_04.txt, 02_handmade_05.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 55 ms 76568 KiB
00_sample_02.txt AC 55 ms 76460 KiB
01_random_01.txt AC 241 ms 83856 KiB
01_random_02.txt AC 264 ms 83172 KiB
01_random_03.txt AC 278 ms 83948 KiB
01_random_04.txt AC 274 ms 83400 KiB
01_random_05.txt AC 242 ms 84708 KiB
01_random_06.txt AC 269 ms 84240 KiB
01_random_07.txt AC 283 ms 84228 KiB
01_random_08.txt AC 269 ms 83868 KiB
01_random_09.txt AC 247 ms 89388 KiB
01_random_10.txt AC 280 ms 92276 KiB
01_random_11.txt AC 296 ms 93252 KiB
01_random_12.txt AC 266 ms 83456 KiB
01_random_13.txt AC 255 ms 86216 KiB
01_random_14.txt AC 286 ms 86316 KiB
01_random_15.txt AC 301 ms 86124 KiB
01_random_16.txt AC 270 ms 83144 KiB
01_random_17.txt AC 257 ms 87412 KiB
01_random_18.txt AC 289 ms 89432 KiB
01_random_19.txt AC 299 ms 90472 KiB
01_random_20.txt AC 273 ms 83848 KiB
01_random_21.txt AC 254 ms 87956 KiB
01_random_22.txt AC 290 ms 90500 KiB
01_random_23.txt AC 305 ms 90944 KiB
01_random_24.txt AC 281 ms 83628 KiB
01_random_25.txt AC 330 ms 107156 KiB
01_random_26.txt AC 371 ms 110572 KiB
01_random_27.txt AC 368 ms 111824 KiB
01_random_28.txt AC 311 ms 94752 KiB
01_random_29.txt AC 318 ms 106768 KiB
01_random_30.txt AC 362 ms 110980 KiB
01_random_31.txt AC 370 ms 112008 KiB
01_random_32.txt AC 323 ms 94632 KiB
01_random_33.txt AC 337 ms 107448 KiB
01_random_34.txt AC 359 ms 110012 KiB
01_random_35.txt AC 359 ms 112144 KiB
01_random_36.txt AC 321 ms 94952 KiB
02_handmade_01.txt AC 60 ms 84008 KiB
02_handmade_02.txt AC 60 ms 83788 KiB
02_handmade_03.txt AC 297 ms 92480 KiB
02_handmade_04.txt AC 285 ms 89812 KiB
02_handmade_05.txt AC 301 ms 107272 KiB


2025-06-30 (Mon)
12:06:34 +09:00