oj.uz

Submission #240449

# Submission time Handle Problem Language Result Execution time Memory
240449 2020-06-19T16:36:26 Z valerikk Strange Device (APIO19_strange_device) C++14
40 / 100
 5000 ms 219900 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>();
    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 5 ms 256 KB Output is correct
2 Correct 13 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 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 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 82 ms 6624 KB Output is correct
18 Correct 4 ms 256 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 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 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 7 ms 512 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 794 ms 126376 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 1143 ms 94360 KB Output is correct
3 Correct 2924 ms 219676 KB Output is correct
4 Correct 4433 ms 219900 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 1143 ms 94360 KB Output is correct
3 Correct 2924 ms 219676 KB Output is correct
4 Correct 4433 ms 219900 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4232 ms 172728 KB Output is correct
7 Correct 1119 ms 62968 KB Output is correct
8 Correct 3185 ms 172720 KB Output is correct
9 Execution timed out 5096 ms 172636 KB Time limit exceeded

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 1143 ms 94360 KB Output is correct
3 Correct 2924 ms 219676 KB Output is correct
4 Correct 4433 ms 219900 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 174 ms 14416 KB Output is correct
7 Correct 257 ms 17652 KB Output is correct
8 Correct 300 ms 17544 KB Output is correct
9 Correct 303 ms 17676 KB Output is correct
10 Correct 192 ms 12772 KB Output is correct
11 Correct 307 ms 17628 KB Output is correct
12 Correct 332 ms 17580 KB Output is correct
13 Correct 290 ms 17544 KB Output is correct
14 Correct 79 ms 6628 KB Output is correct
15 Correct 243 ms 14552 KB Output is correct
16 Correct 111 ms 6604 KB Output is correct
17 Correct 305 ms 17612 KB Output is correct
18 Execution timed out 5061 ms 172756 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 256 KB Output is correct
2 Correct 87 ms 6640 KB Output is correct
3 Correct 111 ms 6628 KB Output is correct
4 Correct 2322 ms 99192 KB Output is correct
5 Correct 123 ms 6632 KB Output is correct
6 Correct 121 ms 6632 KB Output is correct
7 Correct 118 ms 6632 KB Output is correct
8 Correct 139 ms 7000 KB Output is correct
9 Correct 139 ms 7128 KB Output is correct
10 Correct 94 ms 6632 KB Output is correct
11 Correct 79 ms 6628 KB Output is correct
12 Correct 81 ms 6636 KB Output is correct
13 Correct 132 ms 6628 KB Output is correct
14 Correct 1045 ms 49688 KB Output is correct
15 Correct 91 ms 6632 KB Output is correct
16 Correct 883 ms 49696 KB Output is correct
17 Correct 2550 ms 98936 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 5 ms 256 KB Output is correct
2 Correct 13 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 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 5 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 82 ms 6624 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 256 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Incorrect 5 ms 384 KB Output isn't correct
23 Halted 0 ms 0 KB -