제출 #381994

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381994		ne4eHbKa	Hop (COCI21_hop)	C++17	110 / 110	48 ms	1388 KiB

Main

#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 / 10
• Subtask 2: 100 / 100