oj.uz

답안 #369586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369586 2021-02-22T00:38:29 Z TosakaUCW Turnir (COCI17_turnir) C++17
100 / 100
 609 ms 39772 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <math.h>

int read(int x = 0, int f = 0, char ch = getchar())
{
    while ('0' > ch or ch > '9')
        f = ch == '-', ch = getchar();
    while ('0' <= ch and ch <= '9')
        x = x * 10 + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

int main()
{
    // freopen("turnir.in", "r", stdin), freopen("turnir.out", "w", stdout);
    int n = read();
    std::vector<int> b(1 << n);
    std::vector<std::pair<int, int>> a(1 << n);
    for (int i = 0; i < (1 << n); i++)
        a[i] = {read(), i}, b[i] = a[i].first;
    std::sort(a.begin(), a.end());
    std::unordered_map<int, int> ans;
    for (int i = 0; i < (1 << n); i++)
        ans[a[i].first] = std::max(ans[a[i].first], int(floor(log2(i + 1))));
    for (int i = 0; i < (1 << n); i++)
        printf("%d ", n - ans[b[i]]);
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 11 ms 1388 KB Output is correct
6 Correct 25 ms 3320 KB Output is correct
7 Correct 50 ms 5112 KB Output is correct
8 Correct 87 ms 5612 KB Output is correct
9 Correct 341 ms 25308 KB Output is correct
10 Correct 609 ms 39772 KB Output is correct