oj.uz

Submission #642920

# Submission time Handle Problem Language Result Execution time Memory
642920 2022-09-20T19:15:28 Z Farhan_HY Jousting tournament (IOI12_tournament) C++14
100 / 100
 273 ms 23076 KB 
#include<bits/stdc++.h>
using namespace std;

struct seg {
    vector<int> tree;
    void init(int n) {
        tree.resize(4 * n + 4);
    }
    void build(int node, int tl, int tr, int val) {
        if (tr == tl) {
            tree[node] = val;
            return;
        }
        int mid = (tr + tl) / 2;
        build(2 * node, tl, mid, val);
        build(2 * node + 1, mid + 1, tr, val);
        tree[node] = tree[2 * node] + tree[2 * node + 1];
    }
    void update(int node, int tl, int tr, int idx, int val) {
        if (tr == tl) {
            tree[node] = val;
            return;
        }
        int mid = (tr + tl) / 2;
        if (idx <= mid) update(2 * node, tl, mid, idx, val);
        else update(2 * node + 1, mid + 1, tr, idx, val);
        tree[node] = tree[2 * node] + tree[2 * node + 1];
    }
    int getk_thone(int node, int tl, int tr, int t) {
        if (tr == tl) return tr;
        int mid = (tr + tl) / 2;
        if (tree[2 * node] >= t) return getk_thone(2 * node, tl, mid, t);
        return getk_thone(2 * node + 1, mid + 1, tr, t - tree[2 * node]);
    }
    int getSum(int node, int tl, int tr, int l, int r) {
        if (l <= tl && tr <= r) return tree[node];
        if (tr < l || tl > r) return 0;
        int mid = (tr + tl) / 2;
        int p1 = getSum(2 * node, tl, mid, l, r);
        int p2 = getSum(2 * node + 1, mid + 1, tr, l, r);
        return p1 + p2;
    }
};
set<int> st1, st2;
vector<int> open[100005], close[100005], v;
seg tree1; // fix segment's left
seg tree2; // fix segment's right
seg tree3; // index of first lose
seg tree4;
int a[100005], l[100005], r[100005];
int GetBestPosition(int n, int c, int num, int *k, int *s, int *e) {
    for(int i = n - 2; i >= 0; i--) a[i + 2] = k[i];
    a[1] = num;
    for(int i = c - 1; i >= 0; i--) l[i + 1] = s[i] + 1, r[i + 1] = e[i] + 1;
    tree1.init(n);
    tree2.init(n);
    tree4.init(n);
    tree1.build(1, 1, n, 1);
    tree2.build(1, 1, n, 1);
    for(int i = 1; i <= n; i++) {
        st1.insert(i), st2.insert(i);
        if (a[i] > num)
            tree4.update(1, 1, n, i, 1);
    }
    for(int i = 1; i <= c; i++) {
        l[i] = tree1.getk_thone(1, 1, n, l[i]);
        r[i] = tree2.getk_thone(1, 1, n, r[i]);
        open[l[i]].push_back(i);
        close[r[i]].push_back(i);
        auto it = st1.upper_bound(l[i]);
        while(it != st1.end() && *it <= r[i]) {
            tree1.update(1, 1, n, *it, 0);
            int j = *it;
            st1.erase(it);
            it = st1.upper_bound(j);
        }
        it = st2.lower_bound(l[i]);
        while(it != st2.end() && *it < r[i]) {
            tree2.update(1, 1, n, *it, 0);
            int j = *it;
            st2.erase(it);
            it = st2.upper_bound(j);
        }
    }
    tree3.init(c);
    st1.clear();
    int ans = -1, index = 0;
    for(int i = 1; i <= n; i++) {
        if (i != 1) {
            tree4.update(1, 1, n, i, 0);
            tree4.update(1, 1, n, i - 1, a[i] > num);
        }
        for(auto x: open[i]) {
            tree3.update(1, 1, c, x, 1);
            if (tree4.getSum(1, 1, n, l[x], r[x]))
                st1.insert(x);
        }
        int idx = c + 1;
        if (st1.size())
            idx = *st1.begin();
        int res = tree3.getSum(1, 1, c, 1, idx - 1);
        if (res > ans) {
            ans = res;
            index = i;
        }
        for(auto x: close[i]) {
            tree3.update(1, 1, c, x, 0);
            if (tree4.getSum(1, 1, n, l[x], r[x]))
                st1.erase(st1.find(x));
        }
    }
    return index - 1;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 5076 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5076 KB Output is correct
2 Correct 12 ms 5844 KB Output is correct
3 Correct 8 ms 5716 KB Output is correct
4 Correct 15 ms 5920 KB Output is correct
5 Correct 12 ms 5972 KB Output is correct
6 Correct 11 ms 5844 KB Output is correct
7 Correct 12 ms 5960 KB Output is correct
8 Correct 12 ms 5972 KB Output is correct
9 Correct 7 ms 5716 KB Output is correct
10 Correct 16 ms 5992 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 13400 KB Output is correct
2 Correct 235 ms 23076 KB Output is correct
3 Correct 127 ms 19996 KB Output is correct
4 Correct 220 ms 22960 KB Output is correct
5 Correct 213 ms 22248 KB Output is correct
6 Correct 273 ms 21836 KB Output is correct
7 Correct 217 ms 22940 KB Output is correct
8 Correct 225 ms 22856 KB Output is correct
9 Correct 121 ms 19884 KB Output is correct
10 Correct 127 ms 20596 KB Output is correct