oj.uz

Submission #609994

# Submission time Handle Problem Language Result Execution time Memory
609994 2022-07-28T04:08:30 Z czhang2718 Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 340 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
#define int ll

const int N=1e6+1, mod=1e9+7;
int n;
ll a[N], b[N], c[N];
ll t[N];
ll pw[N];

ll bpow(ll a, ll b){
    if(b==0) return 1;
    ll x=bpow(a,b/2);
    x=(x*x)%mod;
    if(b&1) x=(x*a)%mod;
    return x;
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    pw[0]=1;
    for(int i=0; i<n; i++){
        cin >> a[i] >> b[i];
        c[i]=b[i]-a[i];
        pw[i+1]=(pw[i]*2)%mod;
    }

    for(int i=n-1; i>=0; i--){
        t[0]+=pw[(i-1+n)%n]*(c[i]+mod)%mod;
        t[0]%=mod;
    }
    // cout << t[0] << "\n";
    t[0]=(mod-t[0])%mod;
    t[0]=(t[0]*(mod+bpow(mod+pw[n]-1, mod-2)))%mod;
    // cout << t[0] << "\n";

    for(int i=n-1; i>0; i--){
        t[i]=2*t[(i+1)%n]+c[(i+1)%n];
        if(t[i]!=2*t[(i+1)%n]+c[(i+1)%n]){
            cout << "No"; return 0;
        }
    }

    for(int i=0; i<n-1; i++){
        int take=min(t[i], a[i]/2);
        t[i]-=take;
        a[i]-=2*take;
        a[i+1]+=take;
    }
    int i=n-1;
    int take=min(t[i], a[i]/2);
    if(take<t[i]){
        cout << "No"; return 0;
    }
    t[i]-=take;
    a[i]-=2*take;
    a[0]+=take;
    for(int i=0; i<n-1; i++){
        int take=min(t[i], a[i]/2);
        if(take<t[i]){
            cout << "No"; return 0;
        }
        a[i]-=2*take;
        a[i+1]+=take;
    }
    for(int i=0; i<n; i++){
        if(a[i]!=b[i]){
            cout << "No"; return 0;
        }
    }
    cout << "Yes";
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 45.0

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