답안 #337320

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337320	2020-12-19T17:22:20 Z	spatarel	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	364 KB

remittance

#include <stdio.h>

int main() {
  int n;
  scanf("%d", &n);
  int a[n];
  int b[n];
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &a[i], &b[i]);
  }
  int counter = 0;
  for (int i = 0; counter < n; i = (i + 1) % n) {
    int remittance = (a[i] - b[i]) / 2;
    if (remittance > 0) {
      a[i] -= 2 * remittance;
      a[(i + 1) % n] += remittance;
      counter = 0;
    } else {
      counter++;
    }
  }
  bool ok1 = true;
  bool ok2 = true;
  for (int i = 0; i < n; i++) {
    ok1 &= (a[i] == b[i]);
    ok2 &= (a[i] - 1 == b[i]);
  }
  if (ok1 || ok2) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:5:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    5 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
remittance.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf("%d%d", &a[i], &b[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Incorrect	0 ms	364 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Incorrect	0 ms	364 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	0 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Incorrect	0 ms	364 KB	Output isn't correct
21	Halted	0 ms	0 KB	-