oj.uz

Submission #201512

# Submission time Handle Problem Language Result Execution time Memory
201512 2020-02-10T21:42:53 Z awlintqaa Turnir (COCI17_turnir) C++14
100 / 100
 2685 ms 56660 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf=1e18;
const ld pai=acos(-1); 
int n;
vi v;
int a[(1<<20)+9];
map<int,int>num,ans;
int calc(int x){
        int mx=0;
        for(int i=0;i<=n;i++){
                if((1<<i)>x)break;
                mx=i;
        }
        return n-mx;
}
int main(){
        cin>>n;
        for(int i=0;i<(1<<n);i++){
                cin>>a[i];
                num[a[i]]++;
                if(num[a[i]]==1){
                        v.pb(a[i]);
                }
        }
        sort(v.begin(),v.end());
        int crnt=0;
        for(auto u:v){
                crnt+=num[u];
                ans[u]=calc(crnt);
        }
        for(int i=0;i<(1<<n);i++)cout<<ans[a[i]]<<" ";
        cout<<endl;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 37 ms 1400 KB Output is correct
6 Correct 93 ms 4724 KB Output is correct
7 Correct 177 ms 6644 KB Output is correct
8 Correct 231 ms 2936 KB Output is correct
9 Correct 1265 ms 35172 KB Output is correct
10 Correct 2685 ms 56660 KB Output is correct