oj.uz

답안 #527658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527658 2022-02-17T22:35:07 Z Olympia 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 1285 ms 63004 KB 
#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>

using namespace std;
class Intervals {
public:
    set<pair<int64_t,int64_t>> intervals;
    void print () {
        for (auto& p: intervals) {
            cout << p.first << " " << p.second << '\n';
        }
        cout << '\n';
    }
    pair<int64_t,int64_t> leftIntersect (pair<int64_t,int64_t> &p) {
        auto it = intervals.upper_bound({p.first + 1, -1});
        if (it == intervals.begin()) {
            return {-1, -1};
        }
        it--;
        pair<int64_t,int64_t> q = *it;
        if (q.second < p.first) {
            return {-1, -1};
        }
        return q;
    }
    pair<int64_t,int64_t> rightIntersect (pair<int64_t,int64_t> p) {
        auto it = intervals.upper_bound({p.second + 1, -1});
        if (it == intervals.begin()) {
            return {-1, -1};
        }
        it--;
        pair<int64_t,int64_t> q = *it;
        if (q.first > p.second || q.first < p.first) {
            return {-1, -1};
        }
        return q;
    }
    bool willChange (pair<int64_t,int64_t> p) {
        pair<int64_t,int64_t> q = leftIntersect(p);
        if (q.first < 0 && q.second < 0) {
            return true;
        }
        if (q.first <= p.first && q.second >= p.second) {
            return false;
        }
        return true;
    }
    pair<int64_t,int64_t> update_left (pair<int64_t,int64_t> p) {
        pair<int64_t,int64_t> q = leftIntersect(p);
        if (q.first == -1 && q.second == -1) {
            return p;
        }
        if (q.second < p.first) {
            return p;
        }
        intervals.erase(q);
        return {q.first, p.second};
    }
    pair<int64_t,int64_t> update_right (pair<int64_t,int64_t> p) {
        pair<int64_t,int64_t> q = rightIntersect(p);
        if (q.first == -1 && q.second == -1) {
            return p;
        }
        if (q.first > p.second) {
            return p;
        }
        intervals.erase(q);
        return {p.first, q.second};
    }
    void erase_in_between (pair<int64_t,int64_t> p) {
        auto it = intervals.lower_bound({p.first, -1});
        set<pair<int64_t,int64_t>> to_erase;
        while (it != intervals.end()) {
            if ((*it).second < p.second) {
                to_erase.insert(*it);
            } else {
                break;
            }
            it++;
        }
        for (auto& q: to_erase) {
            intervals.erase(q);
        }
    }
    void add_interval (pair<int64_t,int64_t> p) {
        if (!willChange(p)) {
            return;
        }
        erase_in_between(p);
        pair<int64_t,int64_t> new_p1 = update_right(update_left(p));
        intervals.insert(new_p1);
    }
};
int64_t gcd (int64_t a, int64_t b) {
    if (!a || !b) return max(a,b);
    return gcd(max(a,b) % min(a,b), min(a,b));
}
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N;
    int64_t A, B;
    cin >> N >> A >> B;
    A /= gcd(A, B + 1);
    int64_t prod;
    if (A < 1e18/B) {
        prod = A * B;
    } else {
        prod = 1e18;
    }
    Intervals myInterval;
    for (int i = 0; i < N; i++) {
        int64_t x, y;
        cin >> x >> y;
        if (abs(y - x) >= prod) {
            myInterval.add_interval({0, prod - 1});
            continue;
        }
        x %= (prod), y %= (prod);
        if (x <= y) {
            myInterval.add_interval({x, y});
        } else {
            swap(x, y);
            myInterval.add_interval({0, x});
            myInterval.add_interval({y, prod - 1});
        }
    }
    int64_t ans = 0;
    for (auto& p: myInterval.intervals) {
        ans += p.second - p.first + 1;
    }
    cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 8 ms 844 KB Output is correct
