Submission #544855

# Submission time Handle Problem Language Result Execution time Memory
544855 2022-04-02T21:19:11 Z MilosMilutinovic Jousting tournament (IOI12_tournament) C++14
100 / 100
164 ms 16116 KB
#include<bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}

int n,a[100005],fnw[100005],sl[200005],sr[200005],fa[200005],dep[200005],pos=10000000;
vector<int> g[200005];

int getf(int x){return fa[x]==x?x:fa[x]=getf(fa[x]);}

void modify(int x,int v){
	for(;x<100005;x+=x&-x)fnw[x]+=v;
}

int query(int x){
	int s=0;
	for(;x>0;x-=x&-x)s+=fnw[x];
	return s;
}

int getp(int x){
	int l=0,r=100004,p=0;
	while(l<=r){
		int m=(l+r)/2;
		if(query(m)<x)p=m,l=m+1; else r=m-1;
	}
	return p+1;
}

void dfs(int x){
	if(x<=n)return (void)(pos=min(pos,x));
	sort(g[x].begin(),g[x].end(),[&](int i,int j){return dep[i]>dep[j]||(dep[i]==dep[j]&&sl[i]<sl[j]);});
	dfs(g[x][0]);
}

int GetBestPosition(int N,int C,int R,int*K,int*S,int*E){
	a[1]=R;n=N;
	for(int i=2;i<=N;i++)a[i]=K[i-2];
	for(int i=1;i<=N;i++)a[i]=(a[i]>R?1:0);
	set<int> st;
	for(int i=1;i<=N;i++)modify(i,1),st.insert(i);
	for(int i=1;i<=N;i++)sl[i]=sr[i]=fa[i]=i;
	for(int i=N+1;i<=N+C;i++)fa[i]=i,sl[i]=N+C,sr[i]=0;
	for(int i=1;i<=C;i++){
		int l=getp(S[i-1]+1),r=getp(E[i-1]+1);
		assert(l>=1&&r<=n);
		while(1){
			auto it=st.lower_bound(l);
			if(it==st.end()||*it>r)break;
			chkmax(dep[N+i],dep[getf(*it)]);
			chkmin(sl[N+i],sl[getf(*it)]);
			chkmax(sr[N+i],sr[getf(*it)]);
			g[N+i].pb(getf(*it));
			modify(*it,-1);
			st.erase(it);
		}
		modify(l,1);
		st.insert(l);
		fa[getf(l)]=N+i;
		dep[N+i]++;
//		for(int j=1;j<=N;j++)printf("%d ",query(j)-query(j-1));puts("");
	}
	int ans=0;
	for(int i=1;i<=N;i++)a[i]=a[i-1]+a[i];
	for(int i=N+1;i<=N+C;i++)if(a[sr[i]]==a[sl[i]]&&ans<dep[i])ans=dep[i];
	for(int i=N+1;i<=N+C;i++)if(a[sr[i]]==a[sl[i]]&&ans==dep[i])dfs(i);
	return (pos>n?0:pos-1);
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 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 3 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 4 ms 5080 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 7 ms 5460 KB Output is correct
3 Correct 5 ms 5332 KB Output is correct
4 Correct 8 ms 5460 KB Output is correct
5 Correct 7 ms 5460 KB Output is correct
6 Correct 10 ms 5460 KB Output is correct
7 Correct 8 ms 5460 KB Output is correct
8 Correct 10 ms 5460 KB Output is correct
9 Correct 4 ms 5332 KB Output is correct
10 Correct 10 ms 5460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 75 ms 9260 KB Output is correct
2 Correct 150 ms 14400 KB Output is correct
3 Correct 50 ms 12816 KB Output is correct
4 Correct 122 ms 16064 KB Output is correct
5 Correct 122 ms 15500 KB Output is correct
6 Correct 164 ms 14876 KB Output is correct
7 Correct 125 ms 16116 KB Output is correct
8 Correct 125 ms 16004 KB Output is correct
9 Correct 44 ms 12748 KB Output is correct
10 Correct 54 ms 12860 KB Output is correct