oj.uz

Submission #527657

# Submission time Handle Problem Language Result Execution time Memory
527657 2022-02-17T22:32:36 Z Olympia Strange Device (APIO19_strange_device) C++17
100 / 100
 2104 ms 63844 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;
        }
        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';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 18 ms 1220 KB Output is correct
3 Correct 18 ms 1208 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 0 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 1 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 17 ms 1168 KB Output is correct
17 Correct 214 ms 7428 KB Output is correct
18 Correct 1 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 2 ms 352 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 930 ms 1180 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1837 ms 63768 KB Output is correct
3 Correct 1914 ms 63844 KB Output is correct
4 Correct 2060 ms 63772 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1837 ms 63768 KB Output is correct
3 Correct 1914 ms 63844 KB Output is correct
4 Correct 2060 ms 63772 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1901 ms 63752 KB Output is correct
7 Correct 1936 ms 63772 KB Output is correct
8 Correct 1939 ms 63736 KB Output is correct
9 Correct 2104 ms 63444 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1837 ms 63768 KB Output is correct
3 Correct 1914 ms 63844 KB Output is correct
4 Correct 2060 ms 63772 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 166 ms 6480 KB Output is correct
7 Correct 158 ms 6468 KB Output is correct
8 Correct 165 ms 6520 KB Output is correct
9 Correct 177 ms 6428 KB Output is correct
10 Correct 165 ms 6444 KB Output is correct
11 Correct 159 ms 6456 KB Output is correct
12 Correct 178 ms 6520 KB Output is correct
13 Correct 196 ms 6444 KB Output is correct
14 Correct 169 ms 6360 KB Output is correct
15 Correct 212 ms 6476 KB Output is correct
16 Correct 194 ms 6508 KB Output is correct
17 Correct 176 ms 6528 KB Output is correct
18 Correct 1819 ms 62820 KB Output is correct
19 Correct 1981 ms 62880 KB Output is correct
20 Correct 2025 ms 62784 KB Output is correct
21 Correct 166 ms 6468 KB Output is correct
22 Correct 184 ms 6424 KB Output is correct
23 Correct 418 ms 268 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 185 ms 6428 KB Output is correct
3 Correct 208 ms 6520 KB Output is correct
4 Correct 2003 ms 62864 KB Output is correct
5 Correct 197 ms 6632 KB Output is correct
6 Correct 196 ms 6404 KB Output is correct
7 Correct 194 ms 6428 KB Output is correct
8 Correct 203 ms 6672 KB Output is correct
9 Correct 183 ms 6500 KB Output is correct
10 Correct 166 ms 6524 KB Output is correct
11 Correct 172 ms 6460 KB Output is correct
12 Correct 176 ms 6528 KB Output is correct
13 Correct 193 ms 6512 KB Output is correct
14 Correct 2096 ms 62956 KB Output is correct
15 Correct 162 ms 5776 KB Output is correct
16 Correct 1892 ms 62868 KB Output is correct
17 Correct 1841 ms 62864 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 18 ms 1220 KB Output is correct
3 Correct 18 ms 1208 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 0 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 1 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 17 ms 1168 KB Output is correct
17 Correct 214 ms 7428 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 2 ms 352 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 930 ms 1180 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1837 ms 63768 KB Output is correct
31 Correct 1914 ms 63844 KB Output is correct
32 Correct 2060 ms 63772 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1901 ms 63752 KB Output is correct
35 Correct 1936 ms 63772 KB Output is correct
36 Correct 1939 ms 63736 KB Output is correct
37 Correct 2104 ms 63444 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 166 ms 6480 KB Output is correct
40 Correct 158 ms 6468 KB Output is correct
41 Correct 165 ms 6520 KB Output is correct
42 Correct 177 ms 6428 KB Output is correct
43 Correct 165 ms 6444 KB Output is correct
44 Correct 159 ms 6456 KB Output is correct
45 Correct 178 ms 6520 KB Output is correct
46 Correct 196 ms 6444 KB Output is correct
47 Correct 169 ms 6360 KB Output is correct
48 Correct 212 ms 6476 KB Output is correct
49 Correct 194 ms 6508 KB Output is correct
50 Correct 176 ms 6528 KB Output is correct
51 Correct 1819 ms 62820 KB Output is correct
52 Correct 1981 ms 62880 KB Output is correct
53 Correct 2025 ms 62784 KB Output is correct
54 Correct 166 ms 6468 KB Output is correct
55 Correct 184 ms 6424 KB Output is correct
56 Correct 418 ms 268 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 185 ms 6428 KB Output is correct
59 Correct 208 ms 6520 KB Output is correct
60 Correct 2003 ms 62864 KB Output is correct
61 Correct 197 ms 6632 KB Output is correct
62 Correct 196 ms 6404 KB Output is correct
63 Correct 194 ms 6428 KB Output is correct
64 Correct 203 ms 6672 KB Output is correct
65 Correct 183 ms 6500 KB Output is correct
66 Correct 166 ms 6524 KB Output is correct
67 Correct 172 ms 6460 KB Output is correct
68 Correct 176 ms 6528 KB Output is correct
69 Correct 193 ms 6512 KB Output is correct
70 Correct 2096 ms 62956 KB Output is correct
71 Correct 162 ms 5776 KB Output is correct
72 Correct 1892 ms 62868 KB Output is correct
73 Correct 1841 ms 62864 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 0 ms 204 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 17 ms 880 KB Output is correct
80 Correct 1947 ms 62840 KB Output is correct
81 Correct 1903 ms 62904 KB Output is correct
82 Correct 2037 ms 62964 KB Output is correct
83 Correct 2001 ms 62908 KB Output is correct
84 Correct 2070 ms 62804 KB Output is correct
85 Correct 1918 ms 62884 KB Output is correct
86 Correct 408 ms 280 KB Output is correct
87 Correct 0 ms 204 KB Output is correct