oj.uz

Submission #100738

# Submission time Handle Problem Language Result Execution time Memory
100738 2019-03-13T20:09:31 Z dalgerok Turnir (COCI17_turnir) C++17
0 / 100
 299 ms 21596 KB 
#include<bits/stdc++.h>
using namespace std;




int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin >> n;
    int m = n;
    n = (1 << n);
    pair < int, int > a[n + 1];
    for(int i = 1; i <= n; i++){
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a + 1, a + n + 1);
    int ans[n + 1];
    int cur = 0;
    for(int i = 1; i <= n; i++){
        if(a[i].first != a[i - 1].first){
            cur += 1;
        }
        int kek = 0, x = cur;
        while(x > 0){
            kek += 1;
            x /= 2;
        }
        ans[a[i].second] = m - kek;
    }
    for(int i = 1; i <= n; i++){
        cout << ans[i] << " ";
    }
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 6 ms 512 KB Output isn't correct
5 Incorrect 11 ms 896 KB Output isn't correct
6 Incorrect 18 ms 1636 KB Output isn't correct
7 Incorrect 38 ms 2936 KB Output isn't correct
8 Incorrect 69 ms 5240 KB Output isn't correct
9 Incorrect 148 ms 11004 KB Output isn't correct
10 Incorrect 299 ms 21596 KB Output isn't correct