oj.uz

답안 #527650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527650 2022-02-17T22:02:37 Z Olympia 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 2488 ms 70332 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>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
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) {
            return {-1, -1};
        }
        if (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) {
//        cout << "UPDATE LEFT " << p.first << " " << p.second << '\n';
        pair<int64_t,int64_t> q = leftIntersect(p);
        if (q.first == -1 && q.second == -1) {
            return p;
        }
        if (q.second < p.first) {
            return p;
        }
//        cout << "ERASE\n";
        if (intervals.count(q)) intervals.erase(q);
        return {q.first, p.second};
    }
    pair<int64_t,int64_t> update_right (pair<int64_t,int64_t> p) {
//        cout << "UPDATE RIGHT " << p.first << " " << p.second << '\n';
        pair<int64_t,int64_t> q = rightIntersect(p);
        if (q.first == -1 && q.second == -1) {
            return p;
        }
        if (q.first > p.second) {
            return p;
        }
//        cout << "ERASE " << q.first << " " << q.second << '\n';
//        cout << "ADD " << p.first << " " << q.second << '\n';
        if (intervals.count(q)) 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) {
//        cout << "ADD " << p.first << " " << p.second << '\n';
        if (!willChange(p)) { //if adding this interval will not change anything, then there is no point in adding this interval (i.e. if there is another interval which covers the given interval)
            return;
        }
        erase_in_between(p);
        pair<int64_t,int64_t> new_p = update_left(p);
        pair<int64_t,int64_t> new_p1 = update_right(new_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 () {
    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) {
            //cout << "T1\n";
            myInterval.add_interval({x, y});
        } else {
            //cout << "T2\n";
            swap(x, y);
            myInterval.add_interval({0, x});
            myInterval.add_interval({y, prod - 1});
        }
    }
//    myInterval.print();
    int64_t ans = 0;
    for (auto& p: myInterval.intervals) {
        ans += p.second - p.first + 1;
    }
    cout << ans << '\n';
}

Compilation message

strange_device.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   15 | #pragma GCC optimization ("O3")
      | 
strange_device.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("Ofast")
      | 
