oj.uz

Submission #976694

# Submission time Handle Problem Language Result Execution time Memory
976694 2024-05-07T03:14:45 Z gaga999 Strange Device (APIO19_strange_device) C++17
100 / 100
 676 ms 126000 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 0 ms 348 KB Output is correct
2 Correct 5 ms 1628 KB Output is correct
3 Correct 4 ms 1548 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 620 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1624 KB Output is correct
17 Correct 34 ms 6700 KB Output is correct
18 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 1 ms 536 KB Output is correct
4 Correct 1 ms 612 KB Output is correct
5 Correct 52 ms 356 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 385 ms 63076 KB Output is correct
3 Correct 592 ms 125748 KB Output is correct
4 Correct 634 ms 125668 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 385 ms 63076 KB Output is correct
3 Correct 592 ms 125748 KB Output is correct
4 Correct 634 ms 125668 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 582 ms 125836 KB Output is correct
7 Correct 445 ms 63152 KB Output is correct
8 Correct 549 ms 125736 KB Output is correct
9 Correct 626 ms 125728 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 385 ms 63076 KB Output is correct
3 Correct 592 ms 125748 KB Output is correct
4 Correct 634 ms 125668 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 40 ms 12936 KB Output is correct
7 Correct 44 ms 12896 KB Output is correct
8 Correct 43 ms 13016 KB Output is correct
9 Correct 47 ms 12884 KB Output is correct
10 Correct 47 ms 12912 KB Output is correct
11 Correct 45 ms 13024 KB Output is correct
12 Correct 49 ms 13016 KB Output is correct
13 Correct 56 ms 13000 KB Output is correct
14 Correct 43 ms 12884 KB Output is correct
15 Correct 51 ms 12884 KB Output is correct
16 Correct 64 ms 13016 KB Output is correct
17 Correct 46 ms 12892 KB Output is correct
18 Correct 544 ms 125736 KB Output is correct
19 Correct 610 ms 125624 KB Output is correct
20 Correct 637 ms 125748 KB Output is correct
21 Correct 48 ms 12892 KB Output is correct
22 Correct 59 ms 12952 KB Output is correct
23 Correct 23 ms 344 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 55 ms 12816 KB Output is correct
3 Correct 55 ms 12884 KB Output is correct
4 Correct 623 ms 125668 KB Output is correct
5 Correct 54 ms 12884 KB Output is correct
6 Correct 58 ms 12880 KB Output is correct
7 Correct 55 ms 12880 KB Output is correct
8 Correct 49 ms 12880 KB Output is correct
9 Correct 50 ms 12880 KB Output is correct
10 Correct 46 ms 12804 KB Output is correct
11 Correct 49 ms 12788 KB Output is correct
12 Correct 50 ms 12884 KB Output is correct
13 Correct 52 ms 12880 KB Output is correct
14 Correct 676 ms 125524 KB Output is correct
15 Correct 41 ms 12884 KB Output is correct
16 Correct 587 ms 125536 KB Output is correct
17 Correct 561 ms 125740 KB Output is correct
18 Correct 0 ms 344 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 1628 KB Output is correct
3 Correct 4 ms 1548 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 620 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1624 KB Output is correct
17 Correct 34 ms 6700 KB Output is correct
18 Correct 0 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 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 608 KB Output is correct
26 Correct 1 ms 536 KB Output is correct
27 Correct 1 ms 612 KB Output is correct
28 Correct 52 ms 356 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 385 ms 63076 KB Output is correct
31 Correct 592 ms 125748 KB Output is correct
32 Correct 634 ms 125668 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 582 ms 125836 KB Output is correct
35 Correct 445 ms 63152 KB Output is correct
36 Correct 549 ms 125736 KB Output is correct
37 Correct 626 ms 125728 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 40 ms 12936 KB Output is correct
40 Correct 44 ms 12896 KB Output is correct
41 Correct 43 ms 13016 KB Output is correct
42 Correct 47 ms 12884 KB Output is correct
43 Correct 47 ms 12912 KB Output is correct
44 Correct 45 ms 13024 KB Output is correct
45 Correct 49 ms 13016 KB Output is correct
46 Correct 56 ms 13000 KB Output is correct
47 Correct 43 ms 12884 KB Output is correct
48 Correct 51 ms 12884 KB Output is correct
49 Correct 64 ms 13016 KB Output is correct
50 Correct 46 ms 12892 KB Output is correct
51 Correct 544 ms 125736 KB Output is correct
52 Correct 610 ms 125624 KB Output is correct
53 Correct 637 ms 125748 KB Output is correct
54 Correct 48 ms 12892 KB Output is correct
55 Correct 59 ms 12952 KB Output is correct
56 Correct 23 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 55 ms 12816 KB Output is correct
59 Correct 55 ms 12884 KB Output is correct
60 Correct 623 ms 125668 KB Output is correct
61 Correct 54 ms 12884 KB Output is correct
62 Correct 58 ms 12880 KB Output is correct
63 Correct 55 ms 12880 KB Output is correct
64 Correct 49 ms 12880 KB Output is correct
65 Correct 50 ms 12880 KB Output is correct
66 Correct 46 ms 12804 KB Output is correct
67 Correct 49 ms 12788 KB Output is correct
68 Correct 50 ms 12884 KB Output is correct
69 Correct 52 ms 12880 KB Output is correct
70 Correct 676 ms 125524 KB Output is correct
71 Correct 41 ms 12884 KB Output is correct
72 Correct 587 ms 125536 KB Output is correct
73 Correct 561 ms 125740 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 4 ms 1628 KB Output is correct
80 Correct 647 ms 125580 KB Output is correct
81 Correct 587 ms 125860 KB Output is correct
82 Correct 620 ms 126000 KB Output is correct
83 Correct 672 ms 125752 KB Output is correct
84 Correct 633 ms 125524 KB Output is correct
85 Correct 603 ms 125544 KB Output is correct
86 Correct 26 ms 344 KB Output is correct
87 Correct 0 ms 348 KB Output is correct