oj.uz

답안 #211614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211614 2020-03-20T20:19:43 Z m3r8 송금 (JOI19_remittance) C++14
0 / 100
 5 ms 384 KB 
#include <stdio.h>

#define N 1000100
#define ll long long

ll A[N];
ll B[N];
int cnt[N];

int main(void){
  int n;
  int nn = 1;
  scanf("%d",&n);
  for(int i = 0;i<n;i++){
    scanf("%lld %lld",&A[i],&B[i]);  
    if(B[i] != 0)nn = 0;
  };
  int pos = !nn;
  if(pos){
    for(int j = 0;j<2;j++){
      for(int i = 0;i<n;i++){
        if(A[i] > B[i]){
          ll tmp = A[i]-B[i];
          if(tmp % 2)tmp--;
          tmp /= 2;
          A[(i+1)%n] += tmp; 
          A[i] -= tmp * 2;
        };  
      };
    };
    for(int i = 0;i<n;i++){
      ll diff = A[i]-B[i];  
      pos = diff >= 0;
      if(!pos)break;
      for(int j = 0;j<32;j++){
        if(diff & (1ull << j)){
          cnt[(i+j)%n] ^= 1;
        };
      };
    };
  };
  if(pos){
    int st = cnt[0];
    for(int i = 0;i<n;i++){
      if(cnt[i] != st){
        pos = 0;  
        break;
      };
    };
  };
  if(pos)printf("Yes\n");
  else printf("No\n");
  return 0;
};

Compilation message

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

Subtask #1
0 / 15.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 45.0

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