# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240934 | SamAnd | Turnir (COCI17_turnir) | C++17 | 369 ms | 21752 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 20;
struct ban
{
int i, x;
};
bool operator<(const ban& a, const ban& b)
{
return a.x < b.x;
}
int n;
ban a[(1 << N) + 5];
int ans[(1 << N) + 5];
void solv()
{
scanf("%d", &n);
for (int i = 0; i < (1 << n); ++i)
{
scanf("%d", &a[i].x);
a[i].i = i;
}
sort(a, a + (1 << n));
int u = 0;
for (int i = 0; i < (1 << n); ++i)
{
if (a[i].x == a[i + 1].x)
continue;
while ((i + 1) >= (1 << (u + 1)))
++u;
for (int j = i; j >= 0; --j)
{
if (a[j].x != a[i].x)
break;
ans[a[j].i] = n - u;
}
}
for (int i = 0; i < (1 << n); ++i)
printf("%d ", ans[i]);
printf("\n");
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |