oj.uz

답안 #217023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217023 2020-03-28T18:00:48 Z sevlll 이상한 기계 (APIO19_strange_device) C++17
35 / 100
 971 ms 82020 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[0].first;
        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

# 결과 실행 시간 메모리 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 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 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 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 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 90 ms 10216 KB Output is correct
18 Incorrect 5 ms 384 KB Output isn't correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 526 ms 81752 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 726 ms 81800 KB Output is correct
3 Correct 784 ms 81856 KB Output is correct
4 Correct 751 ms 81828 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 726 ms 81800 KB Output is correct
3 Correct 784 ms 81856 KB Output is correct
4 Correct 751 ms 81828 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 755 ms 81760 KB Output is correct
7 Correct 726 ms 81824 KB Output is correct
8 Correct 752 ms 81856 KB Output is correct
9 Correct 899 ms 81856 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 726 ms 81800 KB Output is correct
3 Correct 784 ms 81856 KB Output is correct
4 Correct 751 ms 81828 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 69 ms 10216 KB Output is correct
7 Correct 77 ms 10216 KB Output is correct
8 Correct 75 ms 10216 KB Output is correct
9 Correct 72 ms 10216 KB Output is correct
10 Correct 71 ms 10216 KB Output is correct
11 Correct 76 ms 10216 KB Output is correct
12 Correct 72 ms 10216 KB Output is correct
13 Correct 79 ms 10220 KB Output is correct
14 Correct 86 ms 10344 KB Output is correct
15 Correct 85 ms 10216 KB Output is correct
16 Correct 80 ms 10216 KB Output is correct
17 Correct 74 ms 10220 KB Output is correct
18 Correct 760 ms 81928 KB Output is correct
19 Correct 703 ms 82016 KB Output is correct
20 Correct 949 ms 81824 KB Output is correct
21 Correct 86 ms 10216 KB Output is correct
22 Correct 84 ms 10216 KB Output is correct
23 Correct 209 ms 38612 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 78 ms 10268 KB Output is correct
3 Correct 81 ms 10216 KB Output is correct
4 Correct 971 ms 81808 KB Output is correct
5 Correct 81 ms 10216 KB Output is correct
6 Correct 87 ms 10268 KB Output is correct
7 Correct 79 ms 10216 KB Output is correct
8 Correct 86 ms 10216 KB Output is correct
9 Correct 76 ms 10216 KB Output is correct
10 Correct 85 ms 10216 KB Output is correct
11 Correct 86 ms 10216 KB Output is correct
12 Correct 72 ms 10344 KB Output is correct
13 Correct 86 ms 10216 KB Output is correct
14 Correct 934 ms 81956 KB Output is correct
15 Correct 88 ms 10216 KB Output is correct
16 Correct 711 ms 81856 KB Output is correct
17 Correct 739 ms 82020 KB Output is correct
18 Incorrect 4 ms 384 KB Output isn't correct

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 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 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 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 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 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 90 ms 10216 KB Output is correct
18 Incorrect 5 ms 384 KB Output isn't correct