oj.uz

답안 #633887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633887 2022-08-23T11:32:57 Z inksamurai Turnir (COCI17_turnir) C++17
100 / 100
 343 ms 26964 KB 
#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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 9 ms 1112 KB Output is correct
6 Correct 18 ms 2008 KB Output is correct
7 Correct 37 ms 3676 KB Output is correct
8 Correct 69 ms 6928 KB Output is correct
9 Correct 153 ms 13656 KB Output is correct
10 Correct 343 ms 26964 KB Output is correct