oj.uz

Submission #86351

# Submission time Handle Problem Language Result Execution time Memory
86351 2018-11-26T07:52:49 Z dimash241 Turnir (COCI17_turnir) C++17
100 / 100
 1018 ms 48776 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = (1 << 20) + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int cnt[N];
string s;
int a[N];
vector < int > g[N];
int u[N];
int ans, res;
int cur;
vector < int > v;

int calc (int x) {
	if (!x) return 0;
	for (int i = n - 1; i >= 0; i --) {
		if (x > (1 << i)) x -= (1 << i);
		else return n - i;
	}
	return x;
}

int main () {               
    cin >> n;
    For (i, 1, (1 << n)) {
    	cin >> a[i];
    	v.pb(a[i]);
    }

    sort(every(v));
    For (i, 1, (1 << n)) {
    //	int id = upper_bound(every(v), a[i]) - a - 2;
    	//cout << id << ' ' << a[(1 << n) - id] << ' ' ; 
    	cout << calc(v.end() - upper_bound(every(v), a[i])) << ' ';
    }
    return Accepted;
}

// Coded By OB

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 24952 KB Output is correct
2 Correct 25 ms 25088 KB Output is correct
3 Correct 25 ms 25168 KB Output is correct
4 Correct 29 ms 25340 KB Output is correct
5 Correct 45 ms 25816 KB Output is correct
6 Correct 75 ms 26600 KB Output is correct
7 Correct 122 ms 27944 KB Output is correct
8 Correct 214 ms 30476 KB Output is correct
9 Correct 485 ms 36712 KB Output is correct
10 Correct 1018 ms 48776 KB Output is correct