oj.uz

Submission #591183

# Submission time Handle Problem Language Result Execution time Memory
591183 2022-07-07T01:21:21 Z SirCovidThe19th Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 203 ms 22092 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

#define FOR(i, x, y) for (int i = x; i < y; i++)

int construct(vector<vector<int>> p){
    int n = p.size();
    FOR(i, 0, n) FOR(j, 0, n) if (p[i][j] == 3) return 0;

    vector<vector<int>> ans(n, vector<int>(n, 0));
    bool vis[n] = {}; 
    int par[n]; iota(par, par + n, 0);

    function<int(int)> get = [&](int i){
        return i == par[i] ? i : par[i] = get(par[i]);
    };
    auto merge = [&](int a, int b){
        par[get(a)] = get(b);
    };
    FOR(src, 0, n) if (!vis[src]){
        bool incmp[n] = {}; vector<int> cmp; 
        FOR(i, 0, n) if (p[src][i])
            cmp.push_back(i), incmp[i] = 1;
    
        for (int i : cmp) for (int j : cmp) 
            if (p[i][j] == 1) merge(i, j);
            
        for (int i : cmp){ //check
            if (vis[i]) return 0;
            FOR(j, 0, n)
                if (p[i][j] and !incmp[j]) return 0;
            for (int j : cmp)
                if (!((get(i) == get(j) and p[i][j] == 1) or (get(i) != get(j) and p[i][j] == 2)))
                    return 0;
        }
        for (int i : cmp) vis[i] = 1;

        bool use[n] = {}; vector<int> head;
        for (int i : cmp){
            int c = get(i);
            if (!use[c]) head.push_back(c), use[c] = 1;
            if (i != c) ans[i][c] = ans[c][i] = 1;
        }
        FOR(i, 0, head.size()){
            int a = head[i];
            int b = head[(i + 1) % head.size()];
            if (a != b) ans[a][b] = ans[b][a] = 1;
        }
        if (!head.size()) return 0; //cannot have cycle of length 2
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:5:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define FOR(i, x, y) for (int i = x; i < y; i++)
......
   45 |         FOR(i, 0, head.size()){
      |             ~~~~~~~~~~~~~~~~~           
supertrees.cpp:45:9: note: in expansion of macro 'FOR'
   45 |         FOR(i, 0, head.size()){
      |         ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 202 ms 22072 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 202 ms 22072 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 165 ms 22052 KB Output is correct
14 Correct 0 ms 220 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 76 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 5708 KB Output is correct
21 Correct 176 ms 21968 KB Output is correct
22 Correct 159 ms 21972 KB Output is correct
23 Correct 203 ms 21964 KB Output is correct
24 Correct 175 ms 21952 KB Output is correct
25 Correct 82 ms 12040 KB Output is correct
26 Correct 65 ms 12028 KB Output is correct
27 Correct 199 ms 22092 KB Output is correct
28 Correct 160 ms 21964 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 43 ms 5716 KB Output is correct
5 Correct 163 ms 22016 KB Output is correct
6 Correct 181 ms 21980 KB Output is correct
7 Correct 195 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 40 ms 5740 KB Output is correct
10 Correct 167 ms 22028 KB Output is correct
11 Correct 156 ms 21996 KB Output is correct
12 Correct 187 ms 21964 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 47 ms 5760 KB Output is correct
17 Correct 182 ms 22076 KB Output is correct
18 Correct 166 ms 22028 KB Output is correct
19 Correct 160 ms 22032 KB Output is correct
20 Correct 160 ms 22036 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 202 ms 22072 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 165 ms 22052 KB Output is correct
14 Correct 0 ms 220 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 76 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 5708 KB Output is correct
21 Correct 176 ms 21968 KB Output is correct
22 Correct 159 ms 21972 KB Output is correct
23 Correct 203 ms 21964 KB Output is correct
24 Correct 175 ms 21952 KB Output is correct
25 Correct 82 ms 12040 KB Output is correct
26 Correct 65 ms 12028 KB Output is correct
27 Correct 199 ms 22092 KB Output is correct
28 Correct 160 ms 21964 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 202 ms 22072 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 165 ms 22052 KB Output is correct
14 Correct 0 ms 220 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 76 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 5708 KB Output is correct
21 Correct 176 ms 21968 KB Output is correct
22 Correct 159 ms 21972 KB Output is correct
23 Correct 203 ms 21964 KB Output is correct
24 Correct 175 ms 21952 KB Output is correct
25 Correct 82 ms 12040 KB Output is correct
26 Correct 65 ms 12028 KB Output is correct
27 Correct 199 ms 22092 KB Output is correct
28 Correct 160 ms 21964 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -