Submission #834912

#	Time	Username	Problem	Language	Result	Execution time	Memory
834912		maomao90	Remittance (JOI19_remittance)	C++17	100 / 100	245 ms	44236 KiB

remittance

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1000005;
const ll MOD = 998244353998244393;

#define submod(x) if (x >= MOD) x -= MOD

int n;
ll a[MAXN], b[MAXN], x[MAXN];

ll fpow(__int128 b, ll p) {
    __int128 res = 1;
    while (p) {
        if (p & 1) {
            res = res * b % MOD;
        }
        b = b * b % MOD;
        p >>= 1;
    }
    return res;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    ll mxa = 0, smb = 0;
    REP (i, 0, n) {
        cin >> a[i] >> b[i];
        mxto(mxa, a[i]);
        smb += b[i];
    }
    bool bad = 0;
    REP (i, 0, n) {
        if (a[i] != b[i]) {
            bad = 1;
            break;
        }
    }
    if (!bad) {
        cout << "Yes\n";
        return 0;
    }
    if (mxa <= 1 || smb == 0) {
        cout << "No\n";
        return 0;
    }
    ll pw = 1;
    REP (i, 0, n) {
        x[n - 1] += (__int128) (b[i] - a[i] + MOD) * pw % MOD;
        submod(x[n - 1]);
        pw = pw * 2;
        submod(pw);
    }
    x[n - 1] = (__int128) x[n - 1] * fpow((-pw + 1 + MOD) % MOD, MOD - 2) % MOD;
    REP (i, 0, n - 1) {
        int prv = i - 1;
        if (prv < 0) {
            prv += n;
        }
        x[i] = a[i] - b[i] + x[prv];
        if (x[i] % 2 != 0 || x[i] < 0) {
            cout << "No\n";
            return 0;
        }
        x[i] /= 2;
    }
    REP (i, 0, n) {
        int prv = i - 1;
        if (prv < 0) {
            prv += n;
        }
        if (a[i] - 2 * x[i] + x[prv] != b[i]) {
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
    return 0;
}

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