(cache)Submission #64139381 - AtCoder Regular Contest 195 (Div. 2)

Contest Duration: 2025-03-23(Sun) 21:00 - 2025-03-23(Sun) 23:00 (local time) (120 minutes) Back to Home

Submission #64139381

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import collections
import heapq
N,M=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
D=collections.defaultdict(list)
for i in range(N):
    a=A[i]
    heapq.heappush(D[a],i)
    
now_f=-1
now_s=-1
#print(D)
f=True
for i in range(M):
    b=B[i]
    if not b in D:
        f=False
        break
    while D[b] and D[b][0]<now_f: 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import collections
import heapq
N,M=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

D=collections.defaultdict(list)
for i in range(N):
    a=A[i]
    heapq.heappush(D[a],i)
    
now_f=-1
now_s=-1
#print(D)
f=True
for i in range(M):
    b=B[i]
    if not b in D:
        f=False
        break
    while D[b] and D[b][0]<now_f: 
        heapq.heappop(D[b])
    if len(D[b])==0:
        f=False
        break
    now_f=heapq.heappop(D[b])
    
s=True
for i in range(M):
    b=B[i]
    if not b in D:
        s=False
        break
    while D[b] and D[b][0]<now_s: 
        heapq.heappop(D[b])
    if len(D[b])==0:
        s=False
        break
    now_s=heapq.heappop(D[b])
if f and s:
    print("Yes")
else:
    print("No")

Submission Info

Submission Time	2025-03-23 22:07:38
Task	A - Twice Subsequence
User	kotafuku
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	807 Byte
Status	WA
Exec Time	277 ms
Memory	153260 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 400

Status

× 3

AC	× 28
WA	× 20

Set Name	Test Cases
Sample	00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All	00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_handmade_01.txt, 01_handmade_02.txt, 01_handmade_03.txt, 01_handmade_04.txt, 01_handmade_05.txt, 02_small_01.txt, 02_small_02.txt, 02_small_03.txt, 02_small_04.txt, 02_small_05.txt, 03_medium_01.txt, 03_medium_02.txt, 03_medium_03.txt, 03_medium_04.txt, 03_medium_05.txt, 04_large_01.txt, 04_large_02.txt, 04_large_03.txt, 04_large_04.txt, 04_large_05.txt, 05_max_01.txt, 05_max_02.txt, 05_max_03.txt, 05_max_04.txt, 05_max_05.txt, 06_not_emerge_01.txt, 06_not_emerge_02.txt, 06_not_emerge_03.txt, 07_emerge_once_01.txt, 07_emerge_once_02.txt, 07_emerge_once_03.txt, 07_emerge_once_04.txt, 07_emerge_once_05.txt, 08_emerge_twice_01.txt, 08_emerge_twice_02.txt, 08_emerge_twice_03.txt, 08_emerge_twice_04.txt, 08_emerge_twice_05.txt, 09_one_two_only_01.txt, 09_one_two_only_02.txt, 09_one_two_only_03.txt, 09_one_two_only_04.txt, 09_one_two_only_05.txt, 09_one_two_only_06.txt, 09_one_two_only_07.txt

Case Name	Status	Exec Time	Memory
00_sample_01.txt	AC	74 ms	76852 KiB
00_sample_02.txt	AC	73 ms	76740 KiB
00_sample_03.txt	AC	75 ms	76812 KiB
01_handmade_01.txt	AC	73 ms	76848 KiB
01_handmade_02.txt	AC	207 ms	142908 KiB
01_handmade_03.txt	WA	185 ms	150776 KiB
01_handmade_04.txt	AC	121 ms	148340 KiB
01_handmade_05.txt	AC	186 ms	150612 KiB
02_small_01.txt	AC	73 ms	76744 KiB
02_small_02.txt	WA	72 ms	76752 KiB
02_small_03.txt	WA	71 ms	76832 KiB
02_small_04.txt	WA	72 ms	76824 KiB
02_small_05.txt	AC	72 ms	77148 KiB
03_medium_01.txt	AC	76 ms	81028 KiB
03_medium_02.txt	AC	74 ms	77052 KiB
03_medium_03.txt	WA	73 ms	76856 KiB
03_medium_04.txt	AC	72 ms	76856 KiB
03_medium_05.txt	WA	73 ms	76700 KiB
04_large_01.txt	AC	104 ms	85984 KiB
04_large_02.txt	WA	167 ms	131400 KiB
04_large_03.txt	AC	192 ms	153000 KiB
04_large_04.txt	WA	172 ms	103464 KiB
04_large_05.txt	WA	213 ms	145380 KiB
05_max_01.txt	WA	193 ms	147720 KiB
05_max_02.txt	WA	197 ms	147596 KiB
05_max_03.txt	AC	195 ms	147968 KiB
05_max_04.txt	WA	223 ms	147536 KiB
05_max_05.txt	AC	252 ms	152824 KiB
06_not_emerge_01.txt	AC	144 ms	148036 KiB
06_not_emerge_02.txt	AC	143 ms	147628 KiB
06_not_emerge_03.txt	AC	127 ms	130416 KiB
07_emerge_once_01.txt	AC	277 ms	144064 KiB
07_emerge_once_02.txt	AC	206 ms	153076 KiB
07_emerge_once_03.txt	AC	228 ms	142944 KiB
07_emerge_once_04.txt	AC	207 ms	153260 KiB
07_emerge_once_05.txt	AC	158 ms	122196 KiB
08_emerge_twice_01.txt	WA	262 ms	138656 KiB
08_emerge_twice_02.txt	WA	212 ms	149596 KiB
08_emerge_twice_03.txt	WA	239 ms	142724 KiB
08_emerge_twice_04.txt	WA	257 ms	143596 KiB
08_emerge_twice_05.txt	WA	234 ms	144720 KiB
09_one_two_only_01.txt	AC	152 ms	134164 KiB
09_one_two_only_02.txt	WA	150 ms	134212 KiB
09_one_two_only_03.txt	WA	217 ms	132600 KiB
09_one_two_only_04.txt	WA	215 ms	131316 KiB
09_one_two_only_05.txt	AC	191 ms	141024 KiB
09_one_two_only_06.txt	AC	179 ms	123572 KiB
09_one_two_only_07.txt	AC	195 ms	136712 KiB