Submission #402920

#	Time	Username	Problem	Language	Result	Execution time	Memory
402920		wildturtle	Remittance (JOI19_remittance)	C++14	0 / 100	1 ms	304 KiB

remittance

#include<bits/stdc++.h>
#define ll long long
#define f first
#define sc second
#define pb push_back
using namespace std;
ll a,b,c,d,i,e,f,g,n,m,k,l;
pair <ll,ll> A[500005];
int main() {
    cin>>n;
    for(ll i=1;i<=n;i++) {
        cin>>A[i].f>>A[i].sc;
    }
    for(ll i=1;i<=n;i++) {
        if(A[i].f<=A[i].sc) continue;
        a=A[i].f-A[i].sc;
        if(i==n) A[1].f+=a/2;
        else A[i+1].f+=a/2;
        A[i].f=A[i].sc+a%2;
    }
    for(ll i=1;i<=n;i++) {
        if(A[i].f<=A[i].sc) continue;
        a=A[i].f-A[i].sc;
        if(i==n) A[1].f+=a/2;
        else A[i+1].f+=a/2;
        A[i].f=A[i].sc+a%2;
    }
    for(ll i=1;i<=n;i++) {
        if(A[i].f<=A[i].sc) continue;
        a=A[i].f-A[i].sc;
        if(i==n) A[1].f+=a/2;
        else A[i+1].f+=a/2;
        A[i].f=A[i].sc+a%2;
    }
    a=0;
    for(ll i=1;i<=n;i++) {
        if(A[i].f!=A[i].sc) a=1;
    }
    if(a==1) cout<<"No";
    else cout<<"Yes";
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 45