oj.uz

Submission #240369

# Submission time Handle Problem Language Result Execution time Memory
240369 2020-06-19T14:07:01 Z valerikk Strange Device (APIO19_strange_device) C++14
10 / 100
 5000 ms 524292 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define int ll

int get_union(vector<pair<int, int>> seg) {
    vector<pair<int, int>> events;
    for (auto [l, r] : seg) {
        events.emplace_back(l, 1);
        events.emplace_back(r + 1, -1);
    }
    sort(events.begin(), events.end());
    int res = 0, cnt = 0;
    for (int i = 0; i + 1 < events.size(); i++) {
        cnt += events[i].second;
        if (cnt > 0)
            res += events[i + 1].first - events[i].first;
    }
    return res;

}

int gcd(int a, int b) {
    while (b != 0) {
        a %= b;
        swap(a, b);
    }
    return a;
}

struct Event {
    int x, type, pl, pr;

    Event() {}
    Event(int x, int type, int pl, int pr) : x(x), type(type), pl(pl), pr(pr) {}
};

bool operator<(Event a, Event b) {
    return a.x < b.x || (a.x == b.x && -a.type < -b.type);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, a, b;
    cin >> n >> a >> b;
    int p = a / gcd(a, b + 1);
    vector<Event> events;
    auto add = [&] (int l, int r, int pl, int pr) {
        events.emplace_back(l, 1, pl, pr);
        events.emplace_back(r + 1, -1, pl, pr);
    };
    while (n--) {
        int l, r;
        cin >> l >> r;
        int L = l / b, R = r / b;
        if (L == R)
            add(l % b, r % b, L % p, R % p);
        else {
            int inside = R - L - 1;
            if (inside > 0)
                add(0, b - 1, (L + 1) % p, (R - 1) % p);
            add(l % b, b - 1, L % p, L % p);
            add(0, r % b, R % p, R % p);
        }
    }
    sort(events.begin(), events.end());
    multiset<pair<int, int>> seg;
    ll ans = 0;
    for (int i = 0; i + 1 < events.size(); i++) {
        if (events[i].type == 1)
            seg.insert({events[i].pl, events[i].pr});
        else
            seg.erase(seg.find({events[i].pl, events[i].pr}));
        int diff = events[i + 1].x - events[i].x;
        if (diff != 0) {
            vector<pair<int, int>> to_union;
            for (auto [l, r] : seg) {
                if (l <= r)
                    to_union.emplace_back(l, r);
                else {
                    to_union.emplace_back(0, r);
                    to_union.emplace_back(l, p - 1);
                }
            }
            ans += (ll) diff * get_union(to_union);
        }
    }
    cout << ans;
    return 0;
}

Compilation message

strange_device.cpp: In function 'll get_union(std::vector<std::pair<long long int, long long int> >)':
strange_device.cpp:9:15: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     for (auto [l, r] : seg) {
               ^
strange_device.cpp:15:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i + 1 < events.size(); i++) {
                     ~~~~~~^~~~~~~~~~~~~~~
strange_device.cpp: In function 'int main()':
strange_device.cpp:71:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i + 1 < events.size(); i++) {
                     ~~~~~~^~~~~~~~~~~~~~~
strange_device.cpp:79:23: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
             for (auto [l, r] : seg) {
                       ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 20 ms 1916 KB Output is correct
3 Correct 18 ms 1916 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 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 9 ms 384 KB Output is correct
16 Correct 20 ms 1916 KB Output is correct
17 Correct 96 ms 11108 KB Output is correct
18 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 20 ms 912 KB Output is correct
3 Correct 11 ms 512 KB Output is correct
4 Correct 42 ms 640 KB Output is correct
5 Runtime error 1806 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 1077 ms 225808 KB Output is correct
3 Runtime error 1772 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 1077 ms 225808 KB Output is correct
3 Runtime error 1772 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 1077 ms 225808 KB Output is correct
3 Runtime error 1772 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 1093 ms 11364 KB Output is correct
3 Execution timed out 5057 ms 11248 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 20 ms 1916 KB Output is correct
3 Correct 18 ms 1916 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 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 9 ms 384 KB Output is correct
16 Correct 20 ms 1916 KB Output is correct
17 Correct 96 ms 11108 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Incorrect 5 ms 384 KB Output isn't correct
23 Halted 0 ms 0 KB -