oj.uz

Submission #381994

# Submission time Handle Problem Language Result Execution time Memory
381994 2021-03-26T08:44:46 Z ne4eHbKa Hop (COCI21_hop) C++17
110 / 110
 48 ms 1388 KB 
#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef int8_t byte;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
    void add(int &a, const int b) {if((a += b) >= md) a -= md;}
    void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
    int prod(const int a, const int b) {return ll(a) * b % md;}
};

void solve() {
    vector<ll> f;
    for(ll i = 1; i <= 1e18; ++(i *= 8))
        f.push_back(i);
    f.push_back(1e18);
    int n; cin >> n;
    int t[n];
    for(int i = 0; i < n; ++i) {
        ll x; cin >> x;
        t[i] = upper_bound(bnd(f), x) - f.begin();
        if(i) {
            for(int j = 0; j < i; ++j) {
                if(j) cout << ' ';
                cout << (t[i] == t[j] ? 1 : t[i] / 8 != t[j] / 8 ? 3 : 2);
            }
            cout << '\n';
        }
    }
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef _LOCAL
//    freopen("file.in", "r", stdin);
//    freopen("file.out", "w", stdout);
#else
    system("color a");
    freopen("in.txt", "r", stdin);
    int t; cin >> t;
    while(t--)
#endif
    solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 43 ms 1388 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 37 ms 1260 KB Output is correct
12 Correct 45 ms 1388 KB Output is correct
13 Correct 42 ms 1260 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 48 ms 1260 KB Output is correct
16 Correct 40 ms 1260 KB Output is correct
17 Correct 39 ms 1260 KB Output is correct
18 Correct 40 ms 1388 KB Output is correct
19 Correct 40 ms 1260 KB Output is correct
20 Correct 38 ms 1260 KB Output is correct
21 Correct 38 ms 1260 KB Output is correct
22 Correct 38 ms 1260 KB Output is correct
23 Correct 44 ms 1388 KB Output is correct