oj.uz

Submission #976686

# Submission time Handle Problem Language Result Execution time Memory
976686 2024-05-07T02:59:53 Z gaga999 Strange Device (APIO19_strange_device) C++17
10 / 100
 176 ms 19084 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;
    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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Incorrect 0 ms 504 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 67 ms 19084 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 116 ms 17796 KB Output is correct
3 Incorrect 143 ms 18352 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 116 ms 17796 KB Output is correct
3 Incorrect 143 ms 18352 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 116 ms 17796 KB Output is correct
3 Incorrect 143 ms 18352 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 14 ms 2512 KB Output is correct
3 Correct 14 ms 2512 KB Output is correct
4 Correct 176 ms 17900 KB Output is correct
5 Correct 14 ms 2512 KB Output is correct
6 Correct 14 ms 2512 KB Output is correct
7 Correct 14 ms 2512 KB Output is correct
8 Correct 15 ms 2512 KB Output is correct
9 Correct 13 ms 2512 KB Output is correct
10 Correct 14 ms 2512 KB Output is correct
11 Correct 15 ms 2512 KB Output is correct
12 Correct 10 ms 2512 KB Output is correct
13 Correct 14 ms 2512 KB Output is correct
14 Correct 143 ms 17596 KB Output is correct
15 Incorrect 15 ms 2508 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Incorrect 0 ms 504 KB Output isn't correct
5 Halted 0 ms 0 KB -