oj.uz

Submission #1117144

# Submission time Handle Problem Language Result Execution time Memory
1117144 2024-11-22T21:06:03 Z PagodePaiva Strange Device (APIO19_strange_device) C++17
30 / 100
 5000 ms 524288 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});
        }
    }
    set <pair <int, int>> intervalos;
    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});
    }
    set <int> novos;
    int st = 0;
    for(auto [pos, valor] : mapear){
        res += (pos-st)*add;
        st = pos;
        for(auto [x, tp] : opp[valor]){
            //cout << pos << ' ' << tp << ' ' << x << '\n';
            if(tp == 0){
                auto it = s.upper_bound(x);
                if(it != s.begin()){
                    it--;
                    int p = *it;
                    if(m[p] >= x) continue;
                }
                if(cnt[x] == 0) add++;
                novos.insert(x);
                cnt[x]++;
                m[x] = x;
            }
            else{
                if(cnt[x] == 0) continue;
                cnt[x]--;
                if(cnt[x] == 0){
                    add--;
                    novos.erase(x);
                    m.erase(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 36 ms 94288 KB Output is correct
2 Correct 45 ms 95580 KB Output is correct
3 Correct 48 ms 95592 KB Output is correct
4 Correct 40 ms 94280 KB Output is correct
5 Correct 42 ms 94216 KB Output is correct
6 Correct 49 ms 94288 KB Output is correct
7 Correct 46 ms 94200 KB Output is correct
8 Correct 47 ms 94288 KB Output is correct
9 Correct 47 ms 94312 KB Output is correct
10 Correct 51 ms 94304 KB Output is correct
11 Correct 52 ms 94312 KB Output is correct
12 Correct 54 ms 94312 KB Output is correct
13 Correct 53 ms 94164 KB Output is correct
14 Correct 66 ms 94284 KB Output is correct
15 Correct 54 ms 94356 KB Output is correct
16 Correct 67 ms 95580 KB Output is correct
17 Correct 119 ms 105928 KB Output is correct
18 Correct 49 ms 94248 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94192 KB Output is correct
2 Correct 54 ms 94280 KB Output is correct
3 Correct 54 ms 94304 KB Output is correct
4 Correct 52 ms 94280 KB Output is correct
5 Correct 50 ms 94288 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 94288 KB Output is correct
2 Correct 54 ms 94780 KB Output is correct
3 Correct 54 ms 94500 KB Output is correct
4 Correct 57 ms 94536 KB Output is correct
5 Correct 318 ms 159656 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94288 KB Output is correct
2 Correct 1416 ms 348876 KB Output is correct
3 Correct 818 ms 238184 KB Output is correct
4 Correct 780 ms 238276 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94288 KB Output is correct
2 Correct 1416 ms 348876 KB Output is correct
3 Correct 818 ms 238184 KB Output is correct
4 Correct 780 ms 238276 KB Output is correct
5 Correct 56 ms 94280 KB Output is correct
6 Correct 3722 ms 516892 KB Output is correct
7 Correct 1191 ms 209532 KB Output is correct
8 Correct 3891 ms 516888 KB Output is correct
9 Correct 3765 ms 517268 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94288 KB Output is correct
2 Correct 1416 ms 348876 KB Output is correct
3 Correct 818 ms 238184 KB Output is correct
4 Correct 780 ms 238276 KB Output is correct
5 Correct 42 ms 94288 KB Output is correct
6 Correct 213 ms 122800 KB Output is correct
7 Correct 340 ms 136896 KB Output is correct
8 Correct 366 ms 137052 KB Output is correct
9 Correct 374 ms 136976 KB Output is correct
10 Correct 260 ms 118712 KB Output is correct
11 Correct 422 ms 137088 KB Output is correct
12 Correct 340 ms 139160 KB Output is correct
13 Correct 325 ms 135608 KB Output is correct
14 Correct 156 ms 112308 KB Output is correct
15 Correct 379 ms 126640 KB Output is correct
16 Correct 239 ms 116416 KB Output is correct
17 Correct 571 ms 151144 KB Output is correct
18 Execution timed out 5057 ms 524288 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94280 KB Output is correct
2 Correct 184 ms 112312 KB Output is correct
3 Correct 265 ms 116412 KB Output is correct
4 Execution timed out 5040 ms 374876 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 94288 KB Output is correct
2 Correct 45 ms 95580 KB Output is correct
3 Correct 48 ms 95592 KB Output is correct
4 Correct 40 ms 94280 KB Output is correct
5 Correct 42 ms 94216 KB Output is correct
6 Correct 49 ms 94288 KB Output is correct
7 Correct 46 ms 94200 KB Output is correct
8 Correct 47 ms 94288 KB Output is correct
9 Correct 47 ms 94312 KB Output is correct
10 Correct 51 ms 94304 KB Output is correct
11 Correct 52 ms 94312 KB Output is correct
12 Correct 54 ms 94312 KB Output is correct
13 Correct 53 ms 94164 KB Output is correct
14 Correct 66 ms 94284 KB Output is correct
15 Correct 54 ms 94356 KB Output is correct
16 Correct 67 ms 95580 KB Output is correct
17 Correct 119 ms 105928 KB Output is correct
18 Correct 49 ms 94248 KB Output is correct
19 Correct 54 ms 94192 KB Output is correct
20 Correct 54 ms 94280 KB Output is correct
21 Correct 54 ms 94304 KB Output is correct
22 Correct 52 ms 94280 KB Output is correct
23 Correct 50 ms 94288 KB Output is correct
24 Correct 52 ms 94288 KB Output is correct
25 Correct 54 ms 94780 KB Output is correct
26 Correct 54 ms 94500 KB Output is correct
27 Correct 57 ms 94536 KB Output is correct
28 Correct 318 ms 159656 KB Output is correct
29 Correct 54 ms 94288 KB Output is correct
30 Correct 1416 ms 348876 KB Output is correct
31 Correct 818 ms 238184 KB Output is correct
32 Correct 780 ms 238276 KB Output is correct
33 Correct 56 ms 94280 KB Output is correct
34 Correct 3722 ms 516892 KB Output is correct
35 Correct 1191 ms 209532 KB Output is correct
36 Correct 3891 ms 516888 KB Output is correct
37 Correct 3765 ms 517268 KB Output is correct
38 Correct 42 ms 94288 KB Output is correct
39 Correct 213 ms 122800 KB Output is correct
40 Correct 340 ms 136896 KB Output is correct
41 Correct 366 ms 137052 KB Output is correct
42 Correct 374 ms 136976 KB Output is correct
43 Correct 260 ms 118712 KB Output is correct
44 Correct 422 ms 137088 KB Output is correct
45 Correct 340 ms 139160 KB Output is correct
46 Correct 325 ms 135608 KB Output is correct
47 Correct 156 ms 112308 KB Output is correct
48 Correct 379 ms 126640 KB Output is correct
49 Correct 239 ms 116416 KB Output is correct
50 Correct 571 ms 151144 KB Output is correct
51 Execution timed out 5057 ms 524288 KB Time limit exceeded
52 Halted 0 ms 0 KB -