oj.uz

Submission #527654

# Submission time Handle Problem Language Result Execution time Memory
527654 2022-02-17T22:30:36 Z Olympia Strange Device (APIO19_strange_device) C++17
100 / 100
 2108 ms 63188 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) {
            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;
        }
        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) {
        pair<int64_t,int64_t> q = rightIntersect(p);
        if (q.first == -1 && q.second == -1) {
            return p;
        }
        if (q.first > p.second) {
            return p;
        }
        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) {
        if (!willChange(p)) {
            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) {
            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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 17 ms 844 KB Output is correct
3 Correct 17 ms 784 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 1 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 0 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 0 ms 204 KB Output is correct
16 Correct 17 ms 792 KB Output is correct
17 Correct 184 ms 6516 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 906 ms 304 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1876 ms 63112 KB Output is correct
3 Correct 2029 ms 63188 KB Output is correct
4 Correct 2077 ms 62832 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1876 ms 63112 KB Output is correct
3 Correct 2029 ms 63188 KB Output is correct
4 Correct 2077 ms 62832 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1854 ms 63064 KB Output is correct
7 Correct 1954 ms 63036 KB Output is correct
8 Correct 1800 ms 62912 KB Output is correct
9 Correct 2013 ms 62996 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1876 ms 63112 KB Output is correct
3 Correct 2029 ms 63188 KB Output is correct
4 Correct 2077 ms 62832 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 201 ms 6492 KB Output is correct
7 Correct 166 ms 6440 KB Output is correct
8 Correct 168 ms 6460 KB Output is correct
9 Correct 178 ms 6468 KB Output is correct
10 Correct 161 ms 6536 KB Output is correct
11 Correct 160 ms 6468 KB Output is correct
12 Correct 166 ms 6528 KB Output is correct
13 Correct 178 ms 6476 KB Output is correct
14 Correct 163 ms 6404 KB Output is correct
15 Correct 194 ms 6444 KB Output is correct
16 Correct 185 ms 6468 KB Output is correct
17 Correct 175 ms 6412 KB Output is correct
18 Correct 1780 ms 62892 KB Output is correct
19 Correct 1895 ms 62980 KB Output is correct
20 Correct 1963 ms 62900 KB Output is correct
21 Correct 167 ms 6432 KB Output is correct
22 Correct 171 ms 6444 KB Output is correct
23 Correct 402 ms 276 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 183 ms 6412 KB Output is correct
3 Correct 191 ms 6452 KB Output is correct
4 Correct 1896 ms 62972 KB Output is correct
5 Correct 188 ms 6480 KB Output is correct
6 Correct 197 ms 6540 KB Output is correct
7 Correct 193 ms 6412 KB Output is correct
8 Correct 182 ms 6448 KB Output is correct
9 Correct 196 ms 6468 KB Output is correct
10 Correct 164 ms 6512 KB Output is correct
11 Correct 172 ms 6524 KB Output is correct
12 Correct 169 ms 6496 KB Output is correct
13 Correct 194 ms 6652 KB Output is correct
14 Correct 2029 ms 62928 KB Output is correct
15 Correct 153 ms 5832 KB Output is correct
16 Correct 1757 ms 62836 KB Output is correct
17 Correct 1753 ms 62852 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 17 ms 844 KB Output is correct
3 Correct 17 ms 784 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 1 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 0 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 0 ms 204 KB Output is correct
16 Correct 17 ms 792 KB Output is correct
17 Correct 184 ms 6516 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 2 ms 204 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 906 ms 304 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1876 ms 63112 KB Output is correct
31 Correct 2029 ms 63188 KB Output is correct
32 Correct 2077 ms 62832 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1854 ms 63064 KB Output is correct
35 Correct 1954 ms 63036 KB Output is correct
36 Correct 1800 ms 62912 KB Output is correct
37 Correct 2013 ms 62996 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 201 ms 6492 KB Output is correct
40 Correct 166 ms 6440 KB Output is correct
41 Correct 168 ms 6460 KB Output is correct
42 Correct 178 ms 6468 KB Output is correct
43 Correct 161 ms 6536 KB Output is correct
44 Correct 160 ms 6468 KB Output is correct
45 Correct 166 ms 6528 KB Output is correct
46 Correct 178 ms 6476 KB Output is correct
47 Correct 163 ms 6404 KB Output is correct
48 Correct 194 ms 6444 KB Output is correct
49 Correct 185 ms 6468 KB Output is correct
50 Correct 175 ms 6412 KB Output is correct
51 Correct 1780 ms 62892 KB Output is correct
52 Correct 1895 ms 62980 KB Output is correct
53 Correct 1963 ms 62900 KB Output is correct
54 Correct 167 ms 6432 KB Output is correct
55 Correct 171 ms 6444 KB Output is correct
56 Correct 402 ms 276 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 183 ms 6412 KB Output is correct
59 Correct 191 ms 6452 KB Output is correct
60 Correct 1896 ms 62972 KB Output is correct
61 Correct 188 ms 6480 KB Output is correct
62 Correct 197 ms 6540 KB Output is correct
63 Correct 193 ms 6412 KB Output is correct
64 Correct 182 ms 6448 KB Output is correct
65 Correct 196 ms 6468 KB Output is correct
66 Correct 164 ms 6512 KB Output is correct
67 Correct 172 ms 6524 KB Output is correct
68 Correct 169 ms 6496 KB Output is correct
69 Correct 194 ms 6652 KB Output is correct
70 Correct 2029 ms 62928 KB Output is correct
71 Correct 153 ms 5832 KB Output is correct
72 Correct 1757 ms 62836 KB Output is correct
73 Correct 1753 ms 62852 KB Output is correct
74 Correct 1 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 16 ms 916 KB Output is correct
80 Correct 1948 ms 62804 KB Output is correct
81 Correct 1938 ms 62876 KB Output is correct
82 Correct 2039 ms 62924 KB Output is correct
83 Correct 2007 ms 62900 KB Output is correct
84 Correct 2108 ms 62884 KB Output is correct
85 Correct 1926 ms 62808 KB Output is correct
86 Correct 405 ms 204 KB Output is correct
87 Correct 1 ms 204 KB Output is correct