oj.uz

답안 #1117170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1117170 2024-11-22T21:23:36 Z PagodePaiva 이상한 기계 (APIO19_strange_device) C++17
70 / 100
 5000 ms 470136 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#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

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94280 KB Output is correct
2 Correct 55 ms 95072 KB Output is correct
3 Correct 56 ms 95300 KB Output is correct
4 Correct 51 ms 94376 KB Output is correct
5 Correct 53 ms 94140 KB Output is correct
6 Correct 53 ms 94280 KB Output is correct
7 Correct 53 ms 94276 KB Output is correct
8 Correct 66 ms 94220 KB Output is correct
9 Correct 57 ms 94256 KB Output is correct
10 Correct 67 ms 94280 KB Output is correct
11 Correct 70 ms 94224 KB Output is correct
12 Correct 66 ms 94280 KB Output is correct
13 Correct 61 ms 94288 KB Output is correct
14 Correct 61 ms 94280 KB Output is correct
15 Correct 61 ms 94260 KB Output is correct
16 Correct 67 ms 95052 KB Output is correct
17 Correct 130 ms 101984 KB Output is correct
18 Correct 75 ms 94204 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 94280 KB Output is correct
2 Correct 80 ms 94280 KB Output is correct
3 Correct 56 ms 94152 KB Output is correct
4 Correct 72 ms 94236 KB Output is correct
5 Correct 72 ms 94196 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 94192 KB Output is correct
2 Correct 74 ms 94536 KB Output is correct
3 Correct 93 ms 94536 KB Output is correct
4 Correct 76 ms 94620 KB Output is correct
5 Correct 334 ms 134468 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94280 KB Output is correct
2 Correct 759 ms 211608 KB Output is correct
3 Correct 606 ms 172636 KB Output is correct
4 Correct 578 ms 172488 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94280 KB Output is correct
2 Correct 759 ms 211608 KB Output is correct
3 Correct 606 ms 172636 KB Output is correct
4 Correct 578 ms 172488 KB Output is correct
5 Correct 62 ms 94252 KB Output is correct
6 Correct 2106 ms 345560 KB Output is correct
7 Correct 703 ms 184920 KB Output is correct
8 Correct 1995 ms 345372 KB Output is correct
9 Correct 2076 ms 345564 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 94280 KB Output is correct
2 Correct 759 ms 211608 KB Output is correct
3 Correct 606 ms 172636 KB Output is correct
4 Correct 578 ms 172488 KB Output is correct
5 Correct 75 ms 94280 KB Output is correct
6 Correct 150 ms 112064 KB Output is correct
7 Correct 224 ms 121292 KB Output is correct
8 Correct 237 ms 121380 KB Output is correct
9 Correct 213 ms 121772 KB Output is correct
10 Correct 158 ms 110992 KB Output is correct
11 Correct 232 ms 121256 KB Output is correct
12 Correct 244 ms 121264 KB Output is correct
13 Correct 238 ms 119740 KB Output is correct
14 Correct 167 ms 112308 KB Output is correct
15 Correct 246 ms 113852 KB Output is correct
16 Correct 231 ms 112576 KB Output is correct
17 Correct 438 ms 131892 KB Output is correct
18 Correct 3426 ms 367136 KB Output is correct
19 Correct 3412 ms 352580 KB Output is correct
20 Correct 3169 ms 352692 KB Output is correct
21 Correct 217 ms 119992 KB Output is correct
22 Correct 226 ms 120124 KB Output is correct
23 Correct 160 ms 111996 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 94288 KB Output is correct
2 Correct 171 ms 112552 KB Output is correct
3 Correct 248 ms 112564 KB Output is correct
4 Correct 3936 ms 321848 KB Output is correct
5 Correct 244 ms 113160 KB Output is correct
6 Correct 244 ms 113076 KB Output is correct
7 Correct 227 ms 113332 KB Output is correct
8 Correct 259 ms 114868 KB Output is correct
9 Correct 267 ms 114936 KB Output is correct
10 Correct 182 ms 112476 KB Output is correct
11 Correct 162 ms 112264 KB Output is correct
12 Correct 174 ms 112392 KB Output is correct
13 Correct 254 ms 112820 KB Output is correct
14 Correct 1501 ms 211892 KB Output is correct
15 Correct 148 ms 105004 KB Output is correct
16 Correct 2020 ms 274448 KB Output is correct
17 Correct 1062 ms 198988 KB Output is correct
18 Correct 57 ms 94244 KB Output is correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94280 KB Output is correct
2 Correct 55 ms 95072 KB Output is correct
3 Correct 56 ms 95300 KB Output is correct
4 Correct 51 ms 94376 KB Output is correct
5 Correct 53 ms 94140 KB Output is correct
6 Correct 53 ms 94280 KB Output is correct
7 Correct 53 ms 94276 KB Output is correct
8 Correct 66 ms 94220 KB Output is correct
9 Correct 57 ms 94256 KB Output is correct
10 Correct 67 ms 94280 KB Output is correct
11 Correct 70 ms 94224 KB Output is correct
12 Correct 66 ms 94280 KB Output is correct
13 Correct 61 ms 94288 KB Output is correct
14 Correct 61 ms 94280 KB Output is correct
15 Correct 61 ms 94260 KB Output is correct
16 Correct 67 ms 95052 KB Output is correct
17 Correct 130 ms 101984 KB Output is correct
18 Correct 75 ms 94204 KB Output is correct
19 Correct 70 ms 94280 KB Output is correct
20 Correct 80 ms 94280 KB Output is correct
21 Correct 56 ms 94152 KB Output is correct
22 Correct 72 ms 94236 KB Output is correct
23 Correct 72 ms 94196 KB Output is correct
24 Correct 98 ms 94192 KB Output is correct
25 Correct 74 ms 94536 KB Output is correct
26 Correct 93 ms 94536 KB Output is correct
27 Correct 76 ms 94620 KB Output is correct
28 Correct 334 ms 134468 KB Output is correct
29 Correct 60 ms 94280 KB Output is correct
30 Correct 759 ms 211608 KB Output is correct
31 Correct 606 ms 172636 KB Output is correct
32 Correct 578 ms 172488 KB Output is correct
33 Correct 62 ms 94252 KB Output is correct
34 Correct 2106 ms 345560 KB Output is correct
35 Correct 703 ms 184920 KB Output is correct
36 Correct 1995 ms 345372 KB Output is correct
37 Correct 2076 ms 345564 KB Output is correct
38 Correct 75 ms 94280 KB Output is correct
39 Correct 150 ms 112064 KB Output is correct
40 Correct 224 ms 121292 KB Output is correct
41 Correct 237 ms 121380 KB Output is correct
42 Correct 213 ms 121772 KB Output is correct
43 Correct 158 ms 110992 KB Output is correct
44 Correct 232 ms 121256 KB Output is correct
45 Correct 244 ms 121264 KB Output is correct
46 Correct 238 ms 119740 KB Output is correct
47 Correct 167 ms 112308 KB Output is correct
48 Correct 246 ms 113852 KB Output is correct
49 Correct 231 ms 112576 KB Output is correct
50 Correct 438 ms 131892 KB Output is correct
51 Correct 3426 ms 367136 KB Output is correct
52 Correct 3412 ms 352580 KB Output is correct
53 Correct 3169 ms 352692 KB Output is correct
54 Correct 217 ms 119992 KB Output is correct
55 Correct 226 ms 120124 KB Output is correct
56 Correct 160 ms 111996 KB Output is correct
57 Correct 55 ms 94288 KB Output is correct
58 Correct 171 ms 112552 KB Output is correct
59 Correct 248 ms 112564 KB Output is correct
60 Correct 3936 ms 321848 KB Output is correct
61 Correct 244 ms 113160 KB Output is correct
62 Correct 244 ms 113076 KB Output is correct
63 Correct 227 ms 113332 KB Output is correct
64 Correct 259 ms 114868 KB Output is correct
65 Correct 267 ms 114936 KB Output is correct
66 Correct 182 ms 112476 KB Output is correct
67 Correct 162 ms 112264 KB Output is correct
68 Correct 174 ms 112392 KB Output is correct
69 Correct 254 ms 112820 KB Output is correct
70 Correct 1501 ms 211892 KB Output is correct
71 Correct 148 ms 105004 KB Output is correct
72 Correct 2020 ms 274448 KB Output is correct
73 Correct 1062 ms 198988 KB Output is correct
74 Correct 57 ms 94244 KB Output is correct
75 Correct 62 ms 94280 KB Output is correct
76 Correct 61 ms 94336 KB Output is correct
77 Correct 63 ms 94280 KB Output is correct
78 Correct 62 ms 94280 KB Output is correct
79 Correct 67 ms 95824 KB Output is correct
80 Correct 1505 ms 176552 KB Output is correct
81 Correct 3921 ms 321716 KB Output is correct
82 Correct 4402 ms 372912 KB Output is correct
83 Execution timed out 5089 ms 470136 KB Time limit exceeded
84 Halted 0 ms 0 KB -