oj.uz

Submission #1117168

# Submission time Handle Problem Language Result Execution time Memory
1117168 2024-11-22T21:22:58 Z PagodePaiva Strange Device (APIO19_strange_device) C++17
70 / 100
 5000 ms 470816 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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 50 ms 94268 KB Output is correct
2 Correct 58 ms 95044 KB Output is correct
3 Correct 60 ms 95300 KB Output is correct
4 Correct 68 ms 94316 KB Output is correct
5 Correct 71 ms 94280 KB Output is correct
6 Correct 84 ms 94148 KB Output is correct
7 Correct 68 ms 94404 KB Output is correct
8 Correct 68 ms 94280 KB Output is correct
9 Correct 67 ms 94336 KB Output is correct
10 Correct 66 ms 94184 KB Output is correct
11 Correct 66 ms 94280 KB Output is correct
12 Correct 66 ms 94320 KB Output is correct
13 Correct 68 ms 94280 KB Output is correct
14 Correct 56 ms 94300 KB Output is correct
15 Correct 52 ms 94332 KB Output is correct
16 Correct 62 ms 95068 KB Output is correct
17 Correct 130 ms 102132 KB Output is correct
18 Correct 74 ms 94288 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 94176 KB Output is correct
2 Correct 76 ms 94348 KB Output is correct
3 Correct 71 ms 94228 KB Output is correct
4 Correct 70 ms 94280 KB Output is correct
5 Correct 65 ms 94280 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 94268 KB Output is correct
2 Correct 72 ms 94536 KB Output is correct
3 Correct 61 ms 94432 KB Output is correct
4 Correct 64 ms 94536 KB Output is correct
5 Correct 320 ms 134444 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 94292 KB Output is correct
2 Correct 707 ms 211752 KB Output is correct
3 Correct 611 ms 173296 KB Output is correct
4 Correct 562 ms 172604 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 94292 KB Output is correct
2 Correct 707 ms 211752 KB Output is correct
3 Correct 611 ms 173296 KB Output is correct
4 Correct 562 ms 172604 KB Output is correct
5 Correct 65 ms 94280 KB Output is correct
6 Correct 2037 ms 345436 KB Output is correct
7 Correct 662 ms 184956 KB Output is correct
8 Correct 1981 ms 347072 KB Output is correct
9 Correct 2146 ms 345644 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 94292 KB Output is correct
2 Correct 707 ms 211752 KB Output is correct
3 Correct 611 ms 173296 KB Output is correct
4 Correct 562 ms 172604 KB Output is correct
5 Correct 68 ms 94280 KB Output is correct
6 Correct 129 ms 112052 KB Output is correct
7 Correct 193 ms 121272 KB Output is correct
8 Correct 206 ms 121272 KB Output is correct
9 Correct 206 ms 121284 KB Output is correct
10 Correct 143 ms 110776 KB Output is correct
11 Correct 214 ms 121272 KB Output is correct
12 Correct 204 ms 121272 KB Output is correct
13 Correct 217 ms 119804 KB Output is correct
14 Correct 146 ms 112308 KB Output is correct
15 Correct 229 ms 113928 KB Output is correct
16 Correct 189 ms 112576 KB Output is correct
17 Correct 385 ms 131816 KB Output is correct
18 Correct 3368 ms 367136 KB Output is correct
19 Correct 3509 ms 352476 KB Output is correct
20 Correct 3032 ms 352692 KB Output is correct
21 Correct 240 ms 119992 KB Output is correct
22 Correct 211 ms 119996 KB Output is correct
23 Correct 163 ms 111944 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 94280 KB Output is correct
2 Correct 182 ms 112312 KB Output is correct
3 Correct 221 ms 112564 KB Output is correct
4 Correct 3960 ms 321880 KB Output is correct
5 Correct 240 ms 113364 KB Output is correct
6 Correct 217 ms 113160 KB Output is correct
7 Correct 222 ms 113148 KB Output is correct
8 Correct 257 ms 114868 KB Output is correct
9 Correct 272 ms 114788 KB Output is correct
10 Correct 188 ms 112308 KB Output is correct
11 Correct 164 ms 112192 KB Output is correct
12 Correct 204 ms 112300 KB Output is correct
13 Correct 260 ms 112940 KB Output is correct
14 Correct 1661 ms 211800 KB Output is correct
15 Correct 151 ms 104880 KB Output is correct
16 Correct 1917 ms 274304 KB Output is correct
17 Correct 1160 ms 198512 KB Output is correct
18 Correct 72 ms 94280 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 94268 KB Output is correct
2 Correct 58 ms 95044 KB Output is correct
3 Correct 60 ms 95300 KB Output is correct
4 Correct 68 ms 94316 KB Output is correct
5 Correct 71 ms 94280 KB Output is correct
6 Correct 84 ms 94148 KB Output is correct
7 Correct 68 ms 94404 KB Output is correct
8 Correct 68 ms 94280 KB Output is correct
9 Correct 67 ms 94336 KB Output is correct
10 Correct 66 ms 94184 KB Output is correct
11 Correct 66 ms 94280 KB Output is correct
12 Correct 66 ms 94320 KB Output is correct
13 Correct 68 ms 94280 KB Output is correct
14 Correct 56 ms 94300 KB Output is correct
15 Correct 52 ms 94332 KB Output is correct
16 Correct 62 ms 95068 KB Output is correct
17 Correct 130 ms 102132 KB Output is correct
18 Correct 74 ms 94288 KB Output is correct
19 Correct 59 ms 94176 KB Output is correct
20 Correct 76 ms 94348 KB Output is correct
21 Correct 71 ms 94228 KB Output is correct
22 Correct 70 ms 94280 KB Output is correct
23 Correct 65 ms 94280 KB Output is correct
24 Correct 64 ms 94268 KB Output is correct
25 Correct 72 ms 94536 KB Output is correct
26 Correct 61 ms 94432 KB Output is correct
27 Correct 64 ms 94536 KB Output is correct
28 Correct 320 ms 134444 KB Output is correct
29 Correct 59 ms 94292 KB Output is correct
30 Correct 707 ms 211752 KB Output is correct
31 Correct 611 ms 173296 KB Output is correct
32 Correct 562 ms 172604 KB Output is correct
33 Correct 65 ms 94280 KB Output is correct
34 Correct 2037 ms 345436 KB Output is correct
35 Correct 662 ms 184956 KB Output is correct
36 Correct 1981 ms 347072 KB Output is correct
37 Correct 2146 ms 345644 KB Output is correct
38 Correct 68 ms 94280 KB Output is correct
39 Correct 129 ms 112052 KB Output is correct
40 Correct 193 ms 121272 KB Output is correct
41 Correct 206 ms 121272 KB Output is correct
42 Correct 206 ms 121284 KB Output is correct
43 Correct 143 ms 110776 KB Output is correct
44 Correct 214 ms 121272 KB Output is correct
45 Correct 204 ms 121272 KB Output is correct
46 Correct 217 ms 119804 KB Output is correct
47 Correct 146 ms 112308 KB Output is correct
48 Correct 229 ms 113928 KB Output is correct
49 Correct 189 ms 112576 KB Output is correct
50 Correct 385 ms 131816 KB Output is correct
51 Correct 3368 ms 367136 KB Output is correct
52 Correct 3509 ms 352476 KB Output is correct
53 Correct 3032 ms 352692 KB Output is correct
54 Correct 240 ms 119992 KB Output is correct
55 Correct 211 ms 119996 KB Output is correct
56 Correct 163 ms 111944 KB Output is correct
57 Correct 58 ms 94280 KB Output is correct
58 Correct 182 ms 112312 KB Output is correct
59 Correct 221 ms 112564 KB Output is correct
60 Correct 3960 ms 321880 KB Output is correct
61 Correct 240 ms 113364 KB Output is correct
62 Correct 217 ms 113160 KB Output is correct
63 Correct 222 ms 113148 KB Output is correct
64 Correct 257 ms 114868 KB Output is correct
65 Correct 272 ms 114788 KB Output is correct
66 Correct 188 ms 112308 KB Output is correct
67 Correct 164 ms 112192 KB Output is correct
68 Correct 204 ms 112300 KB Output is correct
69 Correct 260 ms 112940 KB Output is correct
70 Correct 1661 ms 211800 KB Output is correct
71 Correct 151 ms 104880 KB Output is correct
72 Correct 1917 ms 274304 KB Output is correct
73 Correct 1160 ms 198512 KB Output is correct
74 Correct 72 ms 94280 KB Output is correct
75 Correct 66 ms 94272 KB Output is correct
76 Correct 63 ms 94384 KB Output is correct
77 Correct 78 ms 94280 KB Output is correct
78 Correct 74 ms 94280 KB Output is correct
79 Correct 79 ms 95772 KB Output is correct
80 Correct 1712 ms 176528 KB Output is correct
81 Correct 3993 ms 323324 KB Output is correct
82 Correct 4251 ms 372864 KB Output is correct
83 Execution timed out 5090 ms 470816 KB Time limit exceeded
84 Halted 0 ms 0 KB -