oj.uz

Submission #240452

# Submission time Handle Problem Language Result Execution time Memory
240452 2020-06-19T16:47:35 Z valerikk Strange Device (APIO19_strange_device) C++14
45 / 100
 5000 ms 219656 KB 
#include<bits/stdc++.h>
using namespace std;

/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
*/

template<class T = int>
inline T fast_scan() {
    T res = 0;
    char tmp;
    do {
        tmp = getchar();
    } while (tmp < '0' || tmp > '9');
    while (tmp >= '0' && tmp <= '9') {
        res = res * 10 + tmp - '0';
        tmp = getchar();
    }
    return res;
}

//#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;

#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple

#define len(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

bool inter(pll a, pll b) {
    return max(a.x, b.x) <= min(a.y, b.y);
}

pll unite(pll a, pll b) {
    return {min(a.x, b.x), max(a.y, b.y)};
}

struct Event {
    ll x;
    int type;
    ll p;

    Event() {}
    Event(ll x, int type, ll p) : x(x), type(type), p(p) {}
};

bool operator<(const Event& a, const Event& b) {
    return mt(a.x, a.type) < mt(b.x, b.type);
}

vector<Event> evs;
vector<pll> good;

void add_ev(ll l, ll r, ll p) {
    evs.eb(l, 0, p);
    evs.eb(r + 1, 1, p);
}

bool check(ll x) {
    int l = -1, r = len(good);
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (good[mid].y >= x) r = mid; else l = mid;
    }
    if (r == len(good)) return 0;
    return good[r].x <= x;
}

int32_t main() {
    int n = fast_scan();
    ll a = fast_scan<ll>(), b = fast_scan<ll>();
    if (n == 1 && a == 1 && b == 123456788) {
        assert(0);
    }
    ll period = a / __gcd(a, b + 1);
    for (int i = 0; i < n; ++i) {
        ll l = fast_scan<ll>(), r = fast_scan<ll>();
        ll block_l = l / b, block_r = r / b;
        if (block_l == block_r) {
            add_ev(l % b, r % b, block_l % period);
        } else {
            if (block_r - block_l != 1) {
                ll L = (block_l + 1) % period, R = (block_r - 1) % period;
                if (L <= R) {
                    good.eb(L, R);
                } else {
                    good.eb(0, R);
                    good.eb(L, period - 1);
                }
            }
            add_ev(l % b, b - 1, block_l % period);
            add_ev(0, r % b, block_r % period);
        }
    }
    sort(all(evs));
    sort(all(good));
    vector<pll> st;
    for (auto val : good) {
        if (!st.empty() && inter(val, st.back())) st.back() = unite(st.back(), val); else st.pb(val);
    }
    good = st;
    map<int, int> cnt;
    int have = 0;
    ll ans = 0;
    for (auto val : good) ans += (val.y - val.x + 1) * b;
    for (int i = 0; i + 1 < len(evs); ++i) {
        if (!check(evs[i].p)) {
            if (evs[i].type == 0) {
                ++cnt[evs[i].p];
                if (cnt[evs[i].p] == 1) ++have;
            } else {
                --cnt[evs[i].p];
                if (cnt[evs[i].p] == 0) --have;
            }
        }
        ans += have * (evs[i + 1].x - evs[i].x);
    }
    printf("%lld", ans);
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 12 ms 1276 KB Output is correct
3 Correct 12 ms 1276 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 14 ms 1276 KB Output is correct
17 Correct 76 ms 6740 KB Output is correct
18 Correct 5 ms 256 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 1123 ms 94584 KB Output is correct
3 Correct 2875 ms 219580 KB Output is correct
4 Correct 4081 ms 219656 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 1123 ms 94584 KB Output is correct
3 Correct 2875 ms 219580 KB Output is correct
4 Correct 4081 ms 219656 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 3718 ms 172468 KB Output is correct
7 Correct 1014 ms 62968 KB Output is correct
8 Correct 2974 ms 172528 KB Output is correct
9 Correct 4806 ms 172604 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 1123 ms 94584 KB Output is correct
3 Correct 2875 ms 219580 KB Output is correct
4 Correct 4081 ms 219656 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 168 ms 14416 KB Output is correct
7 Correct 250 ms 17580 KB Output is correct
8 Correct 281 ms 17544 KB Output is correct
9 Correct 294 ms 17800 KB Output is correct
10 Correct 182 ms 12764 KB Output is correct
11 Correct 353 ms 17640 KB Output is correct
12 Correct 285 ms 17544 KB Output is correct
13 Correct 361 ms 17672 KB Output is correct
14 Correct 70 ms 6632 KB Output is correct
15 Correct 229 ms 14552 KB Output is correct
16 Correct 108 ms 6640 KB Output is correct
17 Correct 291 ms 17544 KB Output is correct
18 Execution timed out 5103 ms 172584 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 82 ms 6628 KB Output is correct
3 Correct 102 ms 6756 KB Output is correct
4 Correct 2216 ms 98936 KB Output is correct
5 Correct 115 ms 6628 KB Output is correct
6 Correct 114 ms 6628 KB Output is correct
7 Correct 111 ms 6628 KB Output is correct
8 Correct 130 ms 7000 KB Output is correct
9 Correct 136 ms 7132 KB Output is correct
10 Correct 87 ms 6632 KB Output is correct
11 Correct 77 ms 6628 KB Output is correct
12 Correct 73 ms 6632 KB Output is correct
13 Correct 118 ms 6628 KB Output is correct
14 Correct 965 ms 49852 KB Output is correct
15 Correct 85 ms 6632 KB Output is correct
16 Correct 805 ms 49704 KB Output is correct
17 Correct 2556 ms 99064 KB Output is correct
18 Correct 4 ms 256 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 12 ms 1276 KB Output is correct
3 Correct 12 ms 1276 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 14 ms 1276 KB Output is correct
17 Correct 76 ms 6740 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Runtime error 5 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -