제출 #440025

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

tournament

#ifndef SINA
// #include "grader.h"
#endif
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long long lol;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl mxn = 2e5 + 7, lg = 19;

ll anc [mxn][lg], rmq [mxn][lg], l [mxn], r [mxn], n, p;
Tree <pll> tr;
pll bst;

inline ll ask (ll l, ll r) { // [l, r] -fake -> [l, r)
	if (r == mxn - 1) return inf;
	ll LG = 31 - __builtin_clz(r - l);
	return max(rmq[l][LG], rmq[r - (1 << (LG))][LG]);
}

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
	for (ll i = 0; i < N - 1; i++) rmq[i][0] = K[i];
	for (ll j = 1; j < lg; j++) for (ll i = 0; i + (1 << j) < N; i++) rmq[i][j] = max(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);

	tr.clear();
	for (ll i = 0; i < N; i++) tr.insert({i, i}), l[i] = r[i] = i, anc[i][0] = mxn - 1;
	
	n = N;
	for (ll i = 0; i < C; i++) {
		auto itl = tr.find_by_order(S[i]), itr = tr.find_by_order(E[i] + 1);
		l[n] = l[itl->sc], r[n] = r[prev(itr)->sc];
		// dbg(l[n], r[n]);
		while (itl != itr) {
			anc[itl->sc][0] = n;
			auto it = itl++;
			tr.erase(it);
		}
		tr.insert({l[n], n});
		anc[n][0] = mxn - 1;
		n++;
	}
	
	r[mxn - 1] = mxn - 1;
	for (ll i = 0; i < lg; i++) anc[mxn - 1][i] = mxn - 1;
	for (ll v = n; v--;) for (ll i = 1; i < lg; i++) anc[v][i] = anc[anc[v][i - 1]][i - 1];

	bst = {0, 0};
	for (p = 0; p < N; p++) {
		ll v = p, len = 0;
		for (ll i = lg; i--;) if (ask(l[anc[v][i]], r[anc[v][i]]) < R) v = anc[v][i], len += 1 << i;
		bst = max(bst, {len, -p});
	}

	return -bst.sc;
}

#ifdef SINA
int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	ll K [4] = {1, 0, 2, 4}, S [3] = {1, 0, 0}, E [3] = {3, 1, 1};

	cout<< GetBestPosition(5, 3, 3, K, S, E);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
#endif
/*
5 3 3
1
0
2
4
1 3
0 1
0 1

1 0 2 3 4
1 3 4
3 4
4

*/

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