3 Correct 8 ms 836 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 772 KB Output is correct
17 Correct 97 ms 6468 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 253 ms 296 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1048 ms 62876 KB Output is correct
3 Correct 1045 ms 62984 KB Output is correct
4 Correct 1216 ms 62868 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1048 ms 62876 KB Output is correct
3 Correct 1045 ms 62984 KB Output is correct
4 Correct 1216 ms 62868 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 999 ms 62864 KB Output is correct
7 Correct 1103 ms 62992 KB Output is correct
8 Correct 1020 ms 62828 KB Output is correct
9 Correct 1233 ms 62876 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1048 ms 62876 KB Output is correct
3 Correct 1045 ms 62984 KB Output is correct
4 Correct 1216 ms 62868 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 78 ms 6496 KB Output is correct
7 Correct 72 ms 6504 KB Output is correct
8 Correct 75 ms 6480 KB Output is correct
9 Correct 96 ms 6548 KB Output is correct
10 Correct 84 ms 6488 KB Output is correct
11 Correct 75 ms 6420 KB Output is correct
12 Correct 122 ms 6664 KB Output is correct
13 Correct 96 ms 6472 KB Output is correct
14 Correct 76 ms 6440 KB Output is correct
15 Correct 106 ms 6468 KB Output is correct
16 Correct 106 ms 6552 KB Output is correct
17 Correct 97 ms 6516 KB Output is correct
18 Correct 952 ms 62848 KB Output is correct
19 Correct 1082 ms 62932 KB Output is correct
20 Correct 1170 ms 62844 KB Output is correct
21 Correct 80 ms 6444 KB Output is correct
22 Correct 95 ms 6436 KB Output is correct
23 Correct 143 ms 292 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 105 ms 6396 KB Output is correct
3 Correct 108 ms 6560 KB Output is correct
4 Correct 1109 ms 62804 KB Output is correct
5 Correct 107 ms 6660 KB Output is correct
6 Correct 104 ms 6448 KB Output is correct
7 Correct 117 ms 6476 KB Output is correct
8 Correct 103 ms 6468 KB Output is correct
9 Correct 96 ms 6512 KB Output is correct
10 Correct 84 ms 6432 KB Output is correct
11 Correct 100 ms 6536 KB Output is correct
12 Correct 90 ms 6468 KB Output is correct
13 Correct 100 ms 6488 KB Output is correct
14 Correct 1219 ms 62884 KB Output is correct
15 Correct 67 ms 5828 KB Output is correct
16 Correct 1014 ms 62860 KB Output is correct
17 Correct 974 ms 63004 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 8 ms 844 KB Output is correct
3 Correct 8 ms 836 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 772 KB Output is correct
17 Correct 97 ms 6468 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 253 ms 296 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1048 ms 62876 KB Output is correct
31 Correct 1045 ms 62984 KB Output is correct
32 Correct 1216 ms 62868 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 999 ms 62864 KB Output is correct
35 Correct 1103 ms 62992 KB Output is correct
36 Correct 1020 ms 62828 KB Output is correct
37 Correct 1233 ms 62876 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 78 ms 6496 KB Output is correct
40 Correct 72 ms 6504 KB Output is correct
41 Correct 75 ms 6480 KB Output is correct
42 Correct 96 ms 6548 KB Output is correct
43 Correct 84 ms 6488 KB Output is correct
44 Correct 75 ms 6420 KB Output is correct
45 Correct 122 ms 6664 KB Output is correct
46 Correct 96 ms 6472 KB Output is correct
47 Correct 76 ms 6440 KB Output is correct
48 Correct 106 ms 6468 KB Output is correct
49 Correct 106 ms 6552 KB Output is correct
50 Correct 97 ms 6516 KB Output is correct
51 Correct 952 ms 62848 KB Output is correct
52 Correct 1082 ms 62932 KB Output is correct
53 Correct 1170 ms 62844 KB Output is correct
54 Correct 80 ms 6444 KB Output is correct
55 Correct 95 ms 6436 KB Output is correct
56 Correct 143 ms 292 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 105 ms 6396 KB Output is correct
59 Correct 108 ms 6560 KB Output is correct
60 Correct 1109 ms 62804 KB Output is correct
61 Correct 107 ms 6660 KB Output is correct
62 Correct 104 ms 6448 KB Output is correct
63 Correct 117 ms 6476 KB Output is correct
64 Correct 103 ms 6468 KB Output is correct
65 Correct 96 ms 6512 KB Output is correct
66 Correct 84 ms 6432 KB Output is correct
67 Correct 100 ms 6536 KB Output is correct
68 Correct 90 ms 6468 KB Output is correct
69 Correct 100 ms 6488 KB Output is correct
70 Correct 1219 ms 62884 KB Output is correct
71 Correct 67 ms 5828 KB Output is correct
72 Correct 1014 ms 62860 KB Output is correct
73 Correct 974 ms 63004 KB Output is correct
74 Correct 0 ms 204 KB Output is correct
75 Correct 0 ms 204 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 0 ms 204 KB Output is correct
79 Correct 7 ms 844 KB Output is correct
80 Correct 1125 ms 62976 KB Output is correct
81 Correct 1131 ms 62996 KB Output is correct
82 Correct 1250 ms 62920 KB Output is correct
83 Correct 1285 ms 62848 KB Output is correct
84 Correct 1256 ms 62892 KB Output is correct
85 Correct 1129 ms 62960 KB Output is correct
86 Correct 111 ms 204 KB Output is correct
87 Correct 0 ms 204 KB Output is correct