oj.uz

Submission #124622

# Submission time Handle Problem Language Result Execution time Memory
124622 2019-07-03T15:19:42 Z choikiwon Arranging Tickets (JOI17_arranging_tickets) C++17
100 / 100
 4251 ms 32460 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MN = 200010;

int N, M;
ll cnt[MN];
vector<pair<ll, int> > stk;
vector<pii> V[MN];

struct BIT {
    vector<ll> tree, lazy;
    void init() {
        tree = vector<ll>(4 * N);
        lazy = vector<ll>(4 * N, 0);
        build(0, N - 1, 1);
    }
    void build(int l, int r, int n) {
        if(l == r) {
            tree[n] = cnt[l];
            return;
        }
        int m = (l + r)>>1;
        build(l, m, 2*n);
        build(m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    void prop(int l, int r, int n) {
        if(l != r) {
            tree[2*n] += lazy[n];
            lazy[2*n] += lazy[n];
            tree[2*n + 1] += lazy[n];
            lazy[2*n + 1] += lazy[n];
            lazy[n] = 0;
        }
    }
    void upd(int a, int b, ll d, int l, int r, int n) {
        if(b < l || r < a) return;
        if(a <= l && r <= b) {
            tree[n] += d;
            lazy[n] += d;
            return;
        }
        prop(l, r, n);
        int m = (l + r)>>1;
        upd(a, b, d, l, m, 2*n);
        upd(a, b, d, m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    ll quer(int a, int b, int l, int r, int n) {
        if(b < l || r < a) return 0;
        if(a <= l && r <= b) return tree[n];
        prop(l, r, n);
        int m = (l + r)>>1;
        ll L = quer(a, b, l, m, 2*n);
        ll R = quer(a, b, m + 1, r, 2*n + 1);
        return max(L, R);
    }
} bit;

struct Info {
    int a, b, c;
    bool operator <(const Info &i) const {
        return b < i.b;
    }
};

priority_queue<Info> pq;

bool check(ll bound) {
    bit.init();
    while(!pq.empty()) pq.pop();

    int pos = 0;
    for(int i = 0; i < stk.size(); i++) {
        while(pos <= stk[i].second) {
            for(int j = 0; j < V[pos].size(); j++) {
                pq.push({ pos, V[pos][j].first, V[pos][j].second });
            }
            pos++;
        }
        int x = stk[i].second;

        ll t = bit.quer(x, x, 0, N - 1, 1);
        ll d = bit.tree[1];
        ll need = max(0LL, (t + d - 2 * bound + 1) / 2);

        while(need && !pq.empty()) {
            Info t = pq.top(); pq.pop();

            ll mn = min(need, 1LL * t.c);
            need -= mn;
            t.c -= mn;
            if(t.c) pq.push(t);

            bit.upd(0, N - 1, mn, 0, N - 1, 1);
            bit.upd(t.a, t.b, -2 * mn, 0, N - 1, 1);
        }
        if(need) return false;
        if(bit.tree[1] <= bound) return true;
    }
    return false;
}

int main() {
    scanf("%d %d", &N, &M);

    ll sum = 0;
    for(int i = 0; i < M; i++) {
        int a, b, c; scanf("%d %d %d", &a, &b, &c);
        a--; b--;
        if(a > b) swap(a, b);
        b--;

        cnt[a] += c;
        cnt[b + 1] -= c;
        V[a].push_back(pii(b, c));
        sum += c;
    }
    for(int i = 1; i < N; i++) cnt[i] += cnt[i - 1];

    for(int i = N - 1; i >= 0; i--) {
        while(!stk.empty() && stk.back().first <= cnt[i]) stk.pop_back();
        stk.push_back({cnt[i], i});
    }
    reverse(stk.begin(), stk.end());

    ll s = 0, e = sum, p = -1;
    while(s <= e) {
        ll m = (s + e)>>1;

        if(check(m)) {
            p = m;
            e = m - 1;
        }
        else s = m + 1;
    }
    printf("%lld", p);
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:109:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~~
arranging_tickets.cpp:113:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int a, b, c; scanf("%d %d %d", &a, &b, &c);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4980 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5060 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 6 ms 5216 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4980 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5060 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 6 ms 5216 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 7 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 4984 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 6 ms 4988 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4980 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5060 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 6 ms 5216 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 7 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 4984 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 6 ms 4988 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 16 ms 5468 KB Output is correct
29 Correct 14 ms 5628 KB Output is correct
30 Correct 15 ms 5496 KB Output is correct
31 Correct 14 ms 5496 KB Output is correct
32 Correct 15 ms 5496 KB Output is correct
33 Correct 15 ms 5624 KB Output is correct
34 Correct 12 ms 5496 KB Output is correct
35 Correct 16 ms 5496 KB Output is correct
36 Correct 14 ms 5496 KB Output is correct
37 Correct 14 ms 5500 KB Output is correct
38 Correct 8 ms 5496 KB Output is correct
39 Correct 11 ms 5496 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4980 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5060 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 6 ms 5216 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 7 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 4984 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 6 ms 4988 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 16 ms 5468 KB Output is correct
29 Correct 14 ms 5628 KB Output is correct
30 Correct 15 ms 5496 KB Output is correct
31 Correct 14 ms 5496 KB Output is correct
32 Correct 15 ms 5496 KB Output is correct
33 Correct 15 ms 5624 KB Output is correct
34 Correct 12 ms 5496 KB Output is correct
35 Correct 16 ms 5496 KB Output is correct
36 Correct 14 ms 5496 KB Output is correct
37 Correct 14 ms 5500 KB Output is correct
38 Correct 8 ms 5496 KB Output is correct
39 Correct 11 ms 5496 KB Output is correct
40 Correct 785 ms 31236 KB Output is correct
41 Correct 786 ms 31468 KB Output is correct
42 Correct 678 ms 30888 KB Output is correct
43 Correct 853 ms 30828 KB Output is correct
44 Correct 1006 ms 31212 KB Output is correct
45 Correct 946 ms 30060 KB Output is correct
46 Correct 588 ms 30828 KB Output is correct
47 Correct 512 ms 31152 KB Output is correct
48 Correct 601 ms 30568 KB Output is correct
49 Correct 392 ms 20464 KB Output is correct
50 Correct 131 ms 19796 KB Output is correct
51 Correct 456 ms 20208 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4980 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5060 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 6 ms 5216 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 8 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 7 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 4984 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 6 ms 4988 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 5112 KB Output is correct
28 Correct 16 ms 5468 KB Output is correct
29 Correct 14 ms 5628 KB Output is correct
30 Correct 15 ms 5496 KB Output is correct
31 Correct 14 ms 5496 KB Output is correct
32 Correct 15 ms 5496 KB Output is correct
33 Correct 15 ms 5624 KB Output is correct
34 Correct 12 ms 5496 KB Output is correct
35 Correct 16 ms 5496 KB Output is correct
36 Correct 14 ms 5496 KB Output is correct
37 Correct 14 ms 5500 KB Output is correct
38 Correct 8 ms 5496 KB Output is correct
39 Correct 11 ms 5496 KB Output is correct
40 Correct 785 ms 31236 KB Output is correct
41 Correct 786 ms 31468 KB Output is correct
42 Correct 678 ms 30888 KB Output is correct
43 Correct 853 ms 30828 KB Output is correct
44 Correct 1006 ms 31212 KB Output is correct
45 Correct 946 ms 30060 KB Output is correct
46 Correct 588 ms 30828 KB Output is correct
47 Correct 512 ms 31152 KB Output is correct
48 Correct 601 ms 30568 KB Output is correct
49 Correct 392 ms 20464 KB Output is correct
50 Correct 131 ms 19796 KB Output is correct
51 Correct 456 ms 20208 KB Output is correct
52 Correct 4251 ms 32460 KB Output is correct
53 Correct 2176 ms 31976 KB Output is correct
54 Correct 3990 ms 32112 KB Output is correct
55 Correct 4021 ms 32108 KB Output is correct
56 Correct 3511 ms 31596 KB Output is correct
57 Correct 3883 ms 31716 KB Output is correct
58 Correct 3896 ms 31976 KB Output is correct
59 Correct 2616 ms 21124 KB Output is correct