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

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
#include <stdio.h>
int N, M;
int A[212345];
int B[212345];
int maekara[212345], usirokara[212345];
int main(void) {
  int i, pos;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
  for (i = 0; i < M; i++) {
    if (scanf("%d", &B[i]) != 1) return 1;
  }
  for (i = 0, pos = 0; i < N; i++) {
    if (pos < M && A[i] == B[pos]) {
      maekara[pos] = i;
      pos++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, M;
int A[212345];
int B[212345];

int maekara[212345], usirokara[212345];

int main(void) {
	int i, pos;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	for (i = 0; i < M; i++) {
		if (scanf("%d", &B[i]) != 1) return 1;
	}
	for (i = 0, pos = 0; i < N; i++) {
		if (pos < M && A[i] == B[pos]) {
			maekara[pos] = i;
			pos++;
		}
	}
	if (pos < M) {
		puts("No");
		return 0;
	}
	for (i = N - 1, pos = M - 1; i >= 0; i--) {
		if (pos >= 0 && A[i] == B[pos]) {
			usirokara[pos] = i;
			pos--;
		}
	}
	if (pos >= 0) {
		puts("No");
		return 0;
	}
	for (i = 0; i < M; i++) {
		if (maekara[i] != usirokara[i]) {
			puts("Yes");
			return 0;
		}
	}
	puts("No");
	return 0;
}

Submission Info

Submission Time	2025-12-20 20:30:35
Task	A - Twice Subsequence
User	mikecat
Language	C23 (GCC 14.2.0)
Score	400
Code Size	809 Byte
Status	AC
Exec Time	24 ms
Memory	4896 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

400 / 400

Status

× 3

× 48

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	1 ms	1616 KiB
00_sample_02.txt	AC	0 ms	1652 KiB
00_sample_03.txt	AC	0 ms	1680 KiB
01_handmade_01.txt	AC	0 ms	1624 KiB
01_handmade_02.txt	AC	24 ms	4844 KiB
01_handmade_03.txt	AC	16 ms	4824 KiB
01_handmade_04.txt	AC	16 ms	3272 KiB
01_handmade_05.txt	AC	16 ms	4128 KiB
02_small_01.txt	AC	1 ms	1608 KiB
02_small_02.txt	AC	1 ms	1604 KiB
02_small_03.txt	AC	0 ms	1656 KiB
02_small_04.txt	AC	0 ms	1616 KiB
02_small_05.txt	AC	0 ms	1688 KiB
03_medium_01.txt	AC	1 ms	1608 KiB
03_medium_02.txt	AC	0 ms	1836 KiB
03_medium_03.txt	AC	0 ms	1608 KiB
03_medium_04.txt	AC	0 ms	1648 KiB
03_medium_05.txt	AC	0 ms	1644 KiB
04_large_01.txt	AC	3 ms	1972 KiB
04_large_02.txt	AC	17 ms	3952 KiB
04_large_03.txt	AC	22 ms	4720 KiB
04_large_04.txt	AC	9 ms	2848 KiB
04_large_05.txt	AC	17 ms	3600 KiB
05_max_01.txt	AC	23 ms	4844 KiB
05_max_02.txt	AC	24 ms	4844 KiB
05_max_03.txt	AC	23 ms	4772 KiB
05_max_04.txt	AC	23 ms	4896 KiB
05_max_05.txt	AC	23 ms	4688 KiB
06_not_emerge_01.txt	AC	13 ms	2520 KiB
06_not_emerge_02.txt	AC	12 ms	2536 KiB
06_not_emerge_03.txt	AC	12 ms	2512 KiB
07_emerge_once_01.txt	AC	17 ms	3244 KiB
07_emerge_once_02.txt	AC	23 ms	4808 KiB
07_emerge_once_03.txt	AC	21 ms	3912 KiB
07_emerge_once_04.txt	AC	23 ms	4752 KiB
07_emerge_once_05.txt	AC	12 ms	2604 KiB
08_emerge_twice_01.txt	AC	16 ms	3116 KiB
08_emerge_twice_02.txt	AC	22 ms	4388 KiB
08_emerge_twice_03.txt	AC	21 ms	3984 KiB
08_emerge_twice_04.txt	AC	20 ms	3832 KiB
08_emerge_twice_05.txt	AC	21 ms	4004 KiB
09_one_two_only_01.txt	AC	14 ms	3696 KiB
09_one_two_only_02.txt	AC	13 ms	3696 KiB
09_one_two_only_03.txt	AC	13 ms	3608 KiB
09_one_two_only_04.txt	AC	13 ms	3432 KiB
09_one_two_only_05.txt	AC	14 ms	3440 KiB
09_one_two_only_06.txt	AC	10 ms	2840 KiB
09_one_two_only_07.txt	AC	13 ms	3360 KiB