# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633886 | inksamurai | Turnir (COCI17_turnir) | C++17 | 198 ms | 40652 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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(n);
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;
}
}
// if(i!=pon-1) continue;
int res=n;
rep(j,n+1){
if((1<<j)-1<=c){
// cout<<j<<" ";
res=n-j;
}
}
pns[a[i].se]=res;
}
rep(i,pon){
cout<<pns[i]<<" ";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |