oj.uz

Submission #349558

# Submission time Handle Problem Language Result Execution time Memory
349558 2021-01-17T19:34:58 Z izhang05 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 268 ms 24556 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e3 + 5;
int parent[maxn], parent2[maxn];
vector<int> comp[maxn], comp2[maxn];

int get(int x) {
    return parent[x] == x ? x : parent[x] = get(parent[x]);
}

bool merge(int x, int y) {
    int xroot = get(x), yroot = get(y);
    if (comp[xroot].size() < comp[yroot].size()) {
        swap(xroot, yroot);
    }
    if (xroot != yroot) {
        parent[xroot] = yroot;
        comp[yroot].insert(comp[yroot].end(), comp[xroot].begin(), comp[xroot].end());
        comp[xroot].clear();
        return true;
    }
    return false;
}

bool same(int x, int y) {
    return get(x) == get(y);
}

int get2(int x) {
    return parent2[x] == x ? x : parent2[x] = get2(parent2[x]);
}

bool merge2(int x, int y) {
    int xroot = get2(x), yroot = get2(y);
    if (comp2[xroot].size() < comp2[yroot].size()) {
        swap(xroot, yroot);
    }
    if (xroot != yroot) {
        parent2[xroot] = yroot;
        comp2[yroot].insert(comp2[yroot].end(), comp2[xroot].begin(), comp2[xroot].end());
        comp2[xroot].clear();
        return true;
    }
    return false;
}

bool same2(int x, int y) {
    return get2(x) == get2(y);
}

int construct(vector<vector<int>> p) {
    int n = p.size();
    for (int i = 0; i < n; ++i) {
        parent[i] = i;
        parent2[i] = i;
        comp[i].push_back(i);
        comp2[i].push_back(i);
        if (p[i][i] != 1) {
            return 0;
        }
    }
    vector<vector<int>> sol(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (p[i][j]) {
                merge(i, j);
            } else if (p[i][j] == 2) {
                merge2(i, j);
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (!p[i][j] && (same(i, j) || same2(i, j))) {
                return 0;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        if (comp[i].size() > 1) {
            for (int j = 0; j < (int) comp[i].size() - 1; ++j) {
                sol[comp[i][j]][comp[i][j + 1]] = 1;
                sol[comp[i][j + 1]][comp[i][j]] = 1;
            }
        }
        if (comp2[i].size() > 1) {
            for (int j = 0; j < (int) comp2[i].size() - 1; ++j) {
                sol[comp2[i][j]][comp2[i][j + 1]] = 1;
                sol[comp2[i][j + 1]][comp2[i][j]] = 1;
            }
            if (comp2[i].size() == 2) {
                return 0;
            }
            sol[comp2[i][0]][comp2[i][comp2[i].size() - 1]] = 1;
            sol[comp2[i][comp2[i].size() - 1]][comp2[i][0]] = 1;
        }
    }
    build(sol);
    return 1;
}

#ifdef DEBUG
int main() {
    freopen("1.in", "r", stdin);
    int n;
    cin >> n;
    vector<vector<int>> a(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> a[i][j];
        }
    }
    cout << construct(a) << "\n";
}
#endif

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 258 ms 24556 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 258 ms 24556 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 258 ms 22636 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 114 ms 14700 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 67 ms 6124 KB Output is correct
21 Correct 255 ms 22764 KB Output is correct
22 Correct 255 ms 22636 KB Output is correct
23 Correct 268 ms 23644 KB Output is correct
24 Correct 264 ms 22636 KB Output is correct
25 Correct 107 ms 12908 KB Output is correct
26 Correct 102 ms 12652 KB Output is correct
27 Correct 263 ms 23660 KB Output is correct
28 Correct 252 ms 22764 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 258 ms 24556 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 258 ms 22636 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 114 ms 14700 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 67 ms 6124 KB Output is correct
21 Correct 255 ms 22764 KB Output is correct
22 Correct 255 ms 22636 KB Output is correct
23 Correct 268 ms 23644 KB Output is correct
24 Correct 264 ms 22636 KB Output is correct
25 Correct 107 ms 12908 KB Output is correct
26 Correct 102 ms 12652 KB Output is correct
27 Correct 263 ms 23660 KB Output is correct
28 Correct 252 ms 22764 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 1388 KB Output is correct
7 Correct 258 ms 24556 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 11 ms 1388 KB Output is correct
13 Correct 258 ms 22636 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1004 KB Output is correct
17 Correct 114 ms 14700 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 67 ms 6124 KB Output is correct
21 Correct 255 ms 22764 KB Output is correct
22 Correct 255 ms 22636 KB Output is correct
23 Correct 268 ms 23644 KB Output is correct
24 Correct 264 ms 22636 KB Output is correct
25 Correct 107 ms 12908 KB Output is correct
26 Correct 102 ms 12652 KB Output is correct
27 Correct 263 ms 23660 KB Output is correct
28 Correct 252 ms 22764 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -