답안 #217015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217015 2020-03-28T17:49:34 Z sevlll 이상한 기계 (APIO19_strange_device) C++17
65 / 100
793 ms 49108 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;
    vector<pair<int, 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;
    int last = 0;
    int ans = 0;
    for (auto p : ev) {
        int x = p.first, type = p.second;
        if (bal) {
            ans += (x - last);
        }
        last = x;
        bal += type;
    }
    cout << ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 11 ms 1152 KB Output is correct
4 Correct 4 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 5 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 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 11 ms 1152 KB Output is correct
17 Correct 76 ms 6124 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 308 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 433 ms 49040 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 653 ms 49044 KB Output is correct
3 Correct 743 ms 49108 KB Output is correct
4 Correct 647 ms 48980 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 653 ms 49044 KB Output is correct
3 Correct 743 ms 49108 KB Output is correct
4 Correct 647 ms 48980 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 671 ms 49060 KB Output is correct
7 Correct 615 ms 48980 KB Output is correct
8 Correct 643 ms 49108 KB Output is correct
9 Correct 742 ms 49108 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 653 ms 49044 KB Output is correct
3 Correct 743 ms 49108 KB Output is correct
4 Correct 647 ms 48980 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 65 ms 6124 KB Output is correct
7 Correct 69 ms 6124 KB Output is correct
8 Correct 65 ms 6124 KB Output is correct
9 Correct 69 ms 6124 KB Output is correct
10 Correct 62 ms 6124 KB Output is correct
11 Correct 65 ms 6124 KB Output is correct
12 Correct 63 ms 6124 KB Output is correct
13 Correct 73 ms 6124 KB Output is correct
14 Correct 63 ms 6124 KB Output is correct
15 Correct 75 ms 6124 KB Output is correct
16 Correct 73 ms 6124 KB Output is correct
17 Correct 65 ms 6124 KB Output is correct
18 Correct 664 ms 49108 KB Output is correct
19 Correct 617 ms 48988 KB Output is correct
20 Correct 754 ms 48992 KB Output is correct
21 Correct 78 ms 6124 KB Output is correct
22 Correct 68 ms 6124 KB Output is correct
23 Correct 195 ms 22244 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 73 ms 6124 KB Output is correct
3 Correct 83 ms 6124 KB Output is correct
4 Correct 793 ms 49040 KB Output is correct
5 Correct 74 ms 6124 KB Output is correct
6 Correct 71 ms 6124 KB Output is correct
7 Correct 72 ms 6124 KB Output is correct
8 Correct 76 ms 6172 KB Output is correct
9 Correct 76 ms 6128 KB Output is correct
10 Correct 76 ms 6124 KB Output is correct
11 Correct 72 ms 6124 KB Output is correct
12 Correct 66 ms 6124 KB Output is correct
13 Correct 75 ms 6124 KB Output is correct
14 Correct 757 ms 49108 KB Output is correct
15 Correct 76 ms 6124 KB Output is correct
16 Correct 619 ms 49108 KB Output is correct
17 Correct 629 ms 48980 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 11 ms 1152 KB Output is correct
4 Correct 4 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 5 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 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 11 ms 1152 KB Output is correct
17 Correct 76 ms 6124 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Incorrect 5 ms 384 KB Output isn't correct
21 Halted 0 ms 0 KB -