# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201511 | awlintqaa | Turnir (COCI17_turnir) | C++14 | 1750 ms | 65540 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.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf=1e18;
const ld pai=acos(-1);
ll n;
vll v;
ll a[(1<<20)+9];
map<ll,ll>num,ans;
ll calc(ll x){
ll mx=0;
for(ll i=0;i<=n;i++){
if((1<<i)>x)break;
mx=i;
}
return n-mx;
}
int main(){
cin>>n;
for(ll i=0;i<(1<<n);i++){
cin>>a[i];
num[a[i]]++;
if(num[a[i]]==1){
v.pb(a[i]);
}
}
sort(v.begin(),v.end());
ll crnt=0;
for(auto u:v){
crnt+=num[u];
ans[u]=calc(crnt);
}
for(ll i=0;i<(1<<n);i++)cout<<ans[a[i]]<<" ";
cout<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |