oj.uz

Submission #537791

# Submission time Handle Problem Language Result Execution time Memory
537791 2022-03-15T13:59:42 Z maomao90 Hop (COCI21_hop) C++17
110 / 110
 36 ms 1280 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

#define INF 1000000005
#define LINF 1000000000000000005ll
#define MAXN 1005

int n;
ll x[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 0, n) {
        cin >> x[i];
    }
    REP (i, 1, n) {
        int a = 63 - __builtin_clzll(x[i]);
        REP (j, 0, i) {
            int b = 63 - __builtin_clzll(x[j]);
            if (a / 4 == b / 4) {
                cout << 1 << ' ';
            } else if (a / 16 == b / 16) {
                cout << 2 << ' ';
            } else {
                cout << 3 << ' ';
            }
        }
        cout << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 36 ms 1268 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 30 ms 1120 KB Output is correct
12 Correct 36 ms 1280 KB Output is correct
13 Correct 30 ms 1120 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 31 ms 1132 KB Output is correct
16 Correct 32 ms 1120 KB Output is correct
17 Correct 33 ms 1128 KB Output is correct
18 Correct 30 ms 1168 KB Output is correct
19 Correct 32 ms 1148 KB Output is correct
20 Correct 31 ms 1152 KB Output is correct
21 Correct 34 ms 1140 KB Output is correct
22 Correct 31 ms 1140 KB Output is correct
23 Correct 36 ms 1228 KB Output is correct