# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147731 | nicolaalexandra | Turnir (COCI17_turnir) | C++14 | 815 ms | 25792 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 <iostream>
#include <algorithm>
#define DIM 2000000
using namespace std;
pair <int,int> v[DIM];
int sol[DIM],p[DIM];
int n,i,maxi,m,j;
int main (){
cin>>n;
m = n, n = (1<<n);
for (i=1;i<=n;i++){
cin>>v[i].first;
v[i].second = i;
}
for (i=2;i<=n;i++)
p[i] = p[i/2]+1;
sort (v+1,v+n+1);
j = 1;
for (i=1;i<=n;i++){
while (j < n && v[j+1].first <= v[i].first)
j++;
sol[v[i].second] = m-p[j];
}
for (i=1;i<=n;i++)
cout<<sol[i]<<" ";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |