제출 #645837

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

tournament

#include <bits/stdc++.h>
#define ll long long
#define INF (1e9)
#define MAX (int) (2e5 + 5)
#define MOD 1000000007
#define par pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(x) (int) ((x).size())
#define esq(x) (x<<1)
#define dir(x) ((x<<1)|1)
#define lsb(x) (x & -x)
#define W(x) cout << #x << ": " << x << endl
#define Wii(x) cout << x.first << ' ' << x.second << endl
#define _ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
using namespace std;
 
int resp[MAX], a1[MAX], a2[MAX], n, vertice[MAX], total, prox[MAX], val[MAX], r, st[MAX<<2], st1[MAX<<2], lazy[MAX<<2], c;
pair<int, int> intervalo[MAX];
vector<int> grafo[MAX];
vector<pair<int, int> > ans;
 
void build(int idx, int i, int j)
{
	if (i == j)
	{
		st[idx] = 1;
		st1[idx] = val[i];
		return;
	}
	int mid = (i+j)>>1;
	build(esq(idx), i, mid);
	build(dir(idx), mid+1, j);
	st[idx] = st[esq(idx)] + st[dir(idx)];
	st1[idx] = max(st1[esq(idx)], st1[dir(idx)]);
}
 
void push(int idx, int i, int j)
{
	if (!lazy[idx]) return;
	lazy[idx] = 0;
	st[idx] = 0;
	if (i != j)
	{
		lazy[esq(idx)] = 1;
		lazy[dir(idx)] = 1;
	}
	lazy[idx] = 0;
}
 
void update(int idx, int i, int j, int l, int r)
{
	push(idx, i, j);
	if (i > r || j < l) return;
	if (i >= l && j <= r)
	{
		lazy[idx] = 1;
		push(idx, i, j);
		return;
	}
	int mid = (i+j)>>1;
	update(esq(idx), i, mid, l, r);
	update(dir(idx), mid+1, j, l, r);
	st[idx] = st[esq(idx)] + st[dir(idx)];
}
 
int posicao(int idx, int i, int j, int pos)
{
	push(idx, i, j);
	if (i==j) return i;
	int mid = (i+j)>>1;
	if (pos <= st[esq(idx)]) return posicao(esq(idx), i, mid, pos);
	return posicao(dir(idx), mid+1, j, pos-st[esq(idx)]);
}
 
int maior(int idx, int i, int j, int l, int r)
{
	if (i > r || j < l) return 0;
	if (i >= l && j <= r) return st1[idx];
	int mid = (i+j)>>1;
	int x = maior(esq(idx), i, mid, l, r);
	int y = maior(dir(idx), mid+1, j, l, r);
	return max(x, y);
}
 
void bfs(int n)
{
	int u = total, p = 0;
	queue<par> fila;
	fila.push({u, p});
	while (!fila.empty())
	{
		auto[u, p] = fila.front(); fila.pop();
		if (u > n && maior(1, 1, n, intervalo[u].first, intervalo[u].second-1) > r) resp[u] = -1;
		ans.push_back({resp[u], -intervalo[u].first});
		for (int v : grafo[u])
		{
			if (v==p) continue;
			resp[v] = max(resp[v], 1+resp[u]);
			fila.push({v, u});
		}
	}
}
 
int GetBestPosition(int n, int c, int R, int *k, int *a, int *b)
{
	r = R;
	total = n;
	for (int i = 1; i <= n; i++) 
	{
		vertice[i] = i;
		prox[i] = i+1;
		intervalo[i] = {i, i};		
		if (i<n) val[i] = k[i-1];
	}
 
	build(1, 1, n);
 
	for (int i = 0; i < c; i++)
	{
		++total;
		int l = posicao(1, 1, n, a[i]+1);
		int r = posicao(1, 1, n, b[i]+1);
		int u = l;
		while (u != r)
		{
			grafo[vertice[u]].push_back(total);
			grafo[total].push_back(vertice[u]);
			u = prox[u];
		}
		grafo[vertice[u]].push_back(total);
		grafo[total].push_back(vertice[u]);
 
		vertice[l] = total;
		prox[l] = prox[r];
		intervalo[total] = {l, r};
		update(1, 1, n, l+1, r);
	}
 
	bfs(n);
	sort(all(ans), greater<par>());
 
	return -(ans[0].second+1);	
}
/*
int main()
 {
 	cin >> n >> c >> r;
 	for (int i = 1; i < n; i++)
 		cin >> val[i];
 
 	for (int i = 0; i < c; i++)
 		cin >> a1[i] >> a2[i];
	
 	cout << GetBestPosition(n, c, r, val, a1, a2) << endl;
 }
 */

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