oj.uz

답안 #1117177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1117177 2024-11-22T21:29:21 Z PagodePaiva 이상한 기계 (APIO19_strange_device) C++17
70 / 100
 5000 ms 477952 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;
    vector <int> v;
    for(auto [aa, bb] : m){
        v.push_back(aa);
    }
    for(auto [pos, valor] : mapear){
        res += (pos-st)*add;
        st = pos;
        for(auto [x, tp] : opp[valor]){
            if(tp == 0){
                int d = upper_bound(v.begin(), v.end(), x)-v.begin();
                if(d != 0) {
                    d--;
                    if(m[v[d]] >= 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 48 ms 94280 KB Output is correct
2 Correct 62 ms 95196 KB Output is correct
3 Correct 60 ms 95300 KB Output is correct
4 Correct 51 ms 94280 KB Output is correct
5 Correct 55 ms 94288 KB Output is correct
6 Correct 56 ms 94280 KB Output is correct
7 Correct 55 ms 94276 KB Output is correct
8 Correct 55 ms 94280 KB Output is correct
9 Correct 56 ms 94408 KB Output is correct
10 Correct 59 ms 94124 KB Output is correct
11 Correct 68 ms 94288 KB Output is correct
12 Correct 62 ms 94284 KB Output is correct
13 Correct 58 ms 94352 KB Output is correct
14 Correct 71 ms 94280 KB Output is correct
15 Correct 62 ms 94292 KB Output is correct
16 Correct 77 ms 95044 KB Output is correct
17 Correct 132 ms 102072 KB Output is correct
18 Correct 63 ms 94304 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 94316 KB Output is correct
2 Correct 64 ms 94280 KB Output is correct
3 Correct 60 ms 94216 KB Output is correct
4 Correct 64 ms 94332 KB Output is correct
5 Correct 64 ms 94152 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 94228 KB Output is correct
2 Correct 69 ms 94540 KB Output is correct
3 Correct 64 ms 94404 KB Output is correct
4 Correct 65 ms 94536 KB Output is correct
5 Correct 283 ms 134540 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 94284 KB Output is correct
2 Correct 696 ms 211548 KB Output is correct
3 Correct 627 ms 188612 KB Output is correct
4 Correct 621 ms 188592 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 94284 KB Output is correct
2 Correct 696 ms 211548 KB Output is correct
3 Correct 627 ms 188612 KB Output is correct
4 Correct 621 ms 188592 KB Output is correct
5 Correct 59 ms 94380 KB Output is correct
6 Correct 2227 ms 353744 KB Output is correct
7 Correct 684 ms 184956 KB Output is correct
8 Correct 2117 ms 353684 KB Output is correct
9 Correct 2181 ms 353824 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 94284 KB Output is correct
2 Correct 696 ms 211548 KB Output is correct
3 Correct 627 ms 188612 KB Output is correct
4 Correct 621 ms 188592 KB Output is correct
5 Correct 59 ms 94280 KB Output is correct
6 Correct 137 ms 111948 KB Output is correct
7 Correct 219 ms 122300 KB Output is correct
8 Correct 215 ms 122296 KB Output is correct
9 Correct 213 ms 122304 KB Output is correct
10 Correct 156 ms 110948 KB Output is correct
11 Correct 219 ms 122248 KB Output is correct
12 Correct 232 ms 122296 KB Output is correct
13 Correct 220 ms 120764 KB Output is correct
14 Correct 149 ms 112308 KB Output is correct
15 Correct 228 ms 114000 KB Output is correct
16 Correct 196 ms 112576 KB Output is correct
17 Correct 436 ms 132584 KB Output is correct
18 Correct 3730 ms 375148 KB Output is correct
19 Correct 3762 ms 360444 KB Output is correct
20 Correct 3855 ms 360436 KB Output is correct
21 Correct 267 ms 121272 KB Output is correct
22 Correct 236 ms 121016 KB Output is correct
23 Correct 169 ms 112048 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 94240 KB Output is correct
2 Correct 185 ms 112268 KB Output is correct
3 Correct 211 ms 112564 KB Output is correct
4 Correct 3931 ms 321884 KB Output is correct
5 Correct 232 ms 113332 KB Output is correct
6 Correct 234 ms 113084 KB Output is correct
7 Correct 229 ms 113308 KB Output is correct
8 Correct 246 ms 114648 KB Output is correct
9 Correct 247 ms 114776 KB Output is correct
10 Correct 189 ms 112408 KB Output is correct
11 Correct 152 ms 112308 KB Output is correct
12 Correct 165 ms 112308 KB Output is correct
13 Correct 231 ms 112944 KB Output is correct
14 Correct 1687 ms 211824 KB Output is correct
15 Correct 172 ms 104884 KB Output is correct
16 Correct 1928 ms 274292 KB Output is correct
17 Correct 975 ms 198500 KB Output is correct
18 Correct 54 ms 94280 KB Output is correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 94280 KB Output is correct
2 Correct 62 ms 95196 KB Output is correct
3 Correct 60 ms 95300 KB Output is correct
4 Correct 51 ms 94280 KB Output is correct
5 Correct 55 ms 94288 KB Output is correct
6 Correct 56 ms 94280 KB Output is correct
7 Correct 55 ms 94276 KB Output is correct
8 Correct 55 ms 94280 KB Output is correct
9 Correct 56 ms 94408 KB Output is correct
10 Correct 59 ms 94124 KB Output is correct
11 Correct 68 ms 94288 KB Output is correct
12 Correct 62 ms 94284 KB Output is correct
13 Correct 58 ms 94352 KB Output is correct
14 Correct 71 ms 94280 KB Output is correct
15 Correct 62 ms 94292 KB Output is correct
16 Correct 77 ms 95044 KB Output is correct
17 Correct 132 ms 102072 KB Output is correct
18 Correct 63 ms 94304 KB Output is correct
19 Correct 79 ms 94316 KB Output is correct
20 Correct 64 ms 94280 KB Output is correct
21 Correct 60 ms 94216 KB Output is correct
22 Correct 64 ms 94332 KB Output is correct
23 Correct 64 ms 94152 KB Output is correct
24 Correct 64 ms 94228 KB Output is correct
25 Correct 69 ms 94540 KB Output is correct
26 Correct 64 ms 94404 KB Output is correct
27 Correct 65 ms 94536 KB Output is correct
28 Correct 283 ms 134540 KB Output is correct
29 Correct 65 ms 94284 KB Output is correct
30 Correct 696 ms 211548 KB Output is correct
31 Correct 627 ms 188612 KB Output is correct
32 Correct 621 ms 188592 KB Output is correct
33 Correct 59 ms 94380 KB Output is correct
34 Correct 2227 ms 353744 KB Output is correct
35 Correct 684 ms 184956 KB Output is correct
36 Correct 2117 ms 353684 KB Output is correct
37 Correct 2181 ms 353824 KB Output is correct
38 Correct 59 ms 94280 KB Output is correct
39 Correct 137 ms 111948 KB Output is correct
40 Correct 219 ms 122300 KB Output is correct
41 Correct 215 ms 122296 KB Output is correct
42 Correct 213 ms 122304 KB Output is correct
43 Correct 156 ms 110948 KB Output is correct
44 Correct 219 ms 122248 KB Output is correct
45 Correct 232 ms 122296 KB Output is correct
46 Correct 220 ms 120764 KB Output is correct
47 Correct 149 ms 112308 KB Output is correct
48 Correct 228 ms 114000 KB Output is correct
49 Correct 196 ms 112576 KB Output is correct
50 Correct 436 ms 132584 KB Output is correct
51 Correct 3730 ms 375148 KB Output is correct
52 Correct 3762 ms 360444 KB Output is correct
53 Correct 3855 ms 360436 KB Output is correct
54 Correct 267 ms 121272 KB Output is correct
55 Correct 236 ms 121016 KB Output is correct
56 Correct 169 ms 112048 KB Output is correct
57 Correct 63 ms 94240 KB Output is correct
58 Correct 185 ms 112268 KB Output is correct
59 Correct 211 ms 112564 KB Output is correct
60 Correct 3931 ms 321884 KB Output is correct
61 Correct 232 ms 113332 KB Output is correct
62 Correct 234 ms 113084 KB Output is correct
63 Correct 229 ms 113308 KB Output is correct
64 Correct 246 ms 114648 KB Output is correct
65 Correct 247 ms 114776 KB Output is correct
66 Correct 189 ms 112408 KB Output is correct
67 Correct 152 ms 112308 KB Output is correct
68 Correct 165 ms 112308 KB Output is correct
69 Correct 231 ms 112944 KB Output is correct
70 Correct 1687 ms 211824 KB Output is correct
71 Correct 172 ms 104884 KB Output is correct
72 Correct 1928 ms 274292 KB Output is correct
73 Correct 975 ms 198500 KB Output is correct
74 Correct 54 ms 94280 KB Output is correct
75 Correct 64 ms 94288 KB Output is correct
76 Correct 59 ms 94280 KB Output is correct
77 Correct 63 ms 94280 KB Output is correct
78 Correct 61 ms 94160 KB Output is correct
79 Correct 78 ms 95824 KB Output is correct
80 Correct 1518 ms 176644 KB Output is correct
81 Correct 3776 ms 321688 KB Output is correct
82 Correct 4563 ms 380732 KB Output is correct
83 Execution timed out 5092 ms 477952 KB Time limit exceeded
84 Halted 0 ms 0 KB -