oj.uz

답안 #211471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211471 2020-03-20T12:58:28 Z VEGAnn 이상한 기계 (APIO19_strange_device) C++14
50 / 100
 5000 ms 33472 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#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> 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 5 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 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 4 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 5 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 896 KB Output is correct
17 Correct 61 ms 2676 KB Output is correct
18 Correct 4 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 655 ms 376 KB Output is correct
3 Correct 657 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 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 417 ms 33472 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 494 ms 16856 KB Output is correct
3 Correct 485 ms 16980 KB Output is correct
4 Correct 474 ms 16980 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 494 ms 16856 KB Output is correct
3 Correct 485 ms 16980 KB Output is correct
4 Correct 474 ms 16980 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 488 ms 17508 KB Output is correct
7 Correct 500 ms 16976 KB Output is correct
8 Correct 478 ms 16980 KB Output is correct
9 Correct 534 ms 16880 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 494 ms 16856 KB Output is correct
3 Correct 485 ms 16980 KB Output is correct
4 Correct 474 ms 16980 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 52 ms 2672 KB Output is correct
7 Correct 56 ms 2672 KB Output is correct
8 Correct 50 ms 2672 KB Output is correct
9 Correct 55 ms 2672 KB Output is correct
10 Correct 52 ms 2672 KB Output is correct
11 Correct 53 ms 2672 KB Output is correct
12 Correct 51 ms 2672 KB Output is correct
13 Correct 55 ms 2680 KB Output is correct
14 Correct 57 ms 2672 KB Output is correct
15 Correct 56 ms 2672 KB Output is correct
16 Correct 65 ms 2672 KB Output is correct
17 Correct 65 ms 2672 KB Output is correct
18 Correct 510 ms 16980 KB Output is correct
19 Correct 475 ms 16980 KB Output is correct
20 Correct 536 ms 16984 KB Output is correct
21 Correct 63 ms 2668 KB Output is correct
22 Correct 52 ms 2632 KB Output is correct
23 Correct 185 ms 16980 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 57 ms 2544 KB Output is correct
3 Correct 85 ms 2648 KB Output is correct
4 Correct 586 ms 16948 KB Output is correct
5 Execution timed out 5094 ms 384 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 9 ms 768 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 5 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 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 4 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 5 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 896 KB Output is correct
17 Correct 61 ms 2676 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 655 ms 376 KB Output is correct
21 Correct 657 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 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 417 ms 33472 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 494 ms 16856 KB Output is correct
31 Correct 485 ms 16980 KB Output is correct
32 Correct 474 ms 16980 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 488 ms 17508 KB Output is correct
35 Correct 500 ms 16976 KB Output is correct
36 Correct 478 ms 16980 KB Output is correct
37 Correct 534 ms 16880 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 52 ms 2672 KB Output is correct
40 Correct 56 ms 2672 KB Output is correct
41 Correct 50 ms 2672 KB Output is correct
42 Correct 55 ms 2672 KB Output is correct
43 Correct 52 ms 2672 KB Output is correct
44 Correct 53 ms 2672 KB Output is correct
45 Correct 51 ms 2672 KB Output is correct
46 Correct 55 ms 2680 KB Output is correct
47 Correct 57 ms 2672 KB Output is correct
48 Correct 56 ms 2672 KB Output is correct
49 Correct 65 ms 2672 KB Output is correct
50 Correct 65 ms 2672 KB Output is correct
51 Correct 510 ms 16980 KB Output is correct
52 Correct 475 ms 16980 KB Output is correct
53 Correct 536 ms 16984 KB Output is correct
54 Correct 63 ms 2668 KB Output is correct
55 Correct 52 ms 2632 KB Output is correct
56 Correct 185 ms 16980 KB Output is correct
57 Correct 4 ms 384 KB Output is correct
58 Correct 57 ms 2544 KB Output is correct
59 Correct 85 ms 2648 KB Output is correct
60 Correct 586 ms 16948 KB Output is correct
61 Execution timed out 5094 ms 384 KB Time limit exceeded
62 Halted 0 ms 0 KB -