oj.uz

답안 #976697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976697 2024-05-07T03:15:42 Z gaga999 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 190 ms 19024 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);
    vector<pll> ar;
    a /= gcd(a, b + 1);
    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)
            ar.pb(l, a * b - 1), ar.pb(0, r);
        else
            ar.pb(l, r);
    }
    sort(iter(ar));
    llt lt = -1, ans = 0;
    for (pll &cr : ar)
    {
        if (cr.S <= lt)
            continue;
        ans += cr.S - max(cr.F - 1, lt);
        lt = cr.S;
    }
    prt(ans), putchar('\n');
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 15 ms 2512 KB Output is correct
18 Correct 1 ms 504 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 68 ms 19024 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 128 ms 18596 KB Output is correct
3 Correct 123 ms 18128 KB Output is correct
4 Correct 119 ms 18456 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 128 ms 18596 KB Output is correct
3 Correct 123 ms 18128 KB Output is correct
4 Correct 119 ms 18456 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 120 ms 17220 KB Output is correct
7 Correct 120 ms 17584 KB Output is correct
8 Correct 117 ms 17336 KB Output is correct
9 Correct 149 ms 18872 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 128 ms 18596 KB Output is correct
3 Correct 123 ms 18128 KB Output is correct
4 Correct 119 ms 18456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 12 ms 2512 KB Output is correct
7 Correct 13 ms 2508 KB Output is correct
8 Correct 13 ms 2508 KB Output is correct
9 Correct 13 ms 2512 KB Output is correct
10 Correct 11 ms 2512 KB Output is correct
11 Correct 13 ms 2764 KB Output is correct
12 Correct 11 ms 2508 KB Output is correct
13 Correct 15 ms 2512 KB Output is correct
14 Correct 11 ms 2512 KB Output is correct
15 Correct 15 ms 2620 KB Output is correct
16 Correct 15 ms 2508 KB Output is correct
17 Correct 19 ms 2512 KB Output is correct
18 Correct 131 ms 17432 KB Output is correct
19 Correct 125 ms 18356 KB Output is correct
20 Correct 162 ms 17140 KB Output is correct
21 Correct 15 ms 2512 KB Output is correct
22 Correct 11 ms 2464 KB Output is correct
23 Correct 31 ms 9156 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 15 ms 2508 KB Output is correct
3 Correct 19 ms 2508 KB Output is correct
4 Correct 190 ms 18352 KB Output is correct
5 Correct 16 ms 2512 KB Output is correct
6 Correct 14 ms 2512 KB Output is correct
7 Correct 14 ms 2616 KB Output is correct
8 Correct 15 ms 2508 KB Output is correct
9 Correct 14 ms 2512 KB Output is correct
10 Correct 14 ms 2512 KB Output is correct
11 Correct 15 ms 2508 KB Output is correct
12 Correct 11 ms 2508 KB Output is correct
13 Correct 14 ms 2512 KB Output is correct
14 Correct 148 ms 17064 KB Output is correct
15 Correct 13 ms 2512 KB Output is correct
16 Correct 118 ms 17092 KB Output is correct
17 Correct 116 ms 18528 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 15 ms 2512 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 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 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 68 ms 19024 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 128 ms 18596 KB Output is correct
31 Correct 123 ms 18128 KB Output is correct
32 Correct 119 ms 18456 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 120 ms 17220 KB Output is correct
35 Correct 120 ms 17584 KB Output is correct
36 Correct 117 ms 17336 KB Output is correct
37 Correct 149 ms 18872 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 12 ms 2512 KB Output is correct
40 Correct 13 ms 2508 KB Output is correct
41 Correct 13 ms 2508 KB Output is correct
42 Correct 13 ms 2512 KB Output is correct
43 Correct 11 ms 2512 KB Output is correct
44 Correct 13 ms 2764 KB Output is correct
45 Correct 11 ms 2508 KB Output is correct
46 Correct 15 ms 2512 KB Output is correct
47 Correct 11 ms 2512 KB Output is correct
48 Correct 15 ms 2620 KB Output is correct
49 Correct 15 ms 2508 KB Output is correct
50 Correct 19 ms 2512 KB Output is correct
51 Correct 131 ms 17432 KB Output is correct
52 Correct 125 ms 18356 KB Output is correct
53 Correct 162 ms 17140 KB Output is correct
54 Correct 15 ms 2512 KB Output is correct
55 Correct 11 ms 2464 KB Output is correct
56 Correct 31 ms 9156 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 15 ms 2508 KB Output is correct
59 Correct 19 ms 2508 KB Output is correct
60 Correct 190 ms 18352 KB Output is correct
61 Correct 16 ms 2512 KB Output is correct
62 Correct 14 ms 2512 KB Output is correct
63 Correct 14 ms 2616 KB Output is correct
64 Correct 15 ms 2508 KB Output is correct
65 Correct 14 ms 2512 KB Output is correct
66 Correct 14 ms 2512 KB Output is correct
67 Correct 15 ms 2508 KB Output is correct
68 Correct 11 ms 2508 KB Output is correct
69 Correct 14 ms 2512 KB Output is correct
70 Correct 148 ms 17064 KB Output is correct
71 Correct 13 ms 2512 KB Output is correct
72 Correct 118 ms 17092 KB Output is correct
73 Correct 116 ms 18528 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 2 ms 860 KB Output is correct
80 Correct 169 ms 18296 KB Output is correct
81 Correct 171 ms 17076 KB Output is correct
82 Correct 162 ms 18872 KB Output is correct
83 Correct 147 ms 17536 KB Output is correct
84 Correct 145 ms 17080 KB Output is correct
85 Correct 147 ms 18624 KB Output is correct
86 Correct 30 ms 9408 KB Output is correct
87 Correct 0 ms 348 KB Output is correct