제출 #100738

#제출 시각아이디문제언어결과실행 시간메모리
100738dalgerokTurnir (COCI17_turnir)C++17
0 / 100
299 ms21596 KiB
#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] << " "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...