strange_device.cpp:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   17 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 16 ms 868 KB Output is correct
3 Correct 16 ms 844 KB Output is correct
4 Correct 0 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 1 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 16 ms 1196 KB Output is correct
17 Correct 179 ms 10156 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 216 KB Output is correct

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1778 ms 62784 KB Output is correct
3 Correct 2488 ms 62816 KB Output is correct
4 Correct 1998 ms 67256 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1778 ms 62784 KB Output is correct
3 Correct 2488 ms 62816 KB Output is correct
4 Correct 1998 ms 67256 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1815 ms 67416 KB Output is correct
7 Correct 1910 ms 67328 KB Output is correct
8 Correct 1830 ms 67408 KB Output is correct
9 Correct 2123 ms 67528 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1778 ms 62784 KB Output is correct
3 Correct 2488 ms 62816 KB Output is correct
4 Correct 1998 ms 67256 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 159 ms 10144 KB Output is correct
7 Correct 160 ms 10160 KB Output is correct
8 Correct 163 ms 10204 KB Output is correct
9 Correct 179 ms 10180 KB Output is correct
10 Correct 163 ms 10180 KB Output is correct
11 Correct 164 ms 10200 KB Output is correct
12 Correct 167 ms 10180 KB Output is correct
13 Correct 180 ms 10172 KB Output is correct
14 Correct 161 ms 10128 KB Output is correct
15 Correct 194 ms 10184 KB Output is correct
16 Correct 188 ms 10144 KB Output is correct
17 Correct 183 ms 10324 KB Output is correct
18 Correct 1788 ms 69020 KB Output is correct
19 Correct 1887 ms 69048 KB Output is correct
20 Correct 2035 ms 69164 KB Output is correct
21 Correct 172 ms 10152 KB Output is correct
22 Correct 194 ms 10136 KB Output is correct
23 Correct 407 ms 12796 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 181 ms 6500 KB Output is correct
3 Correct 188 ms 6624 KB Output is correct
4 Correct 1950 ms 63116 KB Output is correct
5 Correct 189 ms 6848 KB Output is correct
6 Correct 193 ms 6872 KB Output is correct
7 Correct 189 ms 6764 KB Output is correct
8 Correct 184 ms 6740 KB Output is correct
9 Correct 183 ms 6776 KB Output is correct
10 Correct 163 ms 6680 KB Output is correct
11 Correct 170 ms 6696 KB Output is correct
12 Correct 174 ms 6800 KB Output is correct
13 Correct 186 ms 6724 KB Output is correct
14 Correct 2068 ms 63392 KB Output is correct
15 Correct 155 ms 6048 KB Output is correct
16 Correct 1830 ms 69008 KB Output is correct
17 Correct 1795 ms 69788 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 16 ms 868 KB Output is correct
3 Correct 16 ms 844 KB Output is correct
4 Correct 0 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 1 ms 204 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 16 ms 1196 KB Output is correct
17 Correct 179 ms 10156 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 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 216 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 2 ms 204 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 859 ms 268 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1778 ms 62784 KB Output is correct
31 Correct 2488 ms 62816 KB Output is correct
32 Correct 1998 ms 67256 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1815 ms 67416 KB Output is correct
35 Correct 1910 ms 67328 KB Output is correct
36 Correct 1830 ms 67408 KB Output is correct
37 Correct 2123 ms 67528 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 159 ms 10144 KB Output is correct
40 Correct 160 ms 10160 KB Output is correct
41 Correct 163 ms 10204 KB Output is correct
42 Correct 179 ms 10180 KB Output is correct
43 Correct 163 ms 10180 KB Output is correct
44 Correct 164 ms 10200 KB Output is correct
45 Correct 167 ms 10180 KB Output is correct
46 Correct 180 ms 10172 KB Output is correct
47 Correct 161 ms 10128 KB Output is correct
48 Correct 194 ms 10184 KB Output is correct
49 Correct 188 ms 10144 KB Output is correct
50 Correct 183 ms 10324 KB Output is correct
51 Correct 1788 ms 69020 KB Output is correct
52 Correct 1887 ms 69048 KB Output is correct
53 Correct 2035 ms 69164 KB Output is correct
54 Correct 172 ms 10152 KB Output is correct
55 Correct 194 ms 10136 KB Output is correct
56 Correct 407 ms 12796 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 181 ms 6500 KB Output is correct
59 Correct 188 ms 6624 KB Output is correct
60 Correct 1950 ms 63116 KB Output is correct
61 Correct 189 ms 6848 KB Output is correct
62 Correct 193 ms 6872 KB Output is correct
63 Correct 189 ms 6764 KB Output is correct
64 Correct 184 ms 6740 KB Output is correct
65 Correct 183 ms 6776 KB Output is correct
66 Correct 163 ms 6680 KB Output is correct
67 Correct 170 ms 6696 KB Output is correct
68 Correct 174 ms 6800 KB Output is correct
69 Correct 186 ms 6724 KB Output is correct
70 Correct 2068 ms 63392 KB Output is correct
71 Correct 155 ms 6048 KB Output is correct
72 Correct 1830 ms 69008 KB Output is correct
73 Correct 1795 ms 69788 KB Output is correct
74 Correct 0 ms 204 KB Output is correct
75 Correct 0 ms 204 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 0 ms 288 KB Output is correct
79 Correct 16 ms 1188 KB Output is correct
80 Correct 2003 ms 69488 KB Output is correct
81 Correct 1925 ms 69528 KB Output is correct
82 Correct 2091 ms 70332 KB Output is correct
83 Correct 2084 ms 70224 KB Output is correct
84 Correct 2145 ms 70288 KB Output is correct
85 Correct 1931 ms 69924 KB Output is correct
86 Correct 413 ms 12792 KB Output is correct
87 Correct 1 ms 204 KB Output is correct