Submission #663096

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
663096	2022-11-26T15:41:39 Z	Ai7081	Strange Device (APIO19_strange_device)	C++17	65 / 100	509 ms	16868 KB

strange_device

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, ll>

const ll inf = 1e18+1;

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

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

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> a >> b;
    a/=gcd(a,b+1);
    double dloop=(double)a*double(b);
    loop = (dloop>1e18 ? 1e18+1 : (ll)dloop);
    while (n--) {
        cin >> l >> r, l%=loop, r%=loop;
        if (l>r) v.push_back({0,r}), v.push_back({l,loop-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	724 KB	Output is correct
3	Correct	5 ms	600 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 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	0 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	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	5 ms	600 KB	Output is correct
17	Correct	41 ms	2468 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	438 ms	16828 KB	Output is correct
3	Correct	388 ms	16856 KB	Output is correct
4	Correct	397 ms	16852 KB	Output is correct

Subtask #5
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	438 ms	16828 KB	Output is correct
3	Correct	388 ms	16856 KB	Output is correct
4	Correct	397 ms	16852 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	412 ms	16784 KB	Output is correct
7	Correct	454 ms	16808 KB	Output is correct
8	Correct	421 ms	16824 KB	Output is correct
9	Correct	454 ms	16848 KB	Output is correct

Subtask #6
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	438 ms	16828 KB	Output is correct
3	Correct	388 ms	16856 KB	Output is correct
4	Correct	397 ms	16852 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	52 ms	2444 KB	Output is correct
7	Correct	46 ms	2448 KB	Output is correct
8	Correct	52 ms	2448 KB	Output is correct
9	Correct	48 ms	2440 KB	Output is correct
10	Correct	44 ms	2492 KB	Output is correct
11	Correct	39 ms	2512 KB	Output is correct
12	Correct	45 ms	2440 KB	Output is correct
13	Correct	41 ms	2504 KB	Output is correct
14	Correct	40 ms	2512 KB	Output is correct
15	Correct	55 ms	2444 KB	Output is correct
16	Correct	59 ms	2484 KB	Output is correct
17	Correct	41 ms	2412 KB	Output is correct
18	Correct	446 ms	16760 KB	Output is correct
19	Correct	509 ms	16820 KB	Output is correct
20	Correct	494 ms	16836 KB	Output is correct
21	Correct	43 ms	2512 KB	Output is correct
22	Correct	54 ms	2500 KB	Output is correct
23	Correct	138 ms	8608 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	57 ms	2420 KB	Output is correct
3	Correct	47 ms	2456 KB	Output is correct
4	Correct	464 ms	16852 KB	Output is correct
5	Correct	52 ms	2504 KB	Output is correct
6	Correct	44 ms	2480 KB	Output is correct
7	Correct	42 ms	2512 KB	Output is correct
8	Correct	42 ms	2500 KB	Output is correct
9	Correct	39 ms	2512 KB	Output is correct
10	Correct	43 ms	2444 KB	Output is correct
11	Correct	47 ms	2428 KB	Output is correct
12	Correct	46 ms	2500 KB	Output is correct
13	Correct	44 ms	2512 KB	Output is correct
14	Correct	457 ms	16856 KB	Output is correct
15	Correct	43 ms	2460 KB	Output is correct
16	Correct	406 ms	16832 KB	Output is correct
17	Correct	396 ms	16832 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	724 KB	Output is correct
3	Correct	5 ms	600 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 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	0 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	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	5 ms	600 KB	Output is correct
17	Correct	41 ms	2468 KB	Output is correct
18	Correct	1 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	-

Submission #663096

Compilation message