# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
201511 |
2020-02-10T21:41:52 Z |
awlintqaa |
Turnir (COCI17_turnir) |
C++14 |
|
1750 ms |
65540 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);
ll n;
vll v;
ll a[(1<<20)+9];
map<ll,ll>num,ans;
ll calc(ll x){
ll mx=0;
for(ll i=0;i<=n;i++){
if((1<<i)>x)break;
mx=i;
}
return n-mx;
}
int main(){
cin>>n;
for(ll 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());
ll crnt=0;
for(auto u:v){
crnt+=num[u];
ans[u]=calc(crnt);
}
for(ll i=0;i<(1<<n);i++)cout<<ans[a[i]]<<" ";
cout<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
376 KB |
Output is correct |
2 |
Correct |
6 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
8 ms |
504 KB |
Output is correct |
5 |
Correct |
38 ms |
2168 KB |
Output is correct |
6 |
Correct |
109 ms |
7144 KB |
Output is correct |
7 |
Correct |
184 ms |
9840 KB |
Output is correct |
8 |
Correct |
234 ms |
5496 KB |
Output is correct |
9 |
Correct |
1531 ms |
52424 KB |
Output is correct |
10 |
Runtime error |
1750 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |