제출 #633887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633887		inksamurai	Turnir (COCI17_turnir)	C++17	100 / 100	343 ms	26964 KiB

turnir

#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3PGDklf ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3PGDklf;
	int n;
	cin>>n;
	const int pon=1<<n;
	vec(pii) a(pon);
	rep(i,pon){
		cin>>a[i].fi;
		a[i].se=i;
	}
	sort(a.begin(), a.end());
	vi pns(pon);
	rep(i,pon){
		int v=a[i].fi;
		int l=0,r=pon-1;
		int c=-1;
		while(l<=r){
			int m=(l+r)/2;
			if(a[m].fi>v){
				r=m-1;
			}else{
				c=m,l=m+1;
			}
		}
		int res=n;
		rep(j,n+1){
			if((1<<j)-1<=c){
				res=n-j;
			}
		}
		pns[a[i].se]=res;
	}
	rep(i,pon){
		cout<<pns[i]<<" ";
	}
}

• Subtask 1: 100 / 100