(cache)Submission #74926286 - AtCoder Beginner Contest 440

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

Submission #74926286

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>
#include <string.h>
#include <inttypes.h>
int N, W;
int C[212345];
int64_t sum[212345 * 2 * 2];
int main(void) {
  int T, tc;
  if (scanf("%d", &T) != 1) return 1;
  for (tc = 0; tc < T; tc++) {
    int i;
    int64_t ans;
    if (scanf("%d%d", &N, &W) != 2) return 1;
    for (i = 0; i < N; i++) {
      if (scanf("%d", &C[i]) != 1) return 1;
    }
    memset(sum, 0, sizeof(*sum) * (2 * W));
    for (i = 0; i < N; i++) {
      sum[i % (2 * W)] += C[i];
    }
    memcpy(sum + 2 * W, sum, sizeof(*sum) * (2 * W));
    for (i = 1; i < 2 * (2 * W); i++) sum[i] += sum[i - 1];
    ans = sum[W - 1];
    for (i = 0; i < 2 * W; i++) {
      int64_t candidate = sum[i + W] - sum[i];
      if (candidate < ans) ans = candidate;
    }
    printf("%" PRId64 "\n", ans);
  }
  return 0;
}
/*
2W で割った余りで分類、どの区間を黒く塗るかを全探索
*/
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <string.h>
#include <inttypes.h>

int N, W;
int C[212345];

int64_t sum[212345 * 2 * 2];

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		int i;
		int64_t ans;
		if (scanf("%d%d", &N, &W) != 2) return 1;
		for (i = 0; i < N; i++) {
			if (scanf("%d", &C[i]) != 1) return 1;
		}
		memset(sum, 0, sizeof(*sum) * (2 * W));
		for (i = 0; i < N; i++) {
			sum[i % (2 * W)] += C[i];
		}
		memcpy(sum + 2 * W, sum, sizeof(*sum) * (2 * W));
		for (i = 1; i < 2 * (2 * W); i++) sum[i] += sum[i - 1];
		ans = sum[W - 1];
		for (i = 0; i < 2 * W; i++) {
			int64_t candidate = sum[i + W] - sum[i];
			if (candidate < ans) ans = candidate;
		}
		printf("%" PRId64 "\n", ans);
	}
	return 0;
}

/*

2W で割った余りで分類、どの区間を黒く塗るかを全探索

*/

Submission Info

Submission Time	2026-04-13 07:57:32
Task	C - Striped Horse
User	mikecat
Language	C23 (GCC 14.2.0)
Score	300
Code Size	883 Byte
Status	AC
Exec Time	15 ms
Memory	8724 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 1

× 27

Set Name	Test Cases
Sample	sample_01.txt
All	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, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, sample_01.txt

Case Name	Status	Exec Time	Memory
random_01.txt	AC	9 ms	1772 KiB
random_02.txt	AC	9 ms	1652 KiB
random_03.txt	AC	10 ms	1688 KiB
random_04.txt	AC	10 ms	1684 KiB
random_05.txt	AC	12 ms	1760 KiB
random_06.txt	AC	12 ms	3608 KiB
random_07.txt	AC	12 ms	1772 KiB
random_08.txt	AC	13 ms	3860 KiB
random_09.txt	AC	12 ms	1740 KiB
random_10.txt	AC	12 ms	3112 KiB
random_11.txt	AC	12 ms	1632 KiB
random_12.txt	AC	14 ms	5416 KiB
random_13.txt	AC	12 ms	1740 KiB
random_14.txt	AC	12 ms	3680 KiB
random_15.txt	AC	12 ms	1712 KiB
random_16.txt	AC	12 ms	3444 KiB
random_17.txt	AC	11 ms	1704 KiB
random_18.txt	AC	12 ms	2456 KiB
random_19.txt	AC	11 ms	1628 KiB
random_20.txt	AC	11 ms	1968 KiB
random_21.txt	AC	1 ms	1740 KiB
random_22.txt	AC	3 ms	6420 KiB
random_23.txt	AC	15 ms	8724 KiB
random_24.txt	AC	13 ms	5552 KiB
random_25.txt	AC	12 ms	3044 KiB
random_26.txt	AC	13 ms	5740 KiB
sample_01.txt	AC	0 ms	1704 KiB