(cache)Submission #75979069 - AtCoder Beginner Contest 449

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

Submission #75979069

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
#include <stdio.h>
#include <inttypes.h>
#define MAX 512345
int N, L, R;
char S[MAX];
int cnt[26][MAX * 2];
int main(void) {
  int i, j;
  int64_t ans = 0;
  if (scanf("%d%d%d", &N, &L, &R) != 3) return 1;
  if (scanf("%512344s", S) != 1) return 1;
  for (i = 0; i < N; i++) {
    int id = S[i] - 'a';
    for (j = 0; j < 26; j++) cnt[j][MAX + i] = cnt[j][MAX + i - 1];
    if (0 <= id && id < 26) cnt[id][MAX + i]++;
  }
  for (i = 0; i < N; i++) {
    int id = S[i] - 'a';
    if (0 <= id && id < 26) {
      ans += cnt[id][MAX + i - L] - cnt[id][MAX + i - R - 1];
    }
  }
  printf("%" PRId64 "\n", ans);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

#define MAX 512345

int N, L, R;
char S[MAX];

int cnt[26][MAX * 2];

int main(void) {
	int i, j;
	int64_t ans = 0;
	if (scanf("%d%d%d", &N, &L, &R) != 3) return 1;
	if (scanf("%512344s", S) != 1) return 1;
	for (i = 0; i < N; i++) {
		int id = S[i] - 'a';
		for (j = 0; j < 26; j++) cnt[j][MAX + i] = cnt[j][MAX + i - 1];
		if (0 <= id && id < 26) cnt[id][MAX + i]++;
	}
	for (i = 0; i < N; i++) {
		int id = S[i] - 'a';
		if (0 <= id && id < 26) {
			ans += cnt[id][MAX + i - L] - cnt[id][MAX + i - R - 1];
		}
	}
	printf("%" PRId64 "\n", ans);
	return 0;
}

Submission Info

Submission Time	2026-05-21 09:25:43
Task	C - Comfortable Distance
User	mikecat
Language	C23 (GCC 14.2.0)
Score	300
Code Size	631 Byte
Status	AC
Exec Time	33 ms
Memory	53104 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 3

× 23

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

Case Name	Status	Exec Time	Memory
sample00.txt	AC	1 ms	1684 KiB
sample01.txt	AC	1 ms	1720 KiB
sample02.txt	AC	0 ms	1724 KiB
testcase00.txt	AC	1 ms	1636 KiB
testcase01.txt	AC	1 ms	1692 KiB
testcase02.txt	AC	5 ms	9104 KiB
testcase03.txt	AC	30 ms	49464 KiB
testcase04.txt	AC	12 ms	20556 KiB
testcase05.txt	AC	17 ms	30704 KiB
testcase06.txt	AC	7 ms	14860 KiB
testcase07.txt	AC	33 ms	53008 KiB
testcase08.txt	AC	30 ms	53084 KiB
testcase09.txt	AC	29 ms	52964 KiB
testcase10.txt	AC	27 ms	53020 KiB
testcase11.txt	AC	28 ms	53052 KiB
testcase12.txt	AC	22 ms	53012 KiB
testcase13.txt	AC	23 ms	53104 KiB
testcase14.txt	AC	23 ms	53020 KiB
testcase15.txt	AC	22 ms	53008 KiB
testcase16.txt	AC	23 ms	53020 KiB
testcase17.txt	AC	25 ms	53048 KiB
testcase18.txt	AC	25 ms	53020 KiB
testcase19.txt	AC	25 ms	52968 KiB