oj.uz

Submission #510502

# Submission time Handle Problem Language Result Execution time Memory
510502 2022-01-15T01:32:19 Z tabr Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 272 ms 24060 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

void build(vector<vector<int>>);

int construct(vector<vector<int>> p) {
    int n = (int) p.size();
    vector<int> a(n);
    iota(a.begin(), a.end(), 0);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] == 1) {
                a[j] = min(a[j], i);
            }
        }
    }
    vector<vector<int>> res(n, vector<int>(n));
    vector<vector<int>> c(n);
    for (int i = 0; i < n; i++) {
        if (a[i] < i) {
            res[a[i]][i] = res[i][a[i]] = 1;
        }
        c[a[i]].emplace_back(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] != p[a[i]][a[j]]) {
                return 0;
            }
        }
    }
    vector<int> b(n);
    iota(b.begin(), b.end(), 0);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (a[i] == i && a[j] == j && p[i][j] == 2) {
                b[j] = min(b[j], i);
            }
        }
    }
    c = vector<vector<int>>(n);
    for (int i = 0; i < n; i++) {
        if (a[i] == i) {
            c[b[i]].emplace_back(i);
        }
    }
    for (int i = 0; i < n; i++) {
        int sz = (int) c[i].size();
        if (sz == 0 || sz == 1) {
            continue;
        }
        if (sz == 2) {
            return 0;
        }
        for (int j = 0; j < sz; j++) {
            res[c[i][j]][c[i][(j + 1) % sz]] = res[c[i][(j + 1) % sz]][c[i][j]] = 1;
        }
    }
    build(res);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 272 ms 22012 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 272 ms 22012 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1164 KB Output is correct
13 Correct 252 ms 22024 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 83 ms 12152 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 50 ms 5696 KB Output is correct
21 Correct 220 ms 22012 KB Output is correct
22 Correct 250 ms 21984 KB Output is correct
23 Correct 239 ms 22048 KB Output is correct
24 Correct 234 ms 22008 KB Output is correct
25 Correct 89 ms 12040 KB Output is correct
26 Correct 71 ms 12152 KB Output is correct
27 Correct 191 ms 22076 KB Output is correct
28 Correct 183 ms 22096 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 9 ms 1192 KB Output is correct
9 Correct 253 ms 24040 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 220 ms 23916 KB Output is correct
14 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.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 272 KB Output is correct
4 Correct 45 ms 6244 KB Output is correct
5 Correct 213 ms 23916 KB Output is correct
6 Correct 211 ms 24040 KB Output is correct
7 Correct 243 ms 23988 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 67 ms 6232 KB Output is correct
10 Correct 243 ms 24044 KB Output is correct
11 Correct 207 ms 24040 KB Output is correct
12 Correct 214 ms 23920 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 61 ms 6172 KB Output is correct
17 Correct 223 ms 24044 KB Output is correct
18 Correct 264 ms 23948 KB Output is correct
19 Correct 199 ms 24060 KB Output is correct
20 Correct 198 ms 23976 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 272 ms 22012 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1164 KB Output is correct
13 Correct 252 ms 22024 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 83 ms 12152 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 50 ms 5696 KB Output is correct
21 Correct 220 ms 22012 KB Output is correct
22 Correct 250 ms 21984 KB Output is correct
23 Correct 239 ms 22048 KB Output is correct
24 Correct 234 ms 22008 KB Output is correct
25 Correct 89 ms 12040 KB Output is correct
26 Correct 71 ms 12152 KB Output is correct
27 Correct 191 ms 22076 KB Output is correct
28 Correct 183 ms 22096 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 9 ms 1192 KB Output is correct
37 Correct 253 ms 24040 KB Output is correct
38 Correct 1 ms 292 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1228 KB Output is correct
41 Correct 220 ms 23916 KB Output is correct
42 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1100 KB Output is correct
7 Correct 272 ms 22012 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1164 KB Output is correct
13 Correct 252 ms 22024 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 83 ms 12152 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 50 ms 5696 KB Output is correct
21 Correct 220 ms 22012 KB Output is correct
22 Correct 250 ms 21984 KB Output is correct
23 Correct 239 ms 22048 KB Output is correct
24 Correct 234 ms 22008 KB Output is correct
25 Correct 89 ms 12040 KB Output is correct
26 Correct 71 ms 12152 KB Output is correct
27 Correct 191 ms 22076 KB Output is correct
28 Correct 183 ms 22096 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 9 ms 1192 KB Output is correct
37 Correct 253 ms 24040 KB Output is correct
38 Correct 1 ms 292 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 8 ms 1228 KB Output is correct
41 Correct 220 ms 23916 KB Output is correct
42 Incorrect 1 ms 204 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -