(cache)Submission #75590885 - AtCoder Beginner Contest 446

Contest Duration: 2026-02-21(Sat) 21:00 - 2026-02-21(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #75590885

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
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
int N, D;
int A[212345];
int B[212345];
int main(void) {
  int T, tc;
  if (scanf("%d", &T) != 1) return 1;
  for (tc = 0; tc < T; tc++) {
    int i;
    int ans = 0, start = 0;
    if (scanf("%d%d", &N, &D) != 2) return 1;
    for (i = 0; i < N; i++) {
      if (scanf("%d", &A[i]) != 1) return 1;
    }
    for (i = 0; i < N; i++) {
      if (scanf("%d", &B[i]) != 1) return 1;
    }
    for (i = 0; i < N; i++) {
      int use = B[i];
      /* 仕入れる */
      ans += A[i];
      /* 使用する */
      while (use > 0) {
        if (A[start] > use) {
          A[start] -= use;
          ans -= use;
          use = 0;
        } else {
          use -= A[start];
          ans -= A[start];
          start++;
        }
      }
      /* 処分する */
      while (start < i - D + 1) {
        ans -= A[start];
        start++;
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

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

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		int i;
		int ans = 0, start = 0;
		if (scanf("%d%d", &N, &D) != 2) return 1;
		for (i = 0; i < N; i++) {
			if (scanf("%d", &A[i]) != 1) return 1;
		}
		for (i = 0; i < N; i++) {
			if (scanf("%d", &B[i]) != 1) return 1;
		}
		for (i = 0; i < N; i++) {
			int use = B[i];
			/* 仕入れる */
			ans += A[i];
			/* 使用する */
			while (use > 0) {
				if (A[start] > use) {
					A[start] -= use;
					ans -= use;
					use = 0;
				} else {
					use -= A[start];
					ans -= A[start];
					start++;
				}
			}
			/* 処分する */
			while (start < i - D + 1) {
				ans -= A[start];
				start++;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}

Submission Info

Submission Time	2026-05-08 19:32:14
Task	C - Omelette Restaurant
User	mikecat
Language	C23 (GCC 14.2.0)
Score	300
Code Size	853 Byte
Status	AC
Exec Time	36 ms
Memory	3380 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 1

× 30

Set Name	Test Cases
Sample	example_00.txt
All	example_00.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, hand_08.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt

Case Name	Status	Exec Time	Memory
example_00.txt	AC	1 ms	1560 KiB
hand_00.txt	AC	16 ms	3320 KiB
hand_01.txt	AC	16 ms	3316 KiB
hand_02.txt	AC	16 ms	3380 KiB
hand_03.txt	AC	17 ms	3252 KiB
hand_04.txt	AC	17 ms	3380 KiB
hand_05.txt	AC	36 ms	1656 KiB
hand_06.txt	AC	16 ms	3320 KiB
hand_07.txt	AC	25 ms	2420 KiB
hand_08.txt	AC	0 ms	1612 KiB
random_00.txt	AC	22 ms	1624 KiB
random_01.txt	AC	21 ms	1624 KiB
random_02.txt	AC	20 ms	1612 KiB
random_03.txt	AC	20 ms	1656 KiB
random_04.txt	AC	22 ms	1656 KiB
random_05.txt	AC	16 ms	1760 KiB
random_06.txt	AC	16 ms	1760 KiB
random_07.txt	AC	15 ms	1780 KiB
random_08.txt	AC	16 ms	1784 KiB
random_09.txt	AC	16 ms	1784 KiB
random_10.txt	AC	17 ms	3320 KiB
random_11.txt	AC	18 ms	3252 KiB
random_12.txt	AC	16 ms	3160 KiB
random_13.txt	AC	17 ms	3188 KiB
random_14.txt	AC	17 ms	3192 KiB
random_15.txt	AC	18 ms	3192 KiB
random_16.txt	AC	18 ms	3288 KiB
random_17.txt	AC	18 ms	3380 KiB
random_18.txt	AC	17 ms	3288 KiB
random_19.txt	AC	17 ms	3232 KiB