# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370590 | Atill83 | Turnir (COCI17_turnir) | C++14 | 332 ms | 19692 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 ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 2e6+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
pii a[MAXN];
int ans[MAXN];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
cin>>n;
for(int i = 0; i < (1<<n); i++){
cin>>a[i].ff;
a[i].ss = i;
}
sort(a, a + (1<<n));
int cur = n;
for(int i = 0; i < (1<<n); i++){
int bef = i;
if((1<<(n - cur + 1)) - 1 <= i){
cur--;
}
ans[a[i].ss] = cur;
}
for(int i = (1<<n) - 1; i > 0; i--){
if(a[i - 1].ff == a[i].ff){
ans[a[i - 1].ss] = ans[a[i].ss];
}
}
for(int i = 0; i < (1<<n); i++)
cout<<ans[i]<<" ";
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |