제출 #592801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
592801		skittles1412	마상시합 토너먼트 (IOI12_tournament)	C++17	100 / 100	193 ms	26380 KiB

tournament

#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__);
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())

namespace __gnu_pbds {
template <typename T>
using ost =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
}

const int maxn = 1e5 + 5;

int iarr[maxn];

struct Node {
    int ind, opt, otr;
    vector<int> ch;

    bool operator<(const Node& n) const {
        return iarr[opt] < iarr[n.opt];
    }
} heap[maxn * 2];
int hind = 0;

Node& alloc() {
    Node& n = heap[hind];
    n.ind = hind;
    n.opt = n.otr = -1;
    hind++;
    return n;
}

pair<int, int> ans;

void dfs(int o, int k, int add) {
    Node& n = heap[o];
    if (!sz(n.ch)) {
        ans = max(ans, pair<int, int> {add, -iarr[n.opt]});
    }
    for (auto& a : n.ch) {
        dfs(a, k, add + (k >= n.otr));
    }
}

int GetBestPosition(int n, int m, int k, int* arr, int* arrl, int* arrr) {
    for (int i = 0; i < n - 1; i++) {
        iarr[arr[i]] = i;
    }
    iarr[k] = n - 1;
    __gnu_pbds::ost<Node> s;
    for (int i = 0; i < n - 1; i++) {
        Node& n = alloc();
        n.opt = arr[i];
        s.insert(n);
    }
    {
        Node& n = alloc();
        n.opt = k;
        s.insert(n);
    }
    for (int i = 0; i < m; i++) {
        int l = arrl[i], r = arrr[i];
        Node& n = alloc();
        for (int j = 0; j < r - l + 1; j++) {
            auto it = s.find_by_order(l);
            Node m = *it;
            s.erase(it);
            n.ch.push_back(m.ind);
            n.opt = max(n.opt, m.opt);
            if (j == r - l) {
                n.otr = max(n.otr, m.otr);
            } else {
                n.otr = max(n.otr, n.opt);
            }
        }
        s.insert(n);
    }
    dfs(s.begin()->ind, k, 0);
    return -ans.second;
}

• Subtask 1: 17 / 17
• Subtask 2: 32 / 32
• Subtask 3: 51 / 51