oj.uz

Submission #976693

# Submission time Handle Problem Language Result Execution time Memory
976693 2024-05-07T03:14:35 Z gaga999 Strange Device (APIO19_strange_device) C++17
100 / 100
 752 ms 163092 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef pair<llt, int> pli;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

signed main()
{
#define f(x) ((x) % lll(a * b))
    int n;
    llt a, b, l, r;
    rd(n, a, b);
    a /= gcd(a, b + 1);
    map<llt, int> mp;
    for (int i = 0; i < n; i++)
    {
        rd(l, r);
        if (r - l + 1 >= (lll)a * b)
            prt(a * b), putchar('\n'), exit(0);
        l = f(l), r = f(r);
        if (l > r)
            mp[l]++, mp[a * b]--, mp[a * b - 1], mp[0]++, mp[r + 1]--, mp[r];
        else
            mp[l]++, mp[r + 1]--, mp[r];
    }
    llt lt = -1, ans = 0, cr = 0;
    for (auto it : mp)
    {
        if (cr)
            ans += it.F - lt;
        cr += it.S, lt = it.F;
    }
    prt(ans), putchar('\n');
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 1628 KB Output is correct
3 Correct 5 ms 1604 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 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 444 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 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 2096 KB Output is correct
17 Correct 36 ms 10388 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 47 ms 348 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 381 ms 63084 KB Output is correct
3 Correct 556 ms 125780 KB Output is correct
4 Correct 672 ms 163044 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 381 ms 63084 KB Output is correct
3 Correct 556 ms 125780 KB Output is correct
4 Correct 672 ms 163044 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 549 ms 162828 KB Output is correct
7 Correct 433 ms 100060 KB Output is correct
8 Correct 569 ms 162772 KB Output is correct
9 Correct 736 ms 163092 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 381 ms 63084 KB Output is correct
3 Correct 556 ms 125780 KB Output is correct
4 Correct 672 ms 163044 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 40 ms 16720 KB Output is correct
7 Correct 47 ms 16724 KB Output is correct
8 Correct 44 ms 16724 KB Output is correct
9 Correct 46 ms 16508 KB Output is correct
10 Correct 40 ms 16972 KB Output is correct
11 Correct 41 ms 16720 KB Output is correct
12 Correct 46 ms 16480 KB Output is correct
13 Correct 53 ms 16468 KB Output is correct
14 Correct 43 ms 16720 KB Output is correct
15 Correct 58 ms 16732 KB Output is correct
16 Correct 54 ms 16724 KB Output is correct
17 Correct 55 ms 16724 KB Output is correct
18 Correct 576 ms 162800 KB Output is correct
19 Correct 647 ms 162852 KB Output is correct
20 Correct 664 ms 162596 KB Output is correct
21 Correct 58 ms 16680 KB Output is correct
22 Correct 60 ms 16520 KB Output is correct
23 Correct 31 ms 13024 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 60 ms 12812 KB Output is correct
3 Correct 50 ms 12848 KB Output is correct
4 Correct 605 ms 125744 KB Output is correct
5 Correct 49 ms 12836 KB Output is correct
6 Correct 51 ms 12924 KB Output is correct
7 Correct 50 ms 12880 KB Output is correct
8 Correct 55 ms 12880 KB Output is correct
9 Correct 50 ms 12936 KB Output is correct
10 Correct 44 ms 12884 KB Output is correct
11 Correct 51 ms 12964 KB Output is correct
12 Correct 57 ms 12760 KB Output is correct
13 Correct 53 ms 12972 KB Output is correct
14 Correct 733 ms 125636 KB Output is correct
15 Correct 44 ms 12888 KB Output is correct
16 Correct 552 ms 162832 KB Output is correct
17 Correct 545 ms 162640 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 1628 KB Output is correct
3 Correct 5 ms 1604 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 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 444 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 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 2096 KB Output is correct
17 Correct 36 ms 10388 KB Output is correct
18 Correct 1 ms 348 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 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 47 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 381 ms 63084 KB Output is correct
31 Correct 556 ms 125780 KB Output is correct
32 Correct 672 ms 163044 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 549 ms 162828 KB Output is correct
35 Correct 433 ms 100060 KB Output is correct
36 Correct 569 ms 162772 KB Output is correct
37 Correct 736 ms 163092 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 40 ms 16720 KB Output is correct
40 Correct 47 ms 16724 KB Output is correct
41 Correct 44 ms 16724 KB Output is correct
42 Correct 46 ms 16508 KB Output is correct
43 Correct 40 ms 16972 KB Output is correct
44 Correct 41 ms 16720 KB Output is correct
45 Correct 46 ms 16480 KB Output is correct
46 Correct 53 ms 16468 KB Output is correct
47 Correct 43 ms 16720 KB Output is correct
48 Correct 58 ms 16732 KB Output is correct
49 Correct 54 ms 16724 KB Output is correct
50 Correct 55 ms 16724 KB Output is correct
51 Correct 576 ms 162800 KB Output is correct
52 Correct 647 ms 162852 KB Output is correct
53 Correct 664 ms 162596 KB Output is correct
54 Correct 58 ms 16680 KB Output is correct
55 Correct 60 ms 16520 KB Output is correct
56 Correct 31 ms 13024 KB Output is correct
57 Correct 0 ms 360 KB Output is correct
58 Correct 60 ms 12812 KB Output is correct
59 Correct 50 ms 12848 KB Output is correct
60 Correct 605 ms 125744 KB Output is correct
61 Correct 49 ms 12836 KB Output is correct
62 Correct 51 ms 12924 KB Output is correct
63 Correct 50 ms 12880 KB Output is correct
64 Correct 55 ms 12880 KB Output is correct
65 Correct 50 ms 12936 KB Output is correct
66 Correct 44 ms 12884 KB Output is correct
67 Correct 51 ms 12964 KB Output is correct
68 Correct 57 ms 12760 KB Output is correct
69 Correct 53 ms 12972 KB Output is correct
70 Correct 733 ms 125636 KB Output is correct
71 Correct 44 ms 12888 KB Output is correct
72 Correct 552 ms 162832 KB Output is correct
73 Correct 545 ms 162640 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 1 ms 440 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 5 ms 2140 KB Output is correct
80 Correct 674 ms 162872 KB Output is correct
81 Correct 608 ms 162768 KB Output is correct
82 Correct 713 ms 162844 KB Output is correct
83 Correct 752 ms 162840 KB Output is correct
84 Correct 690 ms 162664 KB Output is correct
85 Correct 613 ms 162916 KB Output is correct
86 Correct 27 ms 12756 KB Output is correct
87 Correct 1 ms 348 KB Output is correct