Submission #300205

# Submission time Handle Problem Language Result Execution time Memory
300205 2020-09-17T00:59:20 Z fpc_coder Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
255 ms 22264 KB
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(vector<vector<int>> p) {
    vector<vector<int>> b(p.size(), vector<int>(p.size(), 0));
    int n = (int) p.size();
    vector<int> par(n, -1);
    vector<bool> vis(n, false);
    bool subtask3 = false;
    for (int i = 0; i < n; i++) {
        if (*max_element(p[i].begin(), p[i].end()) == 2) {
            subtask3 = true;
            break;
        }
    }
    if (!subtask3) {
        for (int i = 0; i < n; i++) {
            if (vis[i]) continue;
            par[i] = i;
            for (int j = 0; j < n; j++) {
                if (i == j) continue;
                if (p[i][j]) {
                    if (vis[j]) return 0;
                    vis[j] = true;
                    b[i][j] = b[j][i] = 1;
                    par[j] = i;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i == j) continue;
                if (par[i] == par[j] && p[i][j] == 0) return 0;
                if (par[i] != par[j] && p[i][j] == 1) return 0;
            }
        }
        build(b);
        return 1;
    }
    else {
        for (int i = 0; i < n; i++) {
            if (vis[i]) continue;
            par[i] = i;
            int cur = i;
            for (int j = 0; j < n; j++) {
                if (i == j) continue;
                if (p[i][j]) {
                    if (vis[j]) return 0;
                    vis[j] = true;
                    b[cur][j] = b[j][cur] = 1;
                    par[j] = i;
                    cur = j;
                }
            }
            if (b[i][cur]) return 0;
            b[i][cur] = b[cur][i] = 1;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i == j) continue;
                if (par[i] == par[j] && p[i][j] == 0) return 0;
                if (par[i] != par[j] && p[i][j] == 2) return 0;
            }
        }
        build(b);
        return 1;
    }
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 235 ms 22136 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 235 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 59 ms 5752 KB Output is correct
21 Correct 241 ms 22136 KB Output is correct
22 Correct 240 ms 22136 KB Output is correct
23 Correct 243 ms 22136 KB Output is correct
24 Correct 240 ms 22076 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 255 ms 22104 KB Output is correct
28 Correct 240 ms 22056 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 238 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 235 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 109 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Incorrect 0 ms 256 KB b[4][4] is not 0
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 59 ms 5752 KB Output is correct
5 Correct 253 ms 22136 KB Output is correct
6 Correct 233 ms 22264 KB Output is correct
7 Correct 246 ms 22136 KB Output is correct
8 Incorrect 1 ms 384 KB b[4][4] is not 0
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 235 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 59 ms 5752 KB Output is correct
21 Correct 241 ms 22136 KB Output is correct
22 Correct 240 ms 22136 KB Output is correct
23 Correct 243 ms 22136 KB Output is correct
24 Correct 240 ms 22076 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 255 ms 22104 KB Output is correct
28 Correct 240 ms 22056 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 238 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 235 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 109 ms 12152 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Incorrect 0 ms 256 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 13 ms 1152 KB Output is correct
7 Correct 235 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 59 ms 5752 KB Output is correct
21 Correct 241 ms 22136 KB Output is correct
22 Correct 240 ms 22136 KB Output is correct
23 Correct 243 ms 22136 KB Output is correct
24 Correct 240 ms 22076 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 101 ms 12152 KB Output is correct
27 Correct 255 ms 22104 KB Output is correct
28 Correct 240 ms 22056 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 238 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 235 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 109 ms 12152 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Incorrect 0 ms 256 KB b[4][4] is not 0
49 Halted 0 ms 0 KB -