(cache)Submission #69561867 - AtCoder Beginner Contest 423

Contest Duration: 2025-09-14(Sun) 21:00 - 2025-09-14(Sun) 22:40 (local time) (100 minutes) Back to Home

Submission #69561867

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, R;
int L[212345];
int main(void) {
  int i;
  int left_last_open, right_last_open;
  int ans = 0;
  if (scanf("%d%d", &N, &R) != 2) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d", &L[i]) != 1) return 1;
  }
  left_last_open = -1, right_last_open = -1;
  for (i = R; i >= 1; i--) {
    if (L[i] == 0) left_last_open = i;
  }
  for (i = R + 1; i <= N; i++) {
    if (L[i] == 0) right_last_open = i;
  }
  if (left_last_open > 0) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, R;
int L[212345];

int main(void) {
	int i;
	int left_last_open, right_last_open;
	int ans = 0;
	if (scanf("%d%d", &N, &R) != 2) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &L[i]) != 1) return 1;
	}
	left_last_open = -1, right_last_open = -1;
	for (i = R; i >= 1; i--) {
		if (L[i] == 0) left_last_open = i;
	}
	for (i = R + 1; i <= N; i++) {
		if (L[i] == 0) right_last_open = i;
	}
	if (left_last_open > 0) {
		for (i = left_last_open; i <= R; i++) {
			if (L[i] != 0) ans++; /* 開ける */
			ans++; /* 閉じる */
		}
	}
	if (right_last_open > 0) {
		for (i = R + 1; i <= right_last_open; i++) {
			if (L[i] != 0) ans++; /* 開ける */
			ans++; /* 閉じる */
		}
	}
	printf("%d\n", ans);
	return 0;
}

/*

1. 連続で閉まっているところの手前までを開ける
2. それらを閉める

スタート位置に戻らなくてもいい
→ でも、結局開いているところまで行く必要はある
→ この性質を有効活用はできなそう

*/

Submission Info

Submission Time	2025-09-23 07:38:06
Task	C - Lock All Doors
User	mikecat
Language	C (gcc 12.2.0)
Score	300
Code Size	1065 Byte
Status	AC
Exec Time	11 ms
Memory	2540 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 3

× 33

Set Name	Test Cases
Sample	sample00.txt, sample01.txt, sample02.txt
All	sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt

Case Name	Status	Exec Time	Memory
sample00.txt	AC	0 ms	1628 KiB
sample01.txt	AC	0 ms	1664 KiB
sample02.txt	AC	0 ms	1604 KiB
testcase00.txt	AC	7 ms	2272 KiB
testcase01.txt	AC	9 ms	2488 KiB
testcase02.txt	AC	8 ms	2292 KiB
testcase03.txt	AC	9 ms	2512 KiB
testcase04.txt	AC	2 ms	1752 KiB
testcase05.txt	AC	9 ms	2372 KiB
testcase06.txt	AC	7 ms	2292 KiB
testcase07.txt	AC	9 ms	2432 KiB
testcase08.txt	AC	4 ms	2016 KiB
testcase09.txt	AC	11 ms	2392 KiB
testcase10.txt	AC	8 ms	2196 KiB
testcase11.txt	AC	11 ms	2540 KiB
testcase12.txt	AC	1 ms	1696 KiB
testcase13.txt	AC	10 ms	2520 KiB
testcase14.txt	AC	9 ms	2304 KiB
testcase15.txt	AC	10 ms	2512 KiB
testcase16.txt	AC	9 ms	2424 KiB
testcase17.txt	AC	10 ms	2532 KiB
testcase18.txt	AC	0 ms	1764 KiB
testcase19.txt	AC	10 ms	2524 KiB
testcase20.txt	AC	6 ms	2112 KiB
testcase21.txt	AC	10 ms	2372 KiB
testcase22.txt	AC	9 ms	2280 KiB
testcase23.txt	AC	9 ms	2504 KiB
testcase24.txt	AC	8 ms	2288 KiB
testcase25.txt	AC	11 ms	2508 KiB
testcase26.txt	AC	9 ms	2332 KiB
testcase27.txt	AC	10 ms	2440 KiB
testcase28.txt	AC	9 ms	2368 KiB
testcase29.txt	AC	10 ms	2496 KiB