oj.uz

Submission #409689

# Submission time Handle Problem Language Result Execution time Memory
409689 2021-05-21T10:55:32 Z LptN21 Turnir (COCI17_turnir) C++14
100 / 100
 1861 ms 54636 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e15
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 1048576+7, M=1e7+1;
const int MOD = 1e9+7;

int n, m, k, t;

int a[N];
map<int, int> cnt, lbl;

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    scanf("%d", &n);int co=0;
    for(int i=1;i<=(1<<n);i++) {
        scanf("%d", &a[i]);
        cnt[a[i]]++;
    }
    for(auto p:cnt)
        co+=p.SS, lbl[p.FF]=n-(int)log2(co);
    for(int i=1;i<=(1<<n);i++) printf("%d ", lbl[a[i]]);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Compilation message

turnir.cpp: In function 'int main()':
turnir.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf("%d", &n);int co=0;
      |     ~~~~~^~~~~~~~~~
turnir.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 20 ms 1420 KB Output is correct
6 Correct 57 ms 4732 KB Output is correct
7 Correct 110 ms 7020 KB Output is correct
8 Correct 141 ms 3904 KB Output is correct
9 Correct 837 ms 37160 KB Output is correct
10 Correct 1861 ms 54636 KB Output is correct