oj.uz

답안 #370590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370590 2021-02-24T07:49:21 Z Atill83 Turnir (COCI17_turnir) C++14
100 / 100
 332 ms 19692 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 2e6+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
pii a[MAXN];
int ans[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 0; i < (1<<n); i++){
        cin>>a[i].ff;
        a[i].ss = i;
    }

    sort(a, a + (1<<n));
    int cur = n;
    for(int i = 0; i < (1<<n); i++){
        int bef = i;
        if((1<<(n - cur + 1)) - 1  <= i){
            cur--;
        }
        ans[a[i].ss] = cur;
    }

    for(int i = (1<<n) - 1; i > 0; i--){
        if(a[i - 1].ff == a[i].ff){
            ans[a[i - 1].ss] = ans[a[i].ss];
        }
    }


    for(int i = 0; i < (1<<n); i++)
        cout<<ans[i]<<" ";

    

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

turnir.cpp: In function 'int main()':
turnir.cpp:36:13: warning: unused variable 'bef' [-Wunused-variable]
   36 |         int bef = i;
      |             ^~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 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 13 ms 896 KB Output is correct
6 Correct 19 ms 1260 KB Output is correct
7 Correct 38 ms 2156 KB Output is correct
8 Correct 78 ms 4076 KB Output is correct
9 Correct 154 ms 8940 KB Output is correct
10 Correct 332 ms 19692 KB Output is correct