oj.uz

Submission #1117158

# Submission time Handle Problem Language Result Execution time Memory
1117158 2024-11-22T21:18:01 Z PagodePaiva Strange Device (APIO19_strange_device) C++17
70 / 100
 5000 ms 506912 KB 
#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{
                if(cnt[x] == 0) continue;
                cnt[x]--;
                if(cnt[x] == 0){
                    add--;
                }
            }   
        }
        //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 43 ms 94288 KB Output is correct
2 Correct 52 ms 95444 KB Output is correct
3 Correct 48 ms 95572 KB Output is correct
4 Correct 43 ms 94216 KB Output is correct
5 Correct 47 ms 94276 KB Output is correct
6 Correct 42 ms 94288 KB Output is correct
7 Correct 48 ms 94224 KB Output is correct
8 Correct 45 ms 94164 KB Output is correct
9 Correct 59 ms 94304 KB Output is correct
10 Correct 48 ms 94292 KB Output is correct
11 Correct 49 ms 94280 KB Output is correct
12 Correct 51 ms 94376 KB Output is correct
13 Correct 51 ms 94280 KB Output is correct
14 Correct 50 ms 94300 KB Output is correct
15 Correct 44 ms 94224 KB Output is correct
16 Correct 52 ms 95048 KB Output is correct
17 Correct 93 ms 102076 KB Output is correct
18 Correct 49 ms 94292 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 94284 KB Output is correct
2 Correct 57 ms 94328 KB Output is correct
3 Correct 52 ms 94280 KB Output is correct
4 Correct 53 ms 94280 KB Output is correct
5 Correct 60 ms 94280 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94288 KB Output is correct
2 Correct 49 ms 94608 KB Output is correct
3 Correct 50 ms 94536 KB Output is correct
4 Correct 51 ms 94552 KB Output is correct
5 Correct 308 ms 134644 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94288 KB Output is correct
2 Correct 865 ms 230176 KB Output is correct
3 Correct 598 ms 172576 KB Output is correct
4 Correct 611 ms 173176 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94288 KB Output is correct
2 Correct 865 ms 230176 KB Output is correct
3 Correct 598 ms 172576 KB Output is correct
4 Correct 611 ms 173176 KB Output is correct
5 Correct 50 ms 94280 KB Output is correct
6 Correct 2225 ms 345432 KB Output is correct
7 Correct 721 ms 184956 KB Output is correct
8 Correct 2216 ms 345632 KB Output is correct
9 Correct 2125 ms 345568 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94288 KB Output is correct
2 Correct 865 ms 230176 KB Output is correct
3 Correct 598 ms 172576 KB Output is correct
4 Correct 611 ms 173176 KB Output is correct
5 Correct 42 ms 94288 KB Output is correct
6 Correct 143 ms 111996 KB Output is correct
7 Correct 258 ms 121452 KB Output is correct
8 Correct 254 ms 121276 KB Output is correct
9 Correct 264 ms 121272 KB Output is correct
10 Correct 169 ms 112840 KB Output is correct
11 Correct 238 ms 121268 KB Output is correct
12 Correct 241 ms 121276 KB Output is correct
13 Correct 244 ms 119740 KB Output is correct
14 Correct 143 ms 112308 KB Output is correct
15 Correct 275 ms 114056 KB Output is correct
16 Correct 194 ms 112580 KB Output is correct
17 Correct 409 ms 131816 KB Output is correct
18 Correct 3758 ms 367328 KB Output is correct
19 Correct 3922 ms 371268 KB Output is correct
20 Correct 4053 ms 352704 KB Output is correct
21 Correct 252 ms 119992 KB Output is correct
22 Correct 248 ms 119992 KB Output is correct
23 Correct 161 ms 114352 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94368 KB Output is correct
2 Correct 165 ms 112292 KB Output is correct
3 Correct 235 ms 112600 KB Output is correct
4 Correct 3909 ms 336264 KB Output is correct
5 Correct 268 ms 115228 KB Output is correct
6 Correct 233 ms 115332 KB Output is correct
7 Correct 273 ms 113332 KB Output is correct
8 Correct 254 ms 116916 KB Output is correct
9 Correct 279 ms 114868 KB Output is correct
10 Correct 167 ms 112316 KB Output is correct
11 Correct 154 ms 114356 KB Output is correct
12 Correct 169 ms 112308 KB Output is correct
13 Correct 259 ms 115120 KB Output is correct
14 Correct 1686 ms 211832 KB Output is correct
15 Correct 140 ms 104888 KB Output is correct
16 Correct 1721 ms 274428 KB Output is correct
17 Correct 1291 ms 202096 KB Output is correct
18 Correct 54 ms 94280 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94288 KB Output is correct
2 Correct 52 ms 95444 KB Output is correct
3 Correct 48 ms 95572 KB Output is correct
4 Correct 43 ms 94216 KB Output is correct
5 Correct 47 ms 94276 KB Output is correct
6 Correct 42 ms 94288 KB Output is correct
7 Correct 48 ms 94224 KB Output is correct
8 Correct 45 ms 94164 KB Output is correct
9 Correct 59 ms 94304 KB Output is correct
10 Correct 48 ms 94292 KB Output is correct
11 Correct 49 ms 94280 KB Output is correct
12 Correct 51 ms 94376 KB Output is correct
13 Correct 51 ms 94280 KB Output is correct
14 Correct 50 ms 94300 KB Output is correct
15 Correct 44 ms 94224 KB Output is correct
16 Correct 52 ms 95048 KB Output is correct
17 Correct 93 ms 102076 KB Output is correct
18 Correct 49 ms 94292 KB Output is correct
19 Correct 47 ms 94284 KB Output is correct
20 Correct 57 ms 94328 KB Output is correct
21 Correct 52 ms 94280 KB Output is correct
22 Correct 53 ms 94280 KB Output is correct
23 Correct 60 ms 94280 KB Output is correct
24 Correct 48 ms 94288 KB Output is correct
25 Correct 49 ms 94608 KB Output is correct
26 Correct 50 ms 94536 KB Output is correct
27 Correct 51 ms 94552 KB Output is correct
28 Correct 308 ms 134644 KB Output is correct
29 Correct 46 ms 94288 KB Output is correct
30 Correct 865 ms 230176 KB Output is correct
31 Correct 598 ms 172576 KB Output is correct
32 Correct 611 ms 173176 KB Output is correct
33 Correct 50 ms 94280 KB Output is correct
34 Correct 2225 ms 345432 KB Output is correct
35 Correct 721 ms 184956 KB Output is correct
36 Correct 2216 ms 345632 KB Output is correct
37 Correct 2125 ms 345568 KB Output is correct
38 Correct 42 ms 94288 KB Output is correct
39 Correct 143 ms 111996 KB Output is correct
40 Correct 258 ms 121452 KB Output is correct
41 Correct 254 ms 121276 KB Output is correct
42 Correct 264 ms 121272 KB Output is correct
43 Correct 169 ms 112840 KB Output is correct
44 Correct 238 ms 121268 KB Output is correct
45 Correct 241 ms 121276 KB Output is correct
46 Correct 244 ms 119740 KB Output is correct
47 Correct 143 ms 112308 KB Output is correct
48 Correct 275 ms 114056 KB Output is correct
49 Correct 194 ms 112580 KB Output is correct
50 Correct 409 ms 131816 KB Output is correct
51 Correct 3758 ms 367328 KB Output is correct
52 Correct 3922 ms 371268 KB Output is correct
53 Correct 4053 ms 352704 KB Output is correct
54 Correct 252 ms 119992 KB Output is correct
55 Correct 248 ms 119992 KB Output is correct
56 Correct 161 ms 114352 KB Output is correct
57 Correct 54 ms 94368 KB Output is correct
58 Correct 165 ms 112292 KB Output is correct
59 Correct 235 ms 112600 KB Output is correct
60 Correct 3909 ms 336264 KB Output is correct
61 Correct 268 ms 115228 KB Output is correct
62 Correct 233 ms 115332 KB Output is correct
63 Correct 273 ms 113332 KB Output is correct
64 Correct 254 ms 116916 KB Output is correct
65 Correct 279 ms 114868 KB Output is correct
66 Correct 167 ms 112316 KB Output is correct
67 Correct 154 ms 114356 KB Output is correct
68 Correct 169 ms 112308 KB Output is correct
69 Correct 259 ms 115120 KB Output is correct
70 Correct 1686 ms 211832 KB Output is correct
71 Correct 140 ms 104888 KB Output is correct
72 Correct 1721 ms 274428 KB Output is correct
73 Correct 1291 ms 202096 KB Output is correct
74 Correct 54 ms 94280 KB Output is correct
75 Correct 51 ms 94152 KB Output is correct
76 Correct 51 ms 94280 KB Output is correct
77 Correct 51 ms 94240 KB Output is correct
78 Correct 53 ms 94288 KB Output is correct
79 Correct 66 ms 95848 KB Output is correct
80 Correct 1593 ms 176640 KB Output is correct
81 Correct 3978 ms 321912 KB Output is correct
82 Correct 4980 ms 372908 KB Output is correct
83 Execution timed out 5079 ms 506912 KB Time limit exceeded
84 Halted 0 ms 0 KB -