Submission #69915369

Source Code Expand

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, Q;
int A[212345];
int query[212345][3];
int64_t sum[212345];
int main(void) {
  int i;
  int start = 0;
  if (scanf("%d%d", &N, &Q) != 2) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
    sum[i] = (i > 0 ? sum[i - 1] : 0) + A[i];
  }
  for (i = 0; i < Q; i++) {
    if (scanf("%d%d", &query[i][0], &query[i][1]) != 2) return 1;
    if (query[i][0] == 2 && scanf("%d", &query[i][2]) != 1) return 1;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N, Q;
int A[212345];
int query[212345][3];

int64_t sum[212345];

int main(void) {
	int i;
	int start = 0;
	if (scanf("%d%d", &N, &Q) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		sum[i] = (i > 0 ? sum[i - 1] : 0) + A[i];
	}
	for (i = 0; i < Q; i++) {
		if (scanf("%d%d", &query[i][0], &query[i][1]) != 2) return 1;
		if (query[i][0] == 2 && scanf("%d", &query[i][2]) != 1) return 1;
	}
	for (i = 0; i < Q; i++) {
		if (query[i][0] == 1) {
			start = (start + query[i][1]) % N;
		} else if (query[i][0] == 2) {
			int l = (query[i][1] - 1 + start) % N;
			int r = (query[i][2] - 1 + start) % N;
			if (l <= r) {
				printf("%" PRId64 "\n", sum[r] - (l > 0 ? sum[l - 1] : 0));
			} else {
				printf("%" PRId64 "\n", sum[r] + sum[N - 1] - sum[l - 1]);
			}
		}
	}
	return 0;
}

Submission Info

Judge Result