답안 #893741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893741	2023-12-27T10:39:14 Z	Alcabel	송금 (JOI19_remittance)	C++17	55 / 100	1000 ms	15968 KB

remittance

#pragma GCC optimize("O3", "Ofast", "unroll-loops", "fast-math")
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
const long long mod = 1e9 + 7;
#else
const long long mod = 2000000000000021ll;
#endif

#ifdef LOCAL
typedef long long __int128_t;
#endif

struct Modint {
    long long x;
    Modint() {
        x = 0ll;
    }
    Modint(long long _x) {
        while (_x >= mod) {
            _x -= mod;
        }
        while (_x < 0) {
            _x += mod;
        }
        x = _x;
    }
    Modint(__int128_t _x) {
        if (_x >= mod || _x <= -mod) {
            _x %= mod;
        }
        if (_x < 0) {
            _x += mod;
        }
        x = _x;
    }
    Modint operator+(const Modint& other) const {
        return Modint(x + other.x);
    }
    Modint operator-(const Modint& other) const {
        return Modint(x - other.x);
    }
    Modint operator*(const Modint& other) const {
        return Modint((__int128_t)x * other.x);
    }
    void operator+=(const Modint& other) {
        *this = *this + other;
    }
    void operator-=(const Modint& other) {
        *this = *this - other;
    }
    void operator*=(const Modint& other) {
        *this = *this * other;
    }
    Modint operator^(long long k) const {
        Modint tmp = x, res = 1ll;
        while (k > 0) {
            // cerr << k << '\n';
            if (k & 1ll) {
                res *= tmp;
            }
            tmp *= tmp;
            k >>= 1;
        }
        return res;
    }
    ~Modint() {}
};

void solve() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }
    Modint denom = 1ll;
    for (int i = 0; i < n; ++i) {
        denom = denom + denom;
    }
    // cerr << denom.x << '\n';
    denom = (denom - 1ll) ^ (mod - 2);
    // cerr << (denom * ((1ll << n) - 1)).x << '\n';
    vector<long long> x(n);
    for (int i = 0; i < n; ++i) {
        Modint xmod = 0ll;
        for (int j = i; j >= 0; --j) {
            xmod = xmod + xmod + (long long)(b[j] - a[j]);
        }
        for (int j = n - 1; j > i; --j) {
            xmod = xmod + xmod + (long long)(b[j] - a[j]);
        }
        xmod = (Modint(0ll) - xmod) * denom;
        if (xmod.x > mod / 2) {
            cout << "No\n";
            return;
        }
        x[i] = xmod.x;
    }
    for (int i = 0, prv = n - 1; i < n; ++i, ++prv) {
        if (prv == n) { prv = 0; }
        if (x[prv] - 2 * x[i] != b[i] - a[i]) {
            cout << "No\n";
            return;
        }
    }
    bool change = true;
    while (change) {
        change = false;
        for (int i = 0; i < n; ++i) {
            if (x[i] > 0 && a[i] >= 2) {
                change = true;
                long long trans = min(x[i], a[i] * 1ll / 2);
                x[i] -= trans;
                a[i] -= 2 * trans;
                int nxt = i + 1;
                if (nxt == n) {
                    nxt = 0;
                }
                a[nxt] += trans;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        if (x[i] != 0) {
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
        cerr << "-----------\n";
        cout << "-----------\n";
    }
#else
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
#endif

    return 0;
}

/*
2000000000000021
2000000000000077
2000000000000081
*/

Subtask #1
15.0 / 15.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	344 KB	Output is correct
12	Correct	344 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	344 KB	Output is correct
17	Correct	344 KB	Output is correct
18	Correct	344 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	348 KB	Output is correct
22	Correct	348 KB	Output is correct
23	Correct	348 KB	Output is correct
24	Correct	348 KB	Output is correct
25	Correct	348 KB	Output is correct
26	Correct	348 KB	Output is correct
27	Correct	348 KB	Output is correct
28	Correct	348 KB	Output is correct
29	Correct	348 KB	Output is correct
30	Correct	348 KB	Output is correct
31	Correct	348 KB	Output is correct
32	Correct	348 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	344 KB	Output is correct
12	Correct	344 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	344 KB	Output is correct
17	Correct	344 KB	Output is correct
18	Correct	344 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	348 KB	Output is correct
22	Correct	348 KB	Output is correct
23	Correct	348 KB	Output is correct
24	Correct	348 KB	Output is correct
25	Correct	348 KB	Output is correct
26	Correct	348 KB	Output is correct
27	Correct	348 KB	Output is correct
28	Correct	348 KB	Output is correct
29	Correct	348 KB	Output is correct
30	Correct	348 KB	Output is correct
31	Correct	348 KB	Output is correct
32	Correct	348 KB	Output is correct
33	Correct	348 KB	Output is correct
34	Correct	348 KB	Output is correct
35	Correct	348 KB	Output is correct
36	Correct	348 KB	Output is correct
37	Correct	348 KB	Output is correct
38	Correct	348 KB	Output is correct
39	Correct	348 KB	Output is correct
40	Correct	348 KB	Output is correct
41	Correct	348 KB	Output is correct
42	Correct	348 KB	Output is correct
43	Correct	348 KB	Output is correct
44	Correct	348 KB	Output is correct
45	Correct	600 KB	Output is correct
46	Correct	348 KB	Output is correct
47	Correct	600 KB	Output is correct
48	Correct	348 KB	Output is correct
49	Correct	360 KB	Output is correct
50	Correct	348 KB	Output is correct
51	Correct	348 KB	Output is correct
52	Correct	348 KB	Output is correct
53	Correct	348 KB	Output is correct
54	Correct	348 KB	Output is correct
55	Correct	348 KB	Output is correct
56	Correct	344 KB	Output is correct
57	Correct	600 KB	Output is correct
58	Correct	348 KB	Output is correct
59	Correct	348 KB	Output is correct
60	Correct	348 KB	Output is correct
61	Correct	348 KB	Output is correct
62	Correct	348 KB	Output is correct

Subtask #3
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	600 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	600 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	360 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	344 KB	Output is correct
57	Correct	0 ms	600 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	154 ms	15968 KB	Output is correct
64	Execution timed out	1037 ms	15956 KB	Time limit exceeded
65	Halted	0 ms	0 KB	-

답안 #893741

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 40.0 / 40.0

Subtask #3 0 / 45.0

Subtask #1
15.0 / 15.0

Subtask #2
40.0 / 40.0

Subtask #3
0 / 45.0