답안 #776060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
776060	2023-07-07T09:05:30 Z	mdub	송금 (JOI19_remittance)	C++14	0 / 100	1 ms	308 KB

remittance

#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
LL power(int n) {  
  if (n == 0) return 1;
  else return 2*(power(n-1));
}

int main () {
  LL n; cin >>n;
  vector<LL> a(n);
  vector<LL> b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  LL need = 0;
  bool ok = true;
  for (int i= 0; i < n - 1; i++) {
    if ((a[i] > b[i])) {
	
	if ((a[i] - b[i]) % 2) {
	  a[i + 1] += (a[i] - b[i] + 1) / 2;
	  if (i + 1 > 50) {
	    ok = false;
	  }
	  need += power(i + 1);
	}
	else {
	  a[i + 1] += (a[i] - b[i]) / 2;
	}
      }
      else if (a[i] < b[i]) {
	if (i + 1 > 50) {
	  ok = false;
	}
	LL p = power(i + 1);
	if (to_string(p).size() + to_string((b[i] - a[i])).size() >= 17) {
	  ok = false;
	}
	need += p*(b[i] - a[i]);
	if (need > LL(1e16)) {
	  ok = false;
	}
      }
    
  }
  if (a[n-1] - b[n-1] != need) {
    ok = false;
  }
  if (ok) {
    cout << "Yes\n";
  }
  else cout << "No\n";
    
      
      
}

Subtask #1

0 / 15.0

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

Subtask #2

0 / 40.0

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

Subtask #3

0 / 45.0

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