oj.uz

답안 #382033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
382033 2021-03-26T10:02:09 Z kartel Hop (COCI21_hop) C++14
110 / 110
 50 ms 6252 KB 
#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.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct

Subtask #2
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 50 ms 5612 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 43 ms 5996 KB Output is correct
12 Correct 48 ms 5612 KB Output is correct
13 Correct 43 ms 6124 KB Output is correct
14 Correct 4 ms 1260 KB Output is correct
15 Correct 43 ms 6124 KB Output is correct
16 Correct 43 ms 6124 KB Output is correct
17 Correct 44 ms 6124 KB Output is correct
18 Correct 43 ms 6100 KB Output is correct
19 Correct 44 ms 6252 KB Output is correct
20 Correct 43 ms 6124 KB Output is correct
21 Correct 43 ms 6124 KB Output is correct
22 Correct 43 ms 6124 KB Output is correct
23 Correct 46 ms 5612 KB Output is correct