oj.uz

Submission #217022

# Submission time Handle Problem Language Result Execution time Memory
217022 2020-03-28T17:58:47 Z sevlll Strange Device (APIO19_strange_device) C++17
35 / 100
 940 ms 81856 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>

#define pb push_back
#define int long long
#define str string
using namespace std;
const int M = 1e9 + 7;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, a, b;
    cin >> n >> a >> b;
    vector<pair<int, int>> pr(n);
    for (int i = 0; i < n; i++) cin >> pr[i].first >> pr[i].second;
    int g = gcd(a, b + 1);
    a /= g;
    __int128_t num = a * b;
    if (n == 1) {
        int l = pr[0].first, r = pr[1].second;
        if (r - l >= num - 1) {
            cout << (int) num;
        } else {
            if (l == r) {
                cout << 1;
            } else {
                l %= num;
                r %= num;
                if (l < r) {
                    cout << r - l + 1;
                } else {
                    cout << r + (int) num - l;
                }
            }
        }
        return 0;
    }
    vector<pair<__int128_t, int>> ev;
    for (auto p : pr) {
        int l = p.first, r = p.second;
        l %= num;
        r %= num;
        if (r < l) {
            ev.pb({l, 1});
            ev.pb({num, -1});
            ev.pb({0, 1});
            ev.pb({r + 1, -1});
        } else {
            ev.pb({l, 1});
            ev.pb({r + 1, -1});
        }
    }
    sort(ev.begin(), ev.end());
    int bal = 0;
    __int128_t last = 0;
    int ans = 0;
    for (auto p : ev) {
        __int128_t x = p.first;
        int type = p.second;
        if (bal) {
            ans += (x - last);
        }
        last = x;
        bal += type;
    }
    cout << ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 11 ms 1660 KB Output is correct
3 Correct 12 ms 1660 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 11 ms 1660 KB Output is correct
17 Correct 89 ms 10344 KB Output is correct
18 Incorrect 5 ms 384 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 528 ms 81856 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 753 ms 81852 KB Output is correct
3 Correct 787 ms 81824 KB Output is correct
4 Correct 758 ms 81836 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 753 ms 81852 KB Output is correct
3 Correct 787 ms 81824 KB Output is correct
4 Correct 758 ms 81836 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 778 ms 81764 KB Output is correct
7 Correct 751 ms 81824 KB Output is correct
8 Correct 776 ms 81824 KB Output is correct
9 Correct 918 ms 81824 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 753 ms 81852 KB Output is correct
3 Correct 787 ms 81824 KB Output is correct
4 Correct 758 ms 81836 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 75 ms 10216 KB Output is correct
7 Correct 75 ms 10216 KB Output is correct
8 Correct 75 ms 10216 KB Output is correct
9 Correct 75 ms 10216 KB Output is correct
10 Correct 71 ms 10216 KB Output is correct
11 Correct 74 ms 10216 KB Output is correct
12 Correct 74 ms 10276 KB Output is correct
13 Correct 79 ms 10264 KB Output is correct
14 Correct 72 ms 10216 KB Output is correct
15 Correct 85 ms 10216 KB Output is correct
16 Correct 90 ms 10344 KB Output is correct
17 Correct 75 ms 10216 KB Output is correct
18 Correct 780 ms 81760 KB Output is correct
19 Correct 718 ms 81824 KB Output is correct
20 Correct 934 ms 81824 KB Output is correct
21 Correct 90 ms 10344 KB Output is correct
22 Correct 69 ms 10216 KB Output is correct
23 Correct 208 ms 38732 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 84 ms 10344 KB Output is correct
3 Correct 81 ms 10344 KB Output is correct
4 Correct 940 ms 81820 KB Output is correct
5 Correct 81 ms 10216 KB Output is correct
6 Correct 81 ms 10216 KB Output is correct
7 Correct 81 ms 10268 KB Output is correct
8 Correct 97 ms 10344 KB Output is correct
9 Correct 78 ms 10344 KB Output is correct
10 Correct 88 ms 10216 KB Output is correct
11 Correct 82 ms 10216 KB Output is correct
12 Correct 73 ms 10344 KB Output is correct
13 Correct 85 ms 10216 KB Output is correct
14 Correct 891 ms 81824 KB Output is correct
15 Correct 90 ms 10344 KB Output is correct
16 Correct 708 ms 81764 KB Output is correct
17 Correct 731 ms 81824 KB Output is correct
18 Incorrect 5 ms 384 KB Output isn't correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 11 ms 1660 KB Output is correct
3 Correct 12 ms 1660 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 11 ms 1660 KB Output is correct
17 Correct 89 ms 10344 KB Output is correct
18 Incorrect 5 ms 384 KB Output isn't correct