Submission #70857206

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>
int X;
int N;
int W[114514];
int Q;
int P[114514];
signed char tuiteru[114514];
int main(void) {
  int i;
  int ans;
  if (scanf("%d", &X) != 1) return 1;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d", &W[i]) != 1) return 1;
  }
  if (scanf("%d", &Q) != 1) return 1;
  for (i = 0; i < Q; i++) {
    if (scanf("%d", &P[i]) != 1) return 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int X;
int N;
int W[114514];
int Q;
int P[114514];

signed char tuiteru[114514];

int main(void) {
	int i;
	int ans;
	if (scanf("%d", &X) != 1) return 1;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &W[i]) != 1) return 1;
	}
	if (scanf("%d", &Q) != 1) return 1;
	for (i = 0; i < Q; i++) {
		if (scanf("%d", &P[i]) != 1) return 1;
	}

	ans = X;
	for (i = 0; i < Q; i++) {
		ans += W[P[i]] * (1 - tuiteru[P[i]] * 2);
		tuiteru[P[i]] = !tuiteru[P[i]];
		printf("%d\n", ans);
	}
	return 0;
}

Submission Info

Judge Result