(cache)Submission #67012864 - AtCoder Beginner Contest 409

Contest Duration: 2025-06-07(Sat) 21:00 - 2025-06-07(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #67012864

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>
#include <inttypes.h>
int N, L;
int d[312345];
int cnt[312345];
int main(void) {
  int i;
  uint64_t ans = 0;
  int pos = 0;
  if (scanf("%d%d", &N, &L) != 2) return 1;
  cnt[pos]++;
  for (i = 1; i < N; i++) {
    if (scanf("%d", &d[i]) != 1) return 1;
    pos = (pos + d[i]) % L;
    cnt[pos]++;
  }
  if (L % 3 != 0) {
    puts("0");
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N, L;
int d[312345];

int cnt[312345];

int main(void) {
	int i;
	uint64_t ans = 0;
	int pos = 0;
	if (scanf("%d%d", &N, &L) != 2) return 1;
	cnt[pos]++;
	for (i = 1; i < N; i++) {
		if (scanf("%d", &d[i]) != 1) return 1;
		pos = (pos + d[i]) % L;
		cnt[pos]++;
	}
	if (L % 3 != 0) {
		puts("0");
		return 0;
	}
	for (i = 0; i < L / 3; i++) {
		ans += (uint64_t)cnt[i] * cnt[i + L / 3] * cnt[i + L / 3 * 2];
	}
	printf("%" PRIu64 "\n", ans);
	return 0;
}

Submission Info

Submission Time	2025-06-23 06:49:36
Task	C - Equilateral Triangle
User	mikecat
Language	C (gcc 12.2.0)
Score	300
Code Size	530 Byte
Status	AC
Exec Time	32 ms
Memory	3956 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 3

× 37

Set Name	Test Cases
Sample	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	1 ms	1628 KiB
00_sample_01.txt	AC	1 ms	1556 KiB
00_sample_02.txt	AC	1 ms	1632 KiB
01_test_00.txt	AC	1 ms	1632 KiB
01_test_01.txt	AC	1 ms	1620 KiB
01_test_02.txt	AC	7 ms	2180 KiB
01_test_03.txt	AC	19 ms	2760 KiB
01_test_04.txt	AC	1 ms	1780 KiB
01_test_05.txt	AC	1 ms	1812 KiB
01_test_06.txt	AC	18 ms	2672 KiB
01_test_07.txt	AC	22 ms	2888 KiB
01_test_08.txt	AC	1 ms	1792 KiB
01_test_09.txt	AC	2 ms	2184 KiB
01_test_10.txt	AC	21 ms	3192 KiB
01_test_11.txt	AC	29 ms	3544 KiB
01_test_12.txt	AC	1 ms	1880 KiB
01_test_13.txt	AC	2 ms	2776 KiB
01_test_14.txt	AC	15 ms	3284 KiB
01_test_15.txt	AC	32 ms	3956 KiB
01_test_16.txt	AC	1 ms	1732 KiB
01_test_17.txt	AC	1 ms	2072 KiB
01_test_18.txt	AC	14 ms	2708 KiB
01_test_19.txt	AC	30 ms	3832 KiB
01_test_20.txt	AC	32 ms	3896 KiB
01_test_21.txt	AC	31 ms	3832 KiB
01_test_22.txt	AC	31 ms	3880 KiB
01_test_23.txt	AC	30 ms	3920 KiB
01_test_24.txt	AC	32 ms	3792 KiB
01_test_25.txt	AC	31 ms	3948 KiB
01_test_26.txt	AC	31 ms	3920 KiB
01_test_27.txt	AC	31 ms	3816 KiB
01_test_28.txt	AC	31 ms	3804 KiB
01_test_29.txt	AC	30 ms	3908 KiB
01_test_30.txt	AC	16 ms	2764 KiB
01_test_31.txt	AC	14 ms	2868 KiB
01_test_32.txt	AC	14 ms	2788 KiB
01_test_33.txt	AC	1 ms	1604 KiB