oj.uz

답안 #1032890

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032890 2024-07-24T10:27:14 Z Zicrus 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 149 ms 24484 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

typedef long long ll;

vector<ll> lnk1, lnk2;

ll find1(ll a) {
    if (lnk1[a] != a) lnk1[a] = find1(lnk1[a]);
    return lnk1[a];
}

ll find2(ll a) {
    if (lnk2[a] != a) lnk2[a] = find2(lnk2[a]);
    return lnk2[a];
}

void unite1(ll a, ll b) {
    a = find1(a); b = find1(b);
    lnk1[b] = a;
}

void unite2(ll a, ll b) {
    a = find2(a); b = find2(b);
    lnk2[b] = a;
}

int construct(vector<vector<int>> p) {
    ll n = p.size();
    lnk1 = vector<ll>(p.size());
    lnk2 = vector<ll>(p.size());
    for (int i = 0; i < n; i++) lnk1[i] = lnk2[i] = i;
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (p[i][j] == 3) return 0;
            if (p[i][j] == 2) unite2(i, j);
            if (p[i][j] == 1) unite1(i, j);
        }
    }

    vector<set<ll>> clubs1(n), clubs2(n);
    for (int i = 0; i < n; i++) {
        clubs1[find1(i)].insert(i);
        clubs2[find2(i)].insert(find1(i));
    }

    vector<vector<int>> res(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        if (clubs2[i].size() > 1) {
            if (clubs2.size() == 2) return 0;
            ll prev = *--clubs2[i].end();
            for (auto &e : clubs2[i]) {
                res[prev][e] = 1;
                res[e][prev] = 1;
                unite2(e, prev);
                prev = e;
            }
        }
        if (clubs1[i].size() > 1) {
            ll prev = -1;
            for (auto &e : clubs1[i]) {
                if (prev != -1) {
                    res[prev][e] = 1;
                    res[e][prev] = 1;
                    unite2(e, prev);
                }
                prev = e;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (p[i][j] == 0 && find2(i) == find2(j)) return 0;
            if (p[i][j] == 2 && find1(i) == find1(j)) return 0;
        }
    }

    build(res);
    return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 114 ms 24280 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 114 ms 24280 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1376 KB Output is correct
13 Correct 115 ms 24340 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 63 ms 14252 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 29 ms 6428 KB Output is correct
21 Correct 113 ms 24404 KB Output is correct
22 Correct 113 ms 24148 KB Output is correct
23 Correct 120 ms 24484 KB Output is correct
24 Correct 148 ms 24148 KB Output is correct
25 Correct 53 ms 14420 KB Output is correct
26 Correct 49 ms 14248 KB Output is correct
27 Correct 119 ms 24324 KB Output is correct
28 Correct 115 ms 24156 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 149 ms 24404 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1216 KB Output is correct
13 Correct 117 ms 24320 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 60 ms 14200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 436 KB Output is correct
21 Correct 29 ms 6492 KB Output is correct
22 Correct 120 ms 24148 KB Output is correct
23 Correct 120 ms 24184 KB Output is correct
24 Correct 120 ms 24304 KB Output is correct
25 Incorrect 116 ms 24328 KB Answer gives possible 1 while actual possible 0
26 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 35 ms 6364 KB Output is correct
5 Correct 117 ms 24144 KB Output is correct
6 Correct 124 ms 24400 KB Output is correct
7 Correct 120 ms 24148 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 31 ms 6268 KB Output is correct
10 Correct 127 ms 24312 KB Output is correct
11 Correct 130 ms 24332 KB Output is correct
12 Correct 125 ms 24148 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 29 ms 6372 KB Output is correct
17 Correct 127 ms 24132 KB Output is correct
18 Correct 127 ms 24144 KB Output is correct
19 Correct 122 ms 24144 KB Output is correct
20 Correct 141 ms 24248 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 114 ms 24280 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1376 KB Output is correct
13 Correct 115 ms 24340 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 63 ms 14252 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 29 ms 6428 KB Output is correct
21 Correct 113 ms 24404 KB Output is correct
22 Correct 113 ms 24148 KB Output is correct
23 Correct 120 ms 24484 KB Output is correct
24 Correct 148 ms 24148 KB Output is correct
25 Correct 53 ms 14420 KB Output is correct
26 Correct 49 ms 14248 KB Output is correct
27 Correct 119 ms 24324 KB Output is correct
28 Correct 115 ms 24156 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 149 ms 24404 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1216 KB Output is correct
41 Correct 117 ms 24320 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 60 ms 14200 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 29 ms 6492 KB Output is correct
50 Correct 120 ms 24148 KB Output is correct
51 Correct 120 ms 24184 KB Output is correct
52 Correct 120 ms 24304 KB Output is correct
53 Incorrect 116 ms 24328 KB Answer gives possible 1 while actual possible 0
54 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 114 ms 24280 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1376 KB Output is correct
13 Correct 115 ms 24340 KB Output is correct
14 Correct 0 ms 352 KB Output is correct
15 Correct 0 ms 356 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 63 ms 14252 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 29 ms 6428 KB Output is correct
21 Correct 113 ms 24404 KB Output is correct
22 Correct 113 ms 24148 KB Output is correct
23 Correct 120 ms 24484 KB Output is correct
24 Correct 148 ms 24148 KB Output is correct
25 Correct 53 ms 14420 KB Output is correct
26 Correct 49 ms 14248 KB Output is correct
27 Correct 119 ms 24324 KB Output is correct
28 Correct 115 ms 24156 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 149 ms 24404 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1216 KB Output is correct
41 Correct 117 ms 24320 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 60 ms 14200 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 29 ms 6492 KB Output is correct
50 Correct 120 ms 24148 KB Output is correct
51 Correct 120 ms 24184 KB Output is correct
52 Correct 120 ms 24304 KB Output is correct
53 Incorrect 116 ms 24328 KB Answer gives possible 1 while actual possible 0
54 Halted 0 ms 0 KB -