oj.uz

Submission #438725

# Submission time Handle Problem Language Result Execution time Memory
438725 2021-06-28T14:25:29 Z SorahISA Hop (COCI21_hop) C++17
110 / 110
 52 ms 1352 KB 
// #pragma GCC optimize("Ofast", "unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false), cin.tie(0)

void solve() {
    int n; cin >> n;
    
    vector<int> v(n);
    for (auto &x : v) cin >> x;
    
    vector<int> dis(n, 0);
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (v[i] % v[j] == 0) dis[i] = max(dis[i], dis[j] + 1);
        }
    }
    
    for (int i = 1, tok = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (dis[i] / 4 == dis[j] / 4) cout << 1;
            else if (dis[i] / 16 == dis[j] / 16) cout << 2;
            else cout << 3;
            cout << " \n"[j == i-1];
        }
    }
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    while (t--) solve();
    
    return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:34:21: warning: unused variable 'tok' [-Wunused-variable]
   34 |     for (int i = 1, tok = 0; i < n; ++i) {
      |                     ^~~

Subtask #1
10.0 / 10.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 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct

Subtask #2
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 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 48 ms 1352 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 52 ms 1080 KB Output is correct
12 Correct 46 ms 1300 KB Output is correct
13 Correct 44 ms 1228 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 43 ms 1092 KB Output is correct
16 Correct 43 ms 1092 KB Output is correct
17 Correct 44 ms 1220 KB Output is correct
18 Correct 47 ms 1092 KB Output is correct
19 Correct 48 ms 1092 KB Output is correct
20 Correct 45 ms 1092 KB Output is correct
21 Correct 47 ms 1092 KB Output is correct
22 Correct 43 ms 1140 KB Output is correct
23 Correct 48 ms 1304 KB Output is correct