Submission #66258328

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 N;
int C[2048];
int A[2048];
int main(void) {
  int i;
  int ans = 0;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 1; i < N; i++) {
    if (scanf("%d", &C[i]) != 1) return 1;
  }
  for (i = 1; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
  /* 最初の 1 まで進む */
  for (i = N - 1; i > 0 && A[i] == 0; i--);
  /* 番兵 */
  A[0] = 1;
  /* 豆を移動させていく */
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
int C[2048];
int A[2048];

int main(void) {
	int i;
	int ans = 0;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i < N; i++) {
		if (scanf("%d", &C[i]) != 1) return 1;
	}
	for (i = 1; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	/* 最初の 1 まで進む */
	for (i = N - 1; i > 0 && A[i] == 0; i--);
	/* 番兵 */
	A[0] = 1;
	/* 豆を移動させていく */
	for (; i > 0; ) {
		int next_max = i - C[i];
		int next_next_max = i;
		for (;;) {
			int j;
			int one_found = -1;
			for (j = i - 1; j >= next_max; j--) {
				int candidate = j - C[j];
				if (candidate < next_next_max) next_next_max = candidate;
				if (A[j] > 0 && one_found < 0) one_found = j;
			}
			ans++;
			if (one_found >= 0) {
				i = one_found;
				break;
			} else {
				i = next_max;
				next_max = next_next_max;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

/*

豆があるところからはどうせ動かさないといけない
より手前 (番号が大きい茶碗) には、奥に行く以下の手数で行ける (多分)

→ 手前の豆を、奥の豆のところまで移動させていく

*/

Submission Info

Judge Result