oj.uz

Submission #513875

# Submission time Handle Problem Language Result Execution time Memory
513875 2022-01-17T20:26:48 Z Vladth11 Remittance (JOI19_remittance) C++14
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;

const ll NMAX = 10000001;
const ll VMAX = 21;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 318;
const ll base = 31;
const ll nr_of_bits = 60;

ll a[NMAX];
ll b[NMAX];
ll n;

ll nxt(ll i){
    i++;
    if(i > n)
        i = 1;
    return i;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll i;
    cin >> n;
    ll needed = 0;
    for(i = 1; i <= n; i++){
        cin >> a[i] >> b[i];
    }
    for(ll tt = 1; tt <= nr_of_bits; tt++){
        for(i = 1; i <= n; i++){
            if(a[i] > b[i] && (a[i] - b[i]) / 2 != 0){
                break;
            }
        }
        if(i == n + 1)
            break;
        ll total = (a[i] - b[i]) / 2;
        a[i] -= total * 2;
        a[nxt(i)] += total;
        for(ll j = nxt(i); j != i; j = nxt(j)){
            if(a[j] <= b[j])
                break;
            total = (a[j] - b[j]) / 2;
            a[j] -= total * 2;
            a[nxt(j)] += total;
        }
    }
    ll ok = 1;
    for(ll i = 1; i <= n; i++){
        if(a[i] != b[i])
            ok = 0;
    }
    if(ok) cout << "Yes";
    else cout << "No\n";
    return 0;
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:35:8: warning: unused variable 'needed' [-Wunused-variable]
   35 |     ll needed = 0;
      |        ^~~~~~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 0 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -