oj.uz

Submission #1117166

# Submission time Handle Problem Language Result Execution time Memory
1117166 2024-11-22T21:21:43 Z PagodePaiva Strange Device (APIO19_strange_device) C++17
70 / 100
 5000 ms 470068 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N = 4000010;
long long res = 0;
int n;
long long A, B;
vector <pair <int, int>> opp[N];

long long gdc(long long x, long long y){
    if(x < y) swap(x, y);
    return (y == 0 ? x : gdc(y, x%y));
}

void corrigir(vector <pair <int, int>> &v){
    vector <pair <int, int>> aux;
    for(auto [l, r] : v){
        if(r-l+1 >= A) {
            aux.push_back({0, A-1});
            continue;
        }
        l %= A;
        r %= A;
        if(l <= r) aux.push_back({l, r});
        else{
            aux.push_back({l, A-1});
            aux.push_back({0,r});
        }
    }
    v = aux;
    sort(v.begin(), v.end());
    aux.clear();
    for(auto [l, r] : v){
        //cout << l << ' ' << r << '\n';
        if(!aux.empty()){
            auto [a, b] = aux.back();
            if(b < l) aux.push_back({l, r});
            else{
                aux.pop_back();
                aux.push_back({a, max(b, r)});
            }
        }
        else{
            aux.push_back({l, r});
        }
    }
    v = aux;
    return;
}

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n >> A >> B;
    A = A/gdc(A, B+1);
    vector <pair <int, int>> queries;
    vector <array <int, 3>> corners;
    for(int i = 1;i <= n;i++){
        int l, r;
        cin >> l >> r;
        if(r-l+1 <= B and r%B >= l%B){
            int d = r/B;
            corners.push_back({l%B, r%B, (d%A)});
            continue;
        }
        if(l%B != 0){
            int d = (l+B-1)/B;
            corners.push_back({l%B, B-1, ((d-1)%A+A)%A});
        }
        int a = (l+B-1)/B;
        int b = r/B;
        if(r%B == B-1){
            queries.push_back({a, b});
            continue;
        }
        if(B*a <= B*b-1){
            queries.push_back({a, b-1});
        }
        if(r%B != B-1){
            corners.push_back({0, r%B, b%A});
        }
    }
    corrigir(queries);
    //set <int> s;
    map <int, int> m;
    map <int ,int> cnt;
    int add = 0;
    //cout << "cte:\n";
    for(auto [l, r] : queries){
        //cout << l << ' ' << r << '\n';
        m[l] = r;
        add += r-l+1;
        //s.insert(l);
    }
    //cout << '\n';
    set <int> valores;
    for(auto [l, r, w] : corners){
        //cout << l << ' ' << r << ' ' << w << '\n';
        valores.insert(l);
        valores.insert(r+1);
    }
    map <int, int> mapear;
    int con = 0;
    for(auto x : valores){
        mapear[x] = con;
        con++;
    }
    mapear[B] = con;
    con++;
    for(auto [l, r, w] : corners){
        opp[mapear[l]].push_back({w, 0});
        opp[mapear[r+1]].push_back({w, 1});
    }
    int st = 0;
    for(auto [pos, valor] : mapear){
        res += (pos-st)*add;
        st = pos;
        for(auto [x, tp] : opp[valor]){
            if(tp == 0){
                auto it = m.upper_bound(x);
                if(it != m.begin()){
                    it--;
                    auto [_, p] = *it;
                    if(p >= x) continue;
                }
                if(cnt[x] == 0) add++;
                cnt[x]++;
            }
            else{
                auto it = cnt.find(x);
                if(it == cnt.end()) continue;
                auto [_, d] = *it;
                if(d == 1){
                    cnt.erase(it);
                    add--;
                    continue;
                }
                cnt[x]--;
            }   
        }
        //cout << add << '\n';
    }
    cout << res << '\n';
    return 0;
}

/*
10 7 1
3 5
8 11
26 33
40 52
65 69
83 95
113 123
135 136
154 166
182 185
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 94280 KB Output is correct
2 Correct 79 ms 95508 KB Output is correct
3 Correct 65 ms 95532 KB Output is correct
4 Correct 73 ms 94380 KB Output is correct
5 Correct 77 ms 94280 KB Output is correct
6 Correct 75 ms 94328 KB Output is correct
7 Correct 75 ms 94280 KB Output is correct
8 Correct 75 ms 94280 KB Output is correct
9 Correct 73 ms 94280 KB Output is correct
10 Correct 83 ms 94192 KB Output is correct
11 Correct 82 ms 94180 KB Output is correct
12 Correct 72 ms 94144 KB Output is correct
13 Correct 74 ms 94280 KB Output is correct
14 Correct 71 ms 94364 KB Output is correct
15 Correct 83 ms 94280 KB Output is correct
16 Correct 72 ms 95204 KB Output is correct
17 Correct 126 ms 102036 KB Output is correct
18 Correct 80 ms 94280 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 94172 KB Output is correct
2 Correct 69 ms 94196 KB Output is correct
3 Correct 70 ms 94280 KB Output is correct
4 Correct 84 ms 94280 KB Output is correct
5 Correct 92 ms 94284 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 94336 KB Output is correct
2 Correct 92 ms 94564 KB Output is correct
3 Correct 69 ms 94536 KB Output is correct
4 Correct 71 ms 94536 KB Output is correct
5 Correct 314 ms 134656 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 94280 KB Output is correct
2 Correct 772 ms 225552 KB Output is correct
3 Correct 552 ms 172484 KB Output is correct
4 Correct 597 ms 172484 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 94280 KB Output is correct
2 Correct 772 ms 225552 KB Output is correct
3 Correct 552 ms 172484 KB Output is correct
4 Correct 597 ms 172484 KB Output is correct
5 Correct 76 ms 94280 KB Output is correct
6 Correct 2056 ms 345568 KB Output is correct
7 Correct 688 ms 184972 KB Output is correct
8 Correct 2067 ms 345508 KB Output is correct
9 Correct 2039 ms 349652 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 94280 KB Output is correct
2 Correct 772 ms 225552 KB Output is correct
3 Correct 552 ms 172484 KB Output is correct
4 Correct 597 ms 172484 KB Output is correct
5 Correct 53 ms 94280 KB Output is correct
6 Correct 133 ms 112064 KB Output is correct
7 Correct 204 ms 121272 KB Output is correct
8 Correct 204 ms 121272 KB Output is correct
9 Correct 211 ms 121772 KB Output is correct
10 Correct 151 ms 112060 KB Output is correct
11 Correct 200 ms 121272 KB Output is correct
12 Correct 193 ms 121528 KB Output is correct
13 Correct 211 ms 119864 KB Output is correct
14 Correct 147 ms 112288 KB Output is correct
15 Correct 232 ms 113856 KB Output is correct
16 Correct 204 ms 112576 KB Output is correct
17 Correct 425 ms 131996 KB Output is correct
18 Correct 3188 ms 376948 KB Output is correct
19 Correct 3320 ms 371144 KB Output is correct
20 Correct 3418 ms 371228 KB Output is correct
21 Correct 220 ms 122028 KB Output is correct
22 Correct 213 ms 122020 KB Output is correct
23 Correct 148 ms 118696 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 94280 KB Output is correct
2 Correct 172 ms 112320 KB Output is correct
3 Correct 234 ms 113676 KB Output is correct
4 Correct 3968 ms 333172 KB Output is correct
5 Correct 234 ms 115380 KB Output is correct
6 Correct 219 ms 115360 KB Output is correct
7 Correct 205 ms 115264 KB Output is correct
8 Correct 236 ms 116732 KB Output is correct
9 Correct 248 ms 116916 KB Output is correct
10 Correct 196 ms 114336 KB Output is correct
11 Correct 165 ms 114356 KB Output is correct
12 Correct 202 ms 114360 KB Output is correct
13 Correct 239 ms 115044 KB Output is correct
14 Correct 1662 ms 230508 KB Output is correct
15 Correct 161 ms 106936 KB Output is correct
16 Correct 2053 ms 293036 KB Output is correct
17 Correct 1008 ms 217376 KB Output is correct
18 Correct 59 ms 94280 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 94280 KB Output is correct
2 Correct 79 ms 95508 KB Output is correct
3 Correct 65 ms 95532 KB Output is correct
4 Correct 73 ms 94380 KB Output is correct
5 Correct 77 ms 94280 KB Output is correct
6 Correct 75 ms 94328 KB Output is correct
7 Correct 75 ms 94280 KB Output is correct
8 Correct 75 ms 94280 KB Output is correct
9 Correct 73 ms 94280 KB Output is correct
10 Correct 83 ms 94192 KB Output is correct
11 Correct 82 ms 94180 KB Output is correct
12 Correct 72 ms 94144 KB Output is correct
13 Correct 74 ms 94280 KB Output is correct
14 Correct 71 ms 94364 KB Output is correct
15 Correct 83 ms 94280 KB Output is correct
16 Correct 72 ms 95204 KB Output is correct
17 Correct 126 ms 102036 KB Output is correct
18 Correct 80 ms 94280 KB Output is correct
19 Correct 75 ms 94172 KB Output is correct
20 Correct 69 ms 94196 KB Output is correct
21 Correct 70 ms 94280 KB Output is correct
22 Correct 84 ms 94280 KB Output is correct
23 Correct 92 ms 94284 KB Output is correct
24 Correct 76 ms 94336 KB Output is correct
25 Correct 92 ms 94564 KB Output is correct
26 Correct 69 ms 94536 KB Output is correct
27 Correct 71 ms 94536 KB Output is correct
28 Correct 314 ms 134656 KB Output is correct
29 Correct 66 ms 94280 KB Output is correct
30 Correct 772 ms 225552 KB Output is correct
31 Correct 552 ms 172484 KB Output is correct
32 Correct 597 ms 172484 KB Output is correct
33 Correct 76 ms 94280 KB Output is correct
34 Correct 2056 ms 345568 KB Output is correct
35 Correct 688 ms 184972 KB Output is correct
36 Correct 2067 ms 345508 KB Output is correct
37 Correct 2039 ms 349652 KB Output is correct
38 Correct 53 ms 94280 KB Output is correct
39 Correct 133 ms 112064 KB Output is correct
40 Correct 204 ms 121272 KB Output is correct
41 Correct 204 ms 121272 KB Output is correct
42 Correct 211 ms 121772 KB Output is correct
43 Correct 151 ms 112060 KB Output is correct
44 Correct 200 ms 121272 KB Output is correct
45 Correct 193 ms 121528 KB Output is correct
46 Correct 211 ms 119864 KB Output is correct
47 Correct 147 ms 112288 KB Output is correct
48 Correct 232 ms 113856 KB Output is correct
49 Correct 204 ms 112576 KB Output is correct
50 Correct 425 ms 131996 KB Output is correct
51 Correct 3188 ms 376948 KB Output is correct
52 Correct 3320 ms 371144 KB Output is correct
53 Correct 3418 ms 371228 KB Output is correct
54 Correct 220 ms 122028 KB Output is correct
55 Correct 213 ms 122020 KB Output is correct
56 Correct 148 ms 118696 KB Output is correct
57 Correct 53 ms 94280 KB Output is correct
58 Correct 172 ms 112320 KB Output is correct
59 Correct 234 ms 113676 KB Output is correct
60 Correct 3968 ms 333172 KB Output is correct
61 Correct 234 ms 115380 KB Output is correct
62 Correct 219 ms 115360 KB Output is correct
63 Correct 205 ms 115264 KB Output is correct
64 Correct 236 ms 116732 KB Output is correct
65 Correct 248 ms 116916 KB Output is correct
66 Correct 196 ms 114336 KB Output is correct
67 Correct 165 ms 114356 KB Output is correct
68 Correct 202 ms 114360 KB Output is correct
69 Correct 239 ms 115044 KB Output is correct
70 Correct 1662 ms 230508 KB Output is correct
71 Correct 161 ms 106936 KB Output is correct
72 Correct 2053 ms 293036 KB Output is correct
73 Correct 1008 ms 217376 KB Output is correct
74 Correct 59 ms 94280 KB Output is correct
75 Correct 59 ms 94280 KB Output is correct
76 Correct 60 ms 94280 KB Output is correct
77 Correct 61 ms 94148 KB Output is correct
78 Correct 63 ms 94172 KB Output is correct
79 Correct 66 ms 96080 KB Output is correct
80 Correct 1592 ms 195392 KB Output is correct
81 Correct 4038 ms 322132 KB Output is correct
82 Correct 4203 ms 372868 KB Output is correct
83 Execution timed out 5077 ms 470068 KB Time limit exceeded
84 Halted 0 ms 0 KB -