oj.uz

Submission #153837

# Submission time Handle Problem Language Result Execution time Memory
153837 2019-09-16T18:41:34 Z bogdan_buzatu Turnir (COCI17_turnir) C++14
100 / 100
 844 ms 15628 KB 
#include <iostream>
#include <algorithm>
#define pozitie second
#define numar first
using namespace std;
pair<int,int>v[2000100];
int n,x,s[2000100];
int main(){
    cin>>n;
    n=(1<<n);
    for(int i=1;i<=n;i++){
        cin>>v[i].numar;
        v[i].pozitie=i;
    }
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++){
        int lim=n;
        int sol=0;
        while(v[i].numar<v[lim].numar){
            sol++;
            lim/=2;
        }
        s[v[i].pozitie]=sol;

    }
    for(int i=1;i<=n;i++){
        cout<<s[i]<<" ";
    }


}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 6 ms 508 KB Output is correct
5 Correct 23 ms 940 KB Output is correct
6 Correct 48 ms 1628 KB Output is correct
7 Correct 96 ms 2936 KB Output is correct
8 Correct 177 ms 5212 KB Output is correct
9 Correct 409 ms 9068 KB Output is correct
10 Correct 844 ms 15628 KB Output is correct