(cache)Submission #64139091 - 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 #64139091

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)
for i in range(M):
    b=B[i]
    if not b in D:
        print("No")
        break
    while D[b] and D[b][0]<now_f: 
        heapq.heappop(D[b])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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)
for i in range(M):
    b=B[i]
    if not b in D:
        print("No")
        break
    while D[b] and D[b][0]<now_f: 
        heapq.heappop(D[b])
    if len(D[b])==0:
        print("No")
        break
    now_f=heapq.heappop(D[b])
    
    while D[b] and D[b][0]<now_s: 
        heapq.heappop(D[b])
    if len(D[b])==0:
        print("No")
        break
    now_s=heapq.heappop(D[b])
    
else:
    print("Yes")

Submission Info

Submission Time	2025-03-23 22:04:22
Task	A - Twice Subsequence
User	kotafuku
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	695 Byte
Status	WA
Exec Time	240 ms
Memory	153060 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	68 ms	76840 KiB
00_sample_02.txt	AC	69 ms	76776 KiB
00_sample_03.txt	AC	69 ms	76900 KiB
01_handmade_01.txt	AC	69 ms	77036 KiB
01_handmade_02.txt	AC	199 ms	143112 KiB
01_handmade_03.txt	WA	182 ms	150340 KiB
01_handmade_04.txt	AC	115 ms	148528 KiB
01_handmade_05.txt	AC	185 ms	150724 KiB
02_small_01.txt	AC	68 ms	76524 KiB
02_small_02.txt	WA	69 ms	76964 KiB
02_small_03.txt	WA	69 ms	77096 KiB
02_small_04.txt	WA	68 ms	76948 KiB
02_small_05.txt	AC	68 ms	76780 KiB
03_medium_01.txt	AC	70 ms	76872 KiB
03_medium_02.txt	AC	69 ms	76668 KiB
03_medium_03.txt	WA	69 ms	76840 KiB
03_medium_04.txt	AC	68 ms	76664 KiB
03_medium_05.txt	WA	69 ms	76832 KiB
04_large_01.txt	AC	125 ms	87020 KiB
04_large_02.txt	WA	169 ms	131676 KiB
04_large_03.txt	AC	178 ms	152840 KiB
04_large_04.txt	WA	95 ms	101472 KiB
04_large_05.txt	WA	127 ms	144804 KiB
05_max_01.txt	WA	240 ms	148076 KiB
05_max_02.txt	WA	198 ms	147708 KiB
05_max_03.txt	AC	197 ms	148084 KiB
05_max_04.txt	WA	138 ms	152616 KiB
05_max_05.txt	AC	134 ms	152668 KiB
06_not_emerge_01.txt	AC	132 ms	148068 KiB
06_not_emerge_02.txt	AC	133 ms	147656 KiB
06_not_emerge_03.txt	AC	118 ms	130800 KiB
07_emerge_once_01.txt	AC	130 ms	143860 KiB
07_emerge_once_02.txt	AC	139 ms	153060 KiB
07_emerge_once_03.txt	AC	132 ms	142372 KiB
07_emerge_once_04.txt	AC	138 ms	152736 KiB
07_emerge_once_05.txt	AC	132 ms	122060 KiB
08_emerge_twice_01.txt	WA	116 ms	124864 KiB
08_emerge_twice_02.txt	WA	136 ms	149320 KiB
08_emerge_twice_03.txt	WA	131 ms	142960 KiB
08_emerge_twice_04.txt	WA	132 ms	143012 KiB
08_emerge_twice_05.txt	WA	133 ms	143320 KiB
09_one_two_only_01.txt	AC	156 ms	135396 KiB
09_one_two_only_02.txt	WA	156 ms	135052 KiB
09_one_two_only_03.txt	WA	214 ms	132360 KiB
09_one_two_only_04.txt	WA	191 ms	131036 KiB
09_one_two_only_05.txt	AC	229 ms	140616 KiB
09_one_two_only_06.txt	AC	181 ms	123568 KiB
09_one_two_only_07.txt	AC	219 ms	136624 KiB