Submission #382033

#	Time	Username	Problem	Language	Result	Execution time	Memory
382033		kartel	Hop (COCI21_hop)	C++14	110 / 110	50 ms	6252 KiB

Main

#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
//#define M ll(1e9 + 7)
#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
#define eps (ld)1e-9
using namespace std;
typedef long long ll;
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef double ld;
typedef unsigned long long ull;
typedef short int si;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());;

const int N = 1e3 + 50;

vector <int> g[N];
int ans[N][N];
int a[N];

void dfs(int v, int pr) {
    if (ans[pr][v]) {
        return;
    }

    ans[pr][v] = rand() % 3 + 1;

    for (auto u : g[v]) {
        dfs(u, v);
    }
}

int main()
{
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	in("toys.in");
//	out("toys.out");
//    in("input.txt");
//    out("output.txt");
//    cerr.precision(9); cerr << fixed;

//    clock_t tStart = clock();

    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];

        for (int j = 1; j < i; j++) {
            if (a[j] && a[i] % a[j] == 0) {
                g[j].pb(i);
            }
        }
    }
//
//    for (int i = 1; i <= n; i++) {
//        dfs(i, 0);
//    }

    for (int i = 2; i <= n; i++, cout << el) {
        for (int j = 1; j < i; j++) {
            if (!ans[j][i]) {
                ans[j][i] = 1;
            }

            cout << ans[j][i] << " ";
        }
    }
}


/*

7
4 6 7 2 3 1 5
*/

• Subtask 1: 10 / 10
• Subtask 2: 100 / 100