oj.uz

Submission #211470

# Submission time Handle Problem Language Result Execution time Memory
211470 2020-03-20T12:55:41 Z VEGAnn Strange Device (APIO19_strange_device) C++14
50 / 100
 5000 ms 33472 KB 
#include <bits/stdc++.h>
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define pll pair<ll, ll>
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
//typedef long long __int128;
vector<pll> vc;
vector<pll> seg;
int n;
ll A, B;

int main(){

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#else
    ios_base::sync_with_stdio(0); cin.tie(0);
#endif // _LOCAL

    cin >> n >> A >> B;

//    ll fi = 1;
//
//    while ((fi + fi / B) % A != 0 || fi % B != 0)
//        fi++;
//
//    cout << fi << '\n';

    ll fi = A;

    while (fi <= ll(1e18) && fi % (B + 1) > 0)
        fi += A;

    if (fi <= ll(1e18))
        fi -= fi / (B + 1);

//    cout << fi << '\n';

    seg.clear();

    for (int i = 0; i < n; i++){
        ll l, r; cin >> l >> r;

        if (r - l + 1 >= fi){
            seg.PB(MP(0, fi - 1));
            continue;
        }

        ll vl = ((l - 1) / fi) * fi + fi;

        if (vl > r){
            vl -= fi;
            seg.PB(MP(l - vl, r - vl));
        } else {
            vl -= fi;
            seg.PB(MP(l - vl, fi - 1));
            vl += fi;
            seg.PB(MP(0ll, r - vl));
        }
    }

    sort(all(seg));

    ll lst = -1, ans = 0;

    for (pll cr : seg)
        if (cr.ft > lst){
            ans += cr.sd - cr.ft + 1ll;
            lst = cr.sd;
        } else {

            ans += max(lst, cr.sd) - lst;
            lst = max(lst, cr.sd);
        }

    cout << ans << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 10 ms 1152 KB Output is correct
17 Correct 59 ms 5740 KB Output is correct
18 Correct 4 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 656 ms 376 KB Output is correct
3 Correct 660 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 430 ms 33472 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 492 ms 16852 KB Output is correct
3 Correct 508 ms 17236 KB Output is correct
4 Correct 503 ms 17236 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 492 ms 16852 KB Output is correct
3 Correct 508 ms 17236 KB Output is correct
4 Correct 503 ms 17236 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 493 ms 17240 KB Output is correct
7 Correct 506 ms 17112 KB Output is correct
8 Correct 506 ms 17236 KB Output is correct
9 Correct 540 ms 17092 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 492 ms 16852 KB Output is correct
3 Correct 508 ms 17236 KB Output is correct
4 Correct 503 ms 17236 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 51 ms 2800 KB Output is correct
7 Correct 56 ms 2808 KB Output is correct
8 Correct 52 ms 2808 KB Output is correct
9 Correct 55 ms 2800 KB Output is correct
10 Correct 54 ms 2804 KB Output is correct
11 Correct 55 ms 2800 KB Output is correct
12 Correct 52 ms 2800 KB Output is correct
13 Correct 57 ms 2796 KB Output is correct
14 Correct 57 ms 2800 KB Output is correct
15 Correct 58 ms 2804 KB Output is correct
16 Correct 66 ms 2800 KB Output is correct
17 Correct 68 ms 2928 KB Output is correct
18 Correct 519 ms 17236 KB Output is correct
19 Correct 504 ms 17232 KB Output is correct
20 Correct 556 ms 17236 KB Output is correct
21 Correct 58 ms 2800 KB Output is correct
22 Correct 51 ms 2808 KB Output is correct
23 Correct 182 ms 17492 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 58 ms 2544 KB Output is correct
3 Correct 82 ms 2800 KB Output is correct
4 Correct 595 ms 16932 KB Output is correct
5 Execution timed out 5071 ms 384 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 10 ms 1152 KB Output is correct
17 Correct 59 ms 5740 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 656 ms 376 KB Output is correct
21 Correct 660 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 7 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 430 ms 33472 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 492 ms 16852 KB Output is correct
31 Correct 508 ms 17236 KB Output is correct
32 Correct 503 ms 17236 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 493 ms 17240 KB Output is correct
35 Correct 506 ms 17112 KB Output is correct
36 Correct 506 ms 17236 KB Output is correct
37 Correct 540 ms 17092 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 51 ms 2800 KB Output is correct
40 Correct 56 ms 2808 KB Output is correct
41 Correct 52 ms 2808 KB Output is correct
42 Correct 55 ms 2800 KB Output is correct
43 Correct 54 ms 2804 KB Output is correct
44 Correct 55 ms 2800 KB Output is correct
45 Correct 52 ms 2800 KB Output is correct
46 Correct 57 ms 2796 KB Output is correct
47 Correct 57 ms 2800 KB Output is correct
48 Correct 58 ms 2804 KB Output is correct
49 Correct 66 ms 2800 KB Output is correct
50 Correct 68 ms 2928 KB Output is correct
51 Correct 519 ms 17236 KB Output is correct
52 Correct 504 ms 17232 KB Output is correct
53 Correct 556 ms 17236 KB Output is correct
54 Correct 58 ms 2800 KB Output is correct
55 Correct 51 ms 2808 KB Output is correct
56 Correct 182 ms 17492 KB Output is correct
57 Correct 4 ms 384 KB Output is correct
58 Correct 58 ms 2544 KB Output is correct
59 Correct 82 ms 2800 KB Output is correct
60 Correct 595 ms 16932 KB Output is correct
61 Execution timed out 5071 ms 384 KB Time limit exceeded
62 Halted 0 ms 0 KB -