oj.uz

Submission #663167

# Submission time Handle Problem Language Result Execution time Memory
663167 2022-11-26T16:19:51 Z Ai7081 Strange Device (APIO19_strange_device) C++17
65 / 100
 429 ms 16948 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, ll>

const ll inf = 5e18;

ll n, a, b, l, r, p;
vector<pii> v;

ll gcd(ll c1, ll c2) {
    if (!c2) return c1;
    return gcd(c2, c1%c2);
}

ll lcm(ll c1, ll c2) {
    ll ans = c1 / gcd(c1, c2);
    if (inf / ans < c2) return inf;
    return ans * c2;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> a >> b;
    p = lcm(b+1, a);
    p = (p==inf ? inf : (p/(b+1))*b);
    while (n--) {
        cin >> l >> r, l%=p, r%=p;
        if (l>r) v.push_back({0,r}), v.push_back({l,p-1});
        else v.push_back({l,r});
    }
    sort(v.begin(), v.end());
    ll out=0, ma=-1;
    for (auto [x,y]:v) out += (ma<x ? y-x+1 : max((ll)0,y-ma)), ma=max(ma,y);
    cout << out;
    return 0;
}

/*
3 3 3
4 4
7 9
17 18
ans: 4

3 5 10
1 20
50 68
89 98
ans: 31

1 1000000000000000 1000000000000000000
100000 1000000
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 600 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 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 4 ms 600 KB Output is correct
17 Correct 41 ms 2416 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# 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 280 ms 16888 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 373 ms 16948 KB Output is correct
3 Correct 366 ms 16760 KB Output is correct
4 Correct 365 ms 16928 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 373 ms 16948 KB Output is correct
3 Correct 366 ms 16760 KB Output is correct
4 Correct 365 ms 16928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 378 ms 16812 KB Output is correct
7 Correct 369 ms 16744 KB Output is correct
8 Correct 373 ms 16872 KB Output is correct
9 Correct 397 ms 16812 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 373 ms 16948 KB Output is correct
3 Correct 366 ms 16760 KB Output is correct
4 Correct 365 ms 16928 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 42 ms 2440 KB Output is correct
7 Correct 40 ms 2408 KB Output is correct
8 Correct 36 ms 2472 KB Output is correct
9 Correct 36 ms 2512 KB Output is correct
10 Correct 39 ms 2504 KB Output is correct
11 Correct 37 ms 2512 KB Output is correct
12 Correct 40 ms 2512 KB Output is correct
13 Correct 39 ms 2424 KB Output is correct
14 Correct 38 ms 2512 KB Output is correct
15 Correct 42 ms 2444 KB Output is correct
16 Correct 43 ms 2376 KB Output is correct
17 Correct 40 ms 2492 KB Output is correct
18 Correct 377 ms 16832 KB Output is correct
19 Correct 371 ms 16756 KB Output is correct
20 Correct 405 ms 16816 KB Output is correct
21 Correct 39 ms 2420 KB Output is correct
22 Correct 35 ms 2512 KB Output is correct
23 Correct 115 ms 8636 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 39 ms 2504 KB Output is correct
3 Correct 38 ms 2504 KB Output is correct
4 Correct 429 ms 16864 KB Output is correct
5 Correct 38 ms 2476 KB Output is correct
6 Correct 38 ms 2512 KB Output is correct
7 Correct 41 ms 2512 KB Output is correct
8 Correct 41 ms 2460 KB Output is correct
9 Correct 39 ms 2416 KB Output is correct
10 Correct 48 ms 2512 KB Output is correct
11 Correct 38 ms 2504 KB Output is correct
12 Correct 34 ms 2436 KB Output is correct
13 Correct 39 ms 2500 KB Output is correct
14 Correct 410 ms 16816 KB Output is correct
15 Correct 40 ms 2400 KB Output is correct
16 Correct 396 ms 16860 KB Output is correct
17 Correct 360 ms 16824 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 600 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 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 4 ms 600 KB Output is correct
17 Correct 41 ms 2416 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 0 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -