답안 #284161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284161	2020-08-27T00:18:56 Z	jainbot27	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	384 KB

remittance

#include <bits/stdc++.h>
using namespace std;

int main(){
    int n; cin >> n; vector<int64_t> a(n), b(n);
    bool B=1;
    for(int i=0; i < n; i++) cin >> a[i] >> b[i], B&=b[i]==0;
    if(B) {
        for(int i=0; i < n; i++){
            if(a[i] != 0) B=0;
        }
        cout << (B?"YES":"NO")<< "\n"; return 0;
    }
    //for(auto&A:a) cin >> A; for(auto&B:b) cin >> B;
    int g = 1;
    while(g){
        g=0;
        for(int i=0; i < n; i++){
            //cerr << a[i] << "\n";
            if(a[i] > b[i]){
                a[(i+1)%n] += (a[i] - b[i] + 1)/2;
                a[i] -= (a[i]-b[i]+1)/2*2;
                g=1;
            }
        }
    }
    g=1;
    //cerr << "DONE\n";
    for(int i=0; i < n; i++){
        cerr << a[i] << "\n";
        g &= a[i] == b[i];
    }
    cout << (g?"Yes":"No") << "\n";
}

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 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	1 ms	256 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Incorrect	1 ms	256 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 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	1 ms	256 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Incorrect	1 ms	256 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 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	1 ms	256 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Incorrect	1 ms	256 KB	Output isn't correct
21	Halted	0 ms	0 KB	-