Submission #74135621


Source Code Expand

Copy
#include <stdio.h>
#define MOD_BY 100000
int add(int a, int b) {
return a + b - MOD_BY * (a + b >= MOD_BY);
}
int sub(int a, int b) {
return b == 0 ? a : add(a, MOD_BY - b);
}
int n, m;
int s[114514];
int a[114514];
int sum[114514];
int main(void) {
int i;
int cur = 1;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <stdio.h>

#define MOD_BY 100000

int add(int a, int b) {
	return a + b - MOD_BY * (a + b >= MOD_BY);
}

int sub(int a, int b) {
	return b == 0 ? a : add(a, MOD_BY - b);
}

int n, m;
int s[114514];
int a[114514];

int sum[114514];

int main(void) {
	int i;
	int cur = 1;
	int ans = 0;
	if (scanf("%d%d", &n, &m) != 2) return 1;
	for (i = 1; i < n; i++) {
		if (scanf("%d", &s[i]) != 1) return 1;
		sum[i + 1] = add(sum[i], s[i] % MOD_BY);
	}
	for (i = 0; i < m; i++) {
		if (scanf("%d", &a[i]) != 1) return 1;
	}
	for (i = 0; i < m; i++) {
		int dest = cur + a[i];
		if (a[i] >= 0) {
			ans = add(ans, sub(sum[dest], sum[cur]));
		} else {
			ans = add(ans, sub(sum[cur], sum[dest]));
		}
		cur = dest;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task A - 旅人
User mikecat
Language C23 (GCC 14.2.0)
Score 20
Code Size 792 Byte
Status AC
Exec Time 9 ms
Memory 2956 KiB

Judge Result

Set Name set01 set02 set03 set04 set05 set06 set07 set08 set09 set10
Score / Max Score 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
set06 data6
set07 data7
set08 data8
set09 data9
set10 data10
Case Name Status Exec Time Memory
data1 AC 0 ms 1616 KiB
data10 AC 9 ms 2896 KiB
data2 AC 0 ms 1696 KiB
data3 AC 0 ms 1572 KiB
data4 AC 0 ms 1696 KiB
data5 AC 0 ms 1696 KiB
data6 AC 9 ms 2800 KiB
data7 AC 9 ms 2956 KiB
data8 AC 9 ms 2920 KiB
data9 AC 9 ms 2852 KiB


2026-03-15 (Sun)
07:33:56 +09:00