oj.uz

Submission #510489

# Submission time Handle Problem Language Result Execution time Memory
510489 2022-01-15T01:28:52 Z tabr Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 366 ms 24048 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++) {
            p[c[i][j]][c[i][(j + 1) % sz]] = p[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 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 256 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 189 ms 24028 KB Output is correct

Subtask #2
10.0 / 10.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 256 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 189 ms 24028 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1200 KB Output is correct
13 Correct 321 ms 23968 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 788 KB Output is correct
17 Correct 95 ms 14060 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 74 ms 6256 KB Output is correct
21 Correct 279 ms 23956 KB Output is correct
22 Correct 254 ms 23972 KB Output is correct
23 Correct 289 ms 24032 KB Output is correct
24 Correct 366 ms 24048 KB Output is correct
25 Correct 108 ms 14080 KB Output is correct
26 Correct 82 ms 14056 KB Output is correct
27 Correct 304 ms 23920 KB Output is correct
28 Correct 234 ms 23932 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 292 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Incorrect 1 ms 292 KB Too few ways to get from 0 to 1, should be 2 found 0
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 296 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 256 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 189 ms 24028 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1200 KB Output is correct
13 Correct 321 ms 23968 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 788 KB Output is correct
17 Correct 95 ms 14060 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 74 ms 6256 KB Output is correct
21 Correct 279 ms 23956 KB Output is correct
22 Correct 254 ms 23972 KB Output is correct
23 Correct 289 ms 24032 KB Output is correct
24 Correct 366 ms 24048 KB Output is correct
25 Correct 108 ms 14080 KB Output is correct
26 Correct 82 ms 14056 KB Output is correct
27 Correct 304 ms 23920 KB Output is correct
28 Correct 234 ms 23932 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 292 KB Output is correct
32 Correct 1 ms 276 KB Output is correct
33 Incorrect 1 ms 292 KB Too few ways to get from 0 to 1, should be 2 found 0
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 256 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 189 ms 24028 KB Output is correct
8 Correct 1 ms 268 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 14 ms 1200 KB Output is correct
13 Correct 321 ms 23968 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 788 KB Output is correct
17 Correct 95 ms 14060 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 74 ms 6256 KB Output is correct
21 Correct 279 ms 23956 KB Output is correct
22 Correct 254 ms 23972 KB Output is correct
23 Correct 289 ms 24032 KB Output is correct
24 Correct 366 ms 24048 KB Output is correct
25 Correct 108 ms 14080 KB Output is correct
26 Correct 82 ms 14056 KB Output is correct
27 Correct 304 ms 23920 KB Output is correct
28 Correct 234 ms 23932 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 292 KB Output is correct
32 Correct 1 ms 276 KB Output is correct
33 Incorrect 1 ms 292 KB Too few ways to get from 0 to 1, should be 2 found 0
34 Halted 0 ms 0 KB -