oj.uz

Submission #1117154

# Submission time Handle Problem Language Result Execution time Memory
1117154 2024-11-22T21:15:33 Z PagodePaiva Strange Device (APIO19_strange_device) C++17
70 / 100
 5000 ms 457072 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});
    }
    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 = s.upper_bound(x);
                if(it != s.begin()){
                    it--;
                    int p = *it;
                    if(m[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 94248 KB Output is correct
2 Correct 53 ms 95084 KB Output is correct
3 Correct 57 ms 95300 KB Output is correct
4 Correct 54 ms 94280 KB Output is correct
5 Correct 58 ms 94280 KB Output is correct
6 Correct 54 ms 94140 KB Output is correct
7 Correct 50 ms 94180 KB Output is correct
8 Correct 55 ms 94280 KB Output is correct
9 Correct 53 ms 94280 KB Output is correct
10 Correct 60 ms 94280 KB Output is correct
11 Correct 69 ms 94292 KB Output is correct
12 Correct 54 ms 94184 KB Output is correct
13 Correct 49 ms 94280 KB Output is correct
14 Correct 56 ms 94284 KB Output is correct
15 Correct 56 ms 94284 KB Output is correct
16 Correct 60 ms 94996 KB Output is correct
17 Correct 110 ms 101972 KB Output is correct
18 Correct 67 ms 94228 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94264 KB Output is correct
2 Correct 55 ms 94280 KB Output is correct
3 Correct 59 ms 94280 KB Output is correct
4 Correct 55 ms 94368 KB Output is correct
5 Correct 51 ms 94228 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 94288 KB Output is correct
2 Correct 54 ms 94532 KB Output is correct
3 Correct 50 ms 94536 KB Output is correct
4 Correct 53 ms 94540 KB Output is correct
5 Correct 313 ms 134544 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 94280 KB Output is correct
2 Correct 842 ms 211656 KB Output is correct
3 Correct 814 ms 219572 KB Output is correct
4 Correct 845 ms 219592 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 94280 KB Output is correct
2 Correct 842 ms 211656 KB Output is correct
3 Correct 814 ms 219572 KB Output is correct
4 Correct 845 ms 219592 KB Output is correct
5 Correct 51 ms 94240 KB Output is correct
6 Correct 2515 ms 393964 KB Output is correct
7 Correct 744 ms 184956 KB Output is correct
8 Correct 2529 ms 392568 KB Output is correct
9 Correct 2610 ms 392432 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 94280 KB Output is correct
2 Correct 842 ms 211656 KB Output is correct
3 Correct 814 ms 219572 KB Output is correct
4 Correct 845 ms 219592 KB Output is correct
5 Correct 55 ms 94280 KB Output is correct
6 Correct 150 ms 113600 KB Output is correct
7 Correct 278 ms 125880 KB Output is correct
8 Correct 292 ms 125908 KB Output is correct
9 Correct 274 ms 126132 KB Output is correct
10 Correct 156 ms 110764 KB Output is correct
11 Correct 329 ms 126032 KB Output is correct
12 Correct 283 ms 126036 KB Output is correct
13 Correct 266 ms 124612 KB Output is correct
14 Correct 160 ms 112360 KB Output is correct
15 Correct 268 ms 114264 KB Output is correct
16 Correct 198 ms 112608 KB Output is correct
17 Correct 488 ms 136464 KB Output is correct
18 Correct 4126 ms 414296 KB Output is correct
19 Correct 4933 ms 436772 KB Output is correct
20 Correct 4513 ms 436896 KB Output is correct
21 Correct 331 ms 128580 KB Output is correct
22 Correct 300 ms 128472 KB Output is correct
23 Correct 167 ms 124592 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 94280 KB Output is correct
2 Correct 163 ms 112308 KB Output is correct
3 Correct 226 ms 112564 KB Output is correct
4 Correct 4323 ms 321900 KB Output is correct
5 Correct 254 ms 116916 KB Output is correct
6 Correct 239 ms 116920 KB Output is correct
7 Correct 238 ms 117100 KB Output is correct
8 Correct 280 ms 118452 KB Output is correct
9 Correct 258 ms 118456 KB Output is correct
10 Correct 170 ms 116144 KB Output is correct
11 Correct 143 ms 116148 KB Output is correct
12 Correct 176 ms 116020 KB Output is correct
13 Correct 247 ms 116660 KB Output is correct
14 Correct 1870 ms 249096 KB Output is correct
15 Correct 148 ms 108724 KB Output is correct
16 Correct 1844 ms 311528 KB Output is correct
17 Correct 1338 ms 235816 KB Output is correct
18 Correct 54 ms 94240 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 94248 KB Output is correct
2 Correct 53 ms 95084 KB Output is correct
3 Correct 57 ms 95300 KB Output is correct
4 Correct 54 ms 94280 KB Output is correct
5 Correct 58 ms 94280 KB Output is correct
6 Correct 54 ms 94140 KB Output is correct
7 Correct 50 ms 94180 KB Output is correct
8 Correct 55 ms 94280 KB Output is correct
9 Correct 53 ms 94280 KB Output is correct
10 Correct 60 ms 94280 KB Output is correct
11 Correct 69 ms 94292 KB Output is correct
12 Correct 54 ms 94184 KB Output is correct
13 Correct 49 ms 94280 KB Output is correct
14 Correct 56 ms 94284 KB Output is correct
15 Correct 56 ms 94284 KB Output is correct
16 Correct 60 ms 94996 KB Output is correct
17 Correct 110 ms 101972 KB Output is correct
18 Correct 67 ms 94228 KB Output is correct
19 Correct 54 ms 94264 KB Output is correct
20 Correct 55 ms 94280 KB Output is correct
21 Correct 59 ms 94280 KB Output is correct
22 Correct 55 ms 94368 KB Output is correct
23 Correct 51 ms 94228 KB Output is correct
24 Correct 51 ms 94288 KB Output is correct
25 Correct 54 ms 94532 KB Output is correct
26 Correct 50 ms 94536 KB Output is correct
27 Correct 53 ms 94540 KB Output is correct
28 Correct 313 ms 134544 KB Output is correct
29 Correct 51 ms 94280 KB Output is correct
30 Correct 842 ms 211656 KB Output is correct
31 Correct 814 ms 219572 KB Output is correct
32 Correct 845 ms 219592 KB Output is correct
33 Correct 51 ms 94240 KB Output is correct
34 Correct 2515 ms 393964 KB Output is correct
35 Correct 744 ms 184956 KB Output is correct
36 Correct 2529 ms 392568 KB Output is correct
37 Correct 2610 ms 392432 KB Output is correct
38 Correct 55 ms 94280 KB Output is correct
39 Correct 150 ms 113600 KB Output is correct
40 Correct 278 ms 125880 KB Output is correct
41 Correct 292 ms 125908 KB Output is correct
42 Correct 274 ms 126132 KB Output is correct
43 Correct 156 ms 110764 KB Output is correct
44 Correct 329 ms 126032 KB Output is correct
45 Correct 283 ms 126036 KB Output is correct
46 Correct 266 ms 124612 KB Output is correct
47 Correct 160 ms 112360 KB Output is correct
48 Correct 268 ms 114264 KB Output is correct
49 Correct 198 ms 112608 KB Output is correct
50 Correct 488 ms 136464 KB Output is correct
51 Correct 4126 ms 414296 KB Output is correct
52 Correct 4933 ms 436772 KB Output is correct
53 Correct 4513 ms 436896 KB Output is correct
54 Correct 331 ms 128580 KB Output is correct
55 Correct 300 ms 128472 KB Output is correct
56 Correct 167 ms 124592 KB Output is correct
57 Correct 52 ms 94280 KB Output is correct
58 Correct 163 ms 112308 KB Output is correct
59 Correct 226 ms 112564 KB Output is correct
60 Correct 4323 ms 321900 KB Output is correct
61 Correct 254 ms 116916 KB Output is correct
62 Correct 239 ms 116920 KB Output is correct
63 Correct 238 ms 117100 KB Output is correct
64 Correct 280 ms 118452 KB Output is correct
65 Correct 258 ms 118456 KB Output is correct
66 Correct 170 ms 116144 KB Output is correct
67 Correct 143 ms 116148 KB Output is correct
68 Correct 176 ms 116020 KB Output is correct
69 Correct 247 ms 116660 KB Output is correct
70 Correct 1870 ms 249096 KB Output is correct
71 Correct 148 ms 108724 KB Output is correct
72 Correct 1844 ms 311528 KB Output is correct
73 Correct 1338 ms 235816 KB Output is correct
74 Correct 54 ms 94240 KB Output is correct
75 Correct 56 ms 94276 KB Output is correct
76 Correct 60 ms 94312 KB Output is correct
77 Correct 71 ms 94280 KB Output is correct
78 Correct 60 ms 94352 KB Output is correct
79 Correct 78 ms 96276 KB Output is correct
80 Correct 1493 ms 213760 KB Output is correct
81 Correct 4481 ms 358968 KB Output is correct
82 Execution timed out 5062 ms 457072 KB Time limit exceeded
83 Halted 0 ms 0 KB -