oj.uz

답안 #527656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527656 2022-02-17T22:32:15 Z Olympia 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 2175 ms 64108 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) {
        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 () {
    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';
}

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 1 ms 204 KB Output is correct
2 Correct 16 ms 1100 KB Output is correct
3 Correct 17 ms 1052 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 204 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 1 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 208 KB Output is correct
16 Correct 16 ms 1112 KB Output is correct
17 Correct 191 ms 6900 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 950 ms 692 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1859 ms 63272 KB Output is correct
3 Correct 1926 ms 63260 KB Output is correct
4 Correct 2094 ms 63284 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1859 ms 63272 KB Output is correct
3 Correct 1926 ms 63260 KB Output is correct
4 Correct 2094 ms 63284 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1896 ms 63244 KB Output is correct
7 Correct 1998 ms 63240 KB Output is correct
8 Correct 1921 ms 63244 KB Output is correct
9 Correct 2144 ms 63288 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1859 ms 63272 KB Output is correct
3 Correct 1926 ms 63260 KB Output is correct
4 Correct 2094 ms 63284 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 188 ms 7476 KB Output is correct
7 Correct 175 ms 7424 KB Output is correct
8 Correct 176 ms 7472 KB Output is correct
9 Correct 191 ms 7496 KB Output is correct
10 Correct 168 ms 7496 KB Output is correct
11 Correct 215 ms 7472 KB Output is correct
12 Correct 220 ms 7428 KB Output is correct
13 Correct 220 ms 7548 KB Output is correct
14 Correct 203 ms 7496 KB Output is correct
15 Correct 207 ms 7544 KB Output is correct
16 Correct 203 ms 7576 KB Output is correct
17 Correct 210 ms 7632 KB Output is correct
18 Correct 1830 ms 63896 KB Output is correct
19 Correct 1928 ms 63812 KB Output is correct
20 Correct 2037 ms 63860 KB Output is correct
21 Correct 166 ms 7296 KB Output is correct
22 Correct 182 ms 7364 KB Output is correct
23 Correct 438 ms 1160 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 190 ms 7460 KB Output is correct
3 Correct 199 ms 7488 KB Output is correct
4 Correct 2000 ms 63900 KB Output is correct
5 Correct 213 ms 7364 KB Output is correct
6 Correct 196 ms 7332 KB Output is correct
7 Correct 192 ms 7348 KB Output is correct
8 Correct 187 ms 7312 KB Output is correct
9 Correct 221 ms 7528 KB Output is correct
10 Correct 166 ms 7392 KB Output is correct
11 Correct 177 ms 7304 KB Output is correct
12 Correct 175 ms 7380 KB Output is correct
13 Correct 189 ms 7400 KB Output is correct
14 Correct 2140 ms 64108 KB Output is correct
15 Correct 168 ms 6716 KB Output is correct
16 Correct 1840 ms 63456 KB Output is correct
17 Correct 1814 ms 63532 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 16 ms 1100 KB Output is correct
3 Correct 17 ms 1052 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 204 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 1 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 208 KB Output is correct
16 Correct 16 ms 1112 KB Output is correct
17 Correct 191 ms 6900 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 950 ms 692 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1859 ms 63272 KB Output is correct
31 Correct 1926 ms 63260 KB Output is correct
32 Correct 2094 ms 63284 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1896 ms 63244 KB Output is correct
35 Correct 1998 ms 63240 KB Output is correct
36 Correct 1921 ms 63244 KB Output is correct
37 Correct 2144 ms 63288 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 188 ms 7476 KB Output is correct
40 Correct 175 ms 7424 KB Output is correct
41 Correct 176 ms 7472 KB Output is correct
42 Correct 191 ms 7496 KB Output is correct
43 Correct 168 ms 7496 KB Output is correct
44 Correct 215 ms 7472 KB Output is correct
45 Correct 220 ms 7428 KB Output is correct
46 Correct 220 ms 7548 KB Output is correct
47 Correct 203 ms 7496 KB Output is correct
48 Correct 207 ms 7544 KB Output is correct
49 Correct 203 ms 7576 KB Output is correct
50 Correct 210 ms 7632 KB Output is correct
51 Correct 1830 ms 63896 KB Output is correct
52 Correct 1928 ms 63812 KB Output is correct
53 Correct 2037 ms 63860 KB Output is correct
54 Correct 166 ms 7296 KB Output is correct
55 Correct 182 ms 7364 KB Output is correct
56 Correct 438 ms 1160 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 190 ms 7460 KB Output is correct
59 Correct 199 ms 7488 KB Output is correct
60 Correct 2000 ms 63900 KB Output is correct
61 Correct 213 ms 7364 KB Output is correct
62 Correct 196 ms 7332 KB Output is correct
63 Correct 192 ms 7348 KB Output is correct
64 Correct 187 ms 7312 KB Output is correct
65 Correct 221 ms 7528 KB Output is correct
66 Correct 166 ms 7392 KB Output is correct
67 Correct 177 ms 7304 KB Output is correct
68 Correct 175 ms 7380 KB Output is correct
69 Correct 189 ms 7400 KB Output is correct
70 Correct 2140 ms 64108 KB Output is correct
71 Correct 168 ms 6716 KB Output is correct
72 Correct 1840 ms 63456 KB Output is correct
73 Correct 1814 ms 63532 KB Output is correct
74 Correct 1 ms 204 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 0 ms 292 KB Output is correct
77 Correct 0 ms 204 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 19 ms 1200 KB Output is correct
80 Correct 2037 ms 63580 KB Output is correct
81 Correct 2024 ms 63512 KB Output is correct
82 Correct 2155 ms 63528 KB Output is correct
83 Correct 2111 ms 63456 KB Output is correct
84 Correct 2175 ms 63288 KB Output is correct
85 Correct 1982 ms 62796 KB Output is correct
86 Correct 416 ms 264 KB Output is correct
87 Correct 1 ms 204 KB Output is correct