Submission #749082

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
749082	2023-05-27T09:52:03 Z	ljuba	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	324 KB

remittance

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    vector<pair<int, int>> v(n);
    for(auto &z : v) cin >> z.first >> z.second;

    while(1) {
        bool promenio = false;
        for(int i = 0; i < n; ++i) {
            if(v[i].first >= 1 && v[i].first > v[i].second) {
                int uzmi = max(1, (v[i].first - v[i].second) / 2);
                v[i].first -= 2 * uzmi;
                v[(i + 1) % n].first += uzmi;

                promenio = true;
            }
        }

        if(!promenio) break;
    }

    for(int i = 0; i < n; ++i) {
        if(v[i].first != v[i].second) {
            cout << "No" << '\n';
            return 0;
        }
    }

    cout << "Yes" << '\n';
}

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	232 KB	Output is correct
19	Correct	0 ms	320 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	232 KB	Output is correct
19	Correct	0 ms	320 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	316 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	232 KB	Output is correct
19	Correct	0 ms	320 KB	Output is correct
20	Incorrect	1 ms	212 KB	Output isn't correct
21	Halted	0 ms	0 KB	-