oj.uz

Submission #554331

# Submission time Handle Problem Language Result Execution time Memory
554331 2022-04-28T07:12:55 Z maomao90 Strange Device (APIO19_strange_device) C++17
55 / 100
 631 ms 49964 KB 
// 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;

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;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
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 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

#define INF 1000000005
#define LINF 1000000000000000005ll
#define MAXN 1000005

int n;
ll a, b;
ll l[MAXN], r[MAXN];
ll ans;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0); cin.tie(0);
#endif
    cin >> n >> a >> b;
    REP (i, 0, n) {
        cin >> l[i] >> r[i];
    }
    ll g = __gcd(b + 1, a);
    __int128 mx = (__int128) a / g * b;
    REP (i, 0, n) {
        if (r[i] - l[i] + 1 > mx) {
            cout << (ll) mx << '\n';
            return 0;
        }
    }
    cerr << (ll) mx << '\n';
    vector<pll> ev;
    REP (i, 0, n) {
        l[i] %= mx; r[i] %= mx;
        ev.pb({l[i], 1});
        if (r[i] >= l[i]) {
            ev.pb({r[i] + 1, -1});
        } else {
            ev.pb({r[i] + mx + 1, -1});
        }
        cerr << l[i] << ' ' << r[i] << '\n';
    }
    sort(ALL(ev));
    ll p = 0, cur = 0;
    for (auto [a, b] : ev) {
        cerr << a << ' ' << b << '\n';
        if (cur > 0) {
            ans += a - p;
        }
        cur += b;
        p = a;
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 1112 KB Output is correct
3 Correct 5 ms 1496 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 506 ms 48936 KB Output is correct
3 Correct 526 ms 49484 KB Output is correct
4 Correct 530 ms 49964 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 506 ms 48936 KB Output is correct
3 Correct 526 ms 49484 KB Output is correct
4 Correct 530 ms 49964 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 538 ms 49952 KB Output is correct
7 Correct 499 ms 49884 KB Output is correct
8 Correct 556 ms 49912 KB Output is correct
9 Correct 611 ms 49580 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 506 ms 48936 KB Output is correct
3 Correct 526 ms 49484 KB Output is correct
4 Correct 530 ms 49964 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 54 ms 9772 KB Output is correct
7 Correct 53 ms 9840 KB Output is correct
8 Correct 49 ms 9828 KB Output is correct
9 Correct 54 ms 9796 KB Output is correct
10 Correct 48 ms 9772 KB Output is correct
11 Correct 50 ms 9792 KB Output is correct
12 Correct 52 ms 9856 KB Output is correct
13 Correct 58 ms 9796 KB Output is correct
14 Correct 49 ms 9748 KB Output is correct
15 Correct 61 ms 9812 KB Output is correct
16 Correct 58 ms 9820 KB Output is correct
17 Correct 51 ms 9868 KB Output is correct
18 Correct 509 ms 49576 KB Output is correct
19 Correct 489 ms 49452 KB Output is correct
20 Correct 610 ms 49488 KB Output is correct
21 Correct 64 ms 9800 KB Output is correct
22 Correct 49 ms 9892 KB Output is correct
23 Correct 148 ms 27808 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 6112 KB Output is correct
3 Correct 55 ms 9748 KB Output is correct
4 Correct 631 ms 49424 KB Output is correct
5 Correct 58 ms 9820 KB Output is correct
6 Correct 56 ms 9756 KB Output is correct
7 Correct 58 ms 9796 KB Output is correct
8 Correct 59 ms 9796 KB Output is correct
9 Correct 57 ms 9804 KB Output is correct
10 Correct 60 ms 9776 KB Output is correct
11 Correct 59 ms 9784 KB Output is correct
12 Correct 55 ms 9796 KB Output is correct
13 Correct 60 ms 9756 KB Output is correct
14 Correct 565 ms 49792 KB Output is correct
15 Correct 61 ms 9836 KB Output is correct
16 Correct 510 ms 49432 KB Output is correct
17 Correct 502 ms 49464 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 1112 KB Output is correct
3 Correct 5 ms 1496 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -