oj.uz

Submission #972465

# Submission time Handle Problem Language Result Execution time Memory
972465 2024-04-30T13:09:36 Z 12345678 Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;

int n, a[nx], b[nx], lst;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=0; i<n; i++) cin>>a[i]>>b[i];
    while (1)
    {
        for (int i=0; i<n; i++)
        {
            lst++;
            if (a[i]>b[i]+1) a[(i+1)%n]+=(a[i]-b[i])/2, a[i]-=((a[i]-b[i])/2)*2, lst=0;
            if (lst==n)
            {
                for (int j=0; j<n; j++) if (a[i]!=b[i]) return cout<<"No", 0;
                return cout<<"Yes", 0;
            }
        }
    }
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -