oj.uz

Submission #791946

# Submission time Handle Problem Language Result Execution time Memory
791946 2023-07-24T12:46:43 Z hazzle Hop (COCI21_hop) C++17
110 / 110
 34 ms 5260 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("avx2")

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;

template <typename T>
using prq = priority_queue <T>;

template <typename T>
using pgq = priority_queue <T, vec <T>, greater <T>>;

template <typename T> bool umin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T> bool umax(T &a, T b) { return a < b ? a = b, 1 : 0; }

inline int solve(){
      int n; cin >> n;
      vec <ll> a(n);
      for (auto &i: a) cin >> i;
      vec <vec <int>> ans(n, vec <int> (n));
      for (int i = 0; i < n; ++i){
            for (int j = 0; j < i; ++j){
                  ans[i][j] = 3;
                  if (a[i] % a[j] == 0){
                        int li = 63 - __builtin_clzl(a[i]);
                        int lj = 63 - __builtin_clzl(a[j]);
                        for (int s: {2, 4}){
                              if ((li >> s) == (lj >> s)){
                                    ans[i][j] = s / 2;
                                    break;
                              }
                        }
                  }
            }
      }
      for (int i = 1; i < n; ++i){
            for (int j = 0; j < i; ++j){
                  cout << ans[i][j] << " ";
            }
            cout << "\n";
      }
      return 0;
}

inline void precalc(){}

signed main(){
      ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
      int tst = 1; //cin >> tst;
      precalc();
      while(tst--) solve();
      return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 0 ms 324 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 28 ms 5260 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 26 ms 4420 KB Output is correct
12 Correct 27 ms 5204 KB Output is correct
13 Correct 33 ms 4644 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 25 ms 4596 KB Output is correct
16 Correct 25 ms 4660 KB Output is correct
17 Correct 26 ms 4692 KB Output is correct
18 Correct 25 ms 4672 KB Output is correct
19 Correct 25 ms 4592 KB Output is correct
20 Correct 26 ms 4652 KB Output is correct
21 Correct 34 ms 4572 KB Output is correct
22 Correct 25 ms 4556 KB Output is correct
23 Correct 27 ms 5196 KB Output is correct