Submission #597796

# Submission time Handle Problem Language Result Execution time Memory
597796 2022-07-16T22:08:05 Z Ozy Strange Device (APIO19_strange_device) C++17
65 / 100
581 ms 33292 KB
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)

#define LIM (1ll << 62)

lli a,b,n,cont,x,y,mult,ini,res,k;
vector<pair<lli,lli> > orden;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> a >> b;
    k = a/__gcd(a,b+1);

    if (LIM/k < b) mult = LIM;
    else {
        mult = k*b;
    }

    rep(i,1,n) {
        cin >> x >> y;

        if (x == y) {
            x %= mult;
            orden.push_back({x,1});
            orden.push_back({x,2});
            continue;
        }

        x %= mult;
        y %= mult;

        if (x >= y) {
            orden.push_back({0,1});
            orden.push_back({mult-1,2});
        }
        orden.push_back({x,1});
        orden.push_back({y,2});
    }

    sort(orden.begin(), orden.end());

    ini = -1;
    cont = 0;
    res = 0;
    for (auto act:orden) {

        if (act.second == 1) {
            cont++;
            if (ini == -1) ini = act.first;
        }
        else cont--;

        if (cont == 0) {
            res += (act.first - ini) + 1;
            ini = -1;
        }
    }

    cout << res;
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 984 KB Output is correct
3 Correct 9 ms 984 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 856 KB Output is correct
17 Correct 53 ms 4520 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 358 ms 33272 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 531 ms 33256 KB Output is correct
3 Correct 493 ms 33192 KB Output is correct
4 Correct 481 ms 33228 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 531 ms 33256 KB Output is correct
3 Correct 493 ms 33192 KB Output is correct
4 Correct 481 ms 33228 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 482 ms 33268 KB Output is correct
7 Correct 458 ms 33256 KB Output is correct
8 Correct 467 ms 33176 KB Output is correct
9 Correct 529 ms 33272 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 531 ms 33256 KB Output is correct
3 Correct 493 ms 33192 KB Output is correct
4 Correct 481 ms 33228 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 51 ms 4580 KB Output is correct
7 Correct 50 ms 4432 KB Output is correct
8 Correct 47 ms 4540 KB Output is correct
9 Correct 46 ms 4464 KB Output is correct
10 Correct 45 ms 4560 KB Output is correct
11 Correct 48 ms 4444 KB Output is correct
12 Correct 55 ms 4456 KB Output is correct
13 Correct 54 ms 4548 KB Output is correct
14 Correct 54 ms 4524 KB Output is correct
15 Correct 52 ms 4464 KB Output is correct
16 Correct 49 ms 4460 KB Output is correct
17 Correct 45 ms 4568 KB Output is correct
18 Correct 492 ms 33168 KB Output is correct
19 Correct 532 ms 33240 KB Output is correct
20 Correct 567 ms 33204 KB Output is correct
21 Correct 54 ms 4560 KB Output is correct
22 Correct 43 ms 4544 KB Output is correct
23 Correct 132 ms 16768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 52 ms 4552 KB Output is correct
3 Correct 52 ms 4488 KB Output is correct
4 Correct 581 ms 33288 KB Output is correct
5 Correct 53 ms 4492 KB Output is correct
6 Correct 51 ms 4528 KB Output is correct
7 Correct 49 ms 4560 KB Output is correct
8 Correct 51 ms 4472 KB Output is correct
9 Correct 47 ms 4556 KB Output is correct
10 Correct 53 ms 4468 KB Output is correct
11 Correct 51 ms 4512 KB Output is correct
12 Correct 56 ms 4572 KB Output is correct
13 Correct 68 ms 4476 KB Output is correct
14 Correct 531 ms 33176 KB Output is correct
15 Correct 53 ms 4548 KB Output is correct
16 Correct 457 ms 33292 KB Output is correct
17 Correct 507 ms 33212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 984 KB Output is correct
3 Correct 9 ms 984 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 856 KB Output is correct
17 Correct 53 ms 4520 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -