Submission #258899

# Submission time Handle Problem Language Result Execution time Memory
258899 2020-08-06T17:24:51 Z AM1648 Strange Device (APIO19_strange_device) C++17
100 / 100
939 ms 70468 KB
/* be name khoda */

#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>
using namespace std;

#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl

const ll MOD = 1000000007;
const long long BIG = 1446803456761533460LL;

#define XL (x << 1)
#define XR (XL | 1)
#define MD ((l + r) >> 1)
#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

// -----------------------------------------------------------------------

const ll maxn = 1000010;
const ll maxa = 2000000000000000000;

ll n, A, B, g, m;
map<ll, ll> seg;

void add(ll l, ll r) {
    seg[l]++;
    seg[r]--;
    if (l >= r) {
        seg[0]++;
        seg[m]--;
    }
}

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

    cin >> n >> A >> B;
    g = gcd(A, B + 1);
    m = A / g;
    if (B > maxa / m + 10) m = maxa;
    else m *= B;
    fori (i, n) {
        ll l, r; cin >> l >> r; ++r;
        if (r - l >= m) return cout << m << '\n', 0;
        add(l % m, r % m);
    }
    ll ans = 0;
    ll lst = 0, ps = 0;
    for (auto [x, v] : seg) {
        if (ps) ans += x - lst;
        lst = x, ps += v;
    }
    cout << ans << '\n';

}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 8 ms 1152 KB Output is correct
3 Correct 7 ms 1152 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 7 ms 1152 KB Output is correct
17 Correct 79 ms 6780 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 322 ms 520 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 795 ms 63196 KB Output is correct
3 Correct 804 ms 63096 KB Output is correct
4 Correct 854 ms 63224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 795 ms 63196 KB Output is correct
3 Correct 804 ms 63096 KB Output is correct
4 Correct 854 ms 63224 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 836 ms 63304 KB Output is correct
7 Correct 829 ms 63064 KB Output is correct
8 Correct 826 ms 63116 KB Output is correct
9 Correct 939 ms 63252 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 795 ms 63196 KB Output is correct
3 Correct 804 ms 63096 KB Output is correct
4 Correct 854 ms 63224 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 74 ms 6904 KB Output is correct
7 Correct 71 ms 6776 KB Output is correct
8 Correct 78 ms 6776 KB Output is correct
9 Correct 77 ms 6776 KB Output is correct
10 Correct 83 ms 6780 KB Output is correct
11 Correct 71 ms 6776 KB Output is correct
12 Correct 72 ms 6752 KB Output is correct
13 Correct 81 ms 6776 KB Output is correct
14 Correct 70 ms 6776 KB Output is correct
15 Correct 82 ms 6776 KB Output is correct
16 Correct 80 ms 6776 KB Output is correct
17 Correct 74 ms 6776 KB Output is correct
18 Correct 805 ms 63328 KB Output is correct
19 Correct 834 ms 63320 KB Output is correct
20 Correct 883 ms 63224 KB Output is correct
21 Correct 73 ms 6780 KB Output is correct
22 Correct 75 ms 6776 KB Output is correct
23 Correct 148 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 83 ms 6776 KB Output is correct
3 Correct 79 ms 6776 KB Output is correct
4 Correct 859 ms 63176 KB Output is correct
5 Correct 80 ms 6776 KB Output is correct
6 Correct 90 ms 6776 KB Output is correct
7 Correct 92 ms 6776 KB Output is correct
8 Correct 81 ms 6776 KB Output is correct
9 Correct 86 ms 6776 KB Output is correct
10 Correct 76 ms 6776 KB Output is correct
11 Correct 76 ms 6800 KB Output is correct
12 Correct 75 ms 6904 KB Output is correct
13 Correct 81 ms 6904 KB Output is correct
14 Correct 899 ms 63284 KB Output is correct
15 Correct 69 ms 6904 KB Output is correct
16 Correct 787 ms 63336 KB Output is correct
17 Correct 787 ms 63484 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 8 ms 1152 KB Output is correct
3 Correct 7 ms 1152 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 7 ms 1152 KB Output is correct
17 Correct 79 ms 6780 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 322 ms 520 KB Output is correct
29 Correct 0 ms 288 KB Output is correct
30 Correct 795 ms 63196 KB Output is correct
31 Correct 804 ms 63096 KB Output is correct
32 Correct 854 ms 63224 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 836 ms 63304 KB Output is correct
35 Correct 829 ms 63064 KB Output is correct
36 Correct 826 ms 63116 KB Output is correct
37 Correct 939 ms 63252 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 74 ms 6904 KB Output is correct
40 Correct 71 ms 6776 KB Output is correct
41 Correct 78 ms 6776 KB Output is correct
42 Correct 77 ms 6776 KB Output is correct
43 Correct 83 ms 6780 KB Output is correct
44 Correct 71 ms 6776 KB Output is correct
45 Correct 72 ms 6752 KB Output is correct
46 Correct 81 ms 6776 KB Output is correct
47 Correct 70 ms 6776 KB Output is correct
48 Correct 82 ms 6776 KB Output is correct
49 Correct 80 ms 6776 KB Output is correct
50 Correct 74 ms 6776 KB Output is correct
51 Correct 805 ms 63328 KB Output is correct
52 Correct 834 ms 63320 KB Output is correct
53 Correct 883 ms 63224 KB Output is correct
54 Correct 73 ms 6780 KB Output is correct
55 Correct 75 ms 6776 KB Output is correct
56 Correct 148 ms 512 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 83 ms 6776 KB Output is correct
59 Correct 79 ms 6776 KB Output is correct
60 Correct 859 ms 63176 KB Output is correct
61 Correct 80 ms 6776 KB Output is correct
62 Correct 90 ms 6776 KB Output is correct
63 Correct 92 ms 6776 KB Output is correct
64 Correct 81 ms 6776 KB Output is correct
65 Correct 86 ms 6776 KB Output is correct
66 Correct 76 ms 6776 KB Output is correct
67 Correct 76 ms 6800 KB Output is correct
68 Correct 75 ms 6904 KB Output is correct
69 Correct 81 ms 6904 KB Output is correct
70 Correct 899 ms 63284 KB Output is correct
71 Correct 69 ms 6904 KB Output is correct
72 Correct 787 ms 63336 KB Output is correct
73 Correct 787 ms 63484 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 0 ms 384 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 8 ms 1408 KB Output is correct
80 Correct 875 ms 70468 KB Output is correct
81 Correct 875 ms 70392 KB Output is correct
82 Correct 890 ms 70392 KB Output is correct
83 Correct 889 ms 70236 KB Output is correct
84 Correct 937 ms 70220 KB Output is correct
85 Correct 864 ms 70392 KB Output is correct
86 Correct 153 ms 12912 KB Output is correct
87 Correct 1 ms 384 KB Output is correct