oj.uz

Submission #382901

# Submission time Handle Problem Language Result Execution time Memory
382901 2021-03-28T11:40:52 Z danielcm585 Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 290 ms 24300 KB 
#include "supertrees.h"

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back

typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;

const int N = 1e3;
int dsu[3][N+2];

int find(int idx, int x) {
    if (dsu[idx][x] == x)
        return x;
    return dsu[idx][x] = find(idx,dsu[idx][x]);
}

void merge(int idx, int a, int b) {
    int ra = find(idx,a);
    int rb = find(idx,b);
    dsu[idx][ra] = rb;
}

bool connect(int idx, int a, int b) {
    return (find(idx,a) == find(idx,b));
}

int construct(vector<vector<int>> p) {
	int n = p.size();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= 2; j++) {
            dsu[j][i] = i;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (p[i][j] == 3)
                return 0;
            if (p[i][j] != 0)
                merge(0,i,j);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 0 && connect(0,i,j))
                return 0;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 1)
                merge(1,i,j);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 2 && connect(1,i,j))
                return 0;
        }
    }
	vector<vector<int>> ans(n,vector<int>(n,0));
    for (int i = 0; i < n; i++) {
        int r = find(1,i);
        if (r != i) {
            ans[i][r] = 1;
            ans[r][i] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int u = find(1,i);
            int v = find(1,j);
            if (p[u][v] == 2)
                merge(2,u,v);
        }
    }
    vector<vector<int>> ls(n);
    for (int i = 0; i < n; i++) {
        ls[find(2,i)].pb(i);
    }
    for (int i = 0; i < n; i++) {
        int sz = ls[i].size();
        if (sz <= 1)
            continue;
        if (sz == 2)
            return 0;
        for (int j = 0; j < sz; j++) {
            int u = ls[i][(j+1)%sz];
            int v = ls[i][j];
            ans[u][v] = 1;
            ans[v][u] = 1;
        }
    }
    // Subsoal 3
    // vector<vector<int>> ls(n);
    // for (int i = 0; i < n; i++) {
    //     ls[find(i)].pb(i);
    // }
    // for (int i = 0; i < n; i++) {
    //     int sz = ls[i].size();
    //     if (sz <= 1)
    //         continue;
    //     if (sz == 2)
    //         return 0;
    //     for (int j = 0; j < sz; j++) {
    //         int u = ls[i][(j+1)%sz];
    //         int v = ls[i][j];
    //         ans[u][v] = 1;
    //         ans[v][u] = 1;
    //     }
    // }
    // Subsoal 1
    // for (int i = 1; i < n; i++) {
    //     ans[i-1][i] = 1;
    //     ans[i][i-1] = 1;
    // }
	build(ans);
	return 1;
}

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 12 ms 1388 KB Output is correct
7 Correct 275 ms 24300 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 12 ms 1388 KB Output is correct
7 Correct 275 ms 24300 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 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 24172 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 748 KB Output is correct
17 Correct 108 ms 10220 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 71 ms 6508 KB Output is correct
21 Correct 285 ms 24172 KB Output is correct
22 Correct 271 ms 24172 KB Output is correct
23 Correct 286 ms 24172 KB Output is correct
24 Correct 257 ms 24300 KB Output is correct
25 Correct 107 ms 10220 KB Output is correct
26 Correct 103 ms 10220 KB Output is correct
27 Correct 289 ms 24172 KB Output is correct
28 Correct 255 ms 24172 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1388 KB Output is correct
9 Correct 257 ms 24172 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 259 ms 24300 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 748 KB Output is correct
17 Correct 109 ms 10220 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 67 ms 6380 KB Output is correct
22 Correct 268 ms 24096 KB Output is correct
23 Correct 266 ms 24172 KB Output is correct
24 Correct 285 ms 24044 KB Output is correct
25 Correct 111 ms 14188 KB Output is correct
26 Correct 105 ms 10220 KB Output is correct
27 Correct 272 ms 24044 KB Output is correct
28 Correct 285 ms 24044 KB Output is correct
29 Correct 112 ms 14188 KB Output is correct

Subtask #4
35.0 / 35.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 67 ms 6380 KB Output is correct
5 Correct 273 ms 24172 KB Output is correct
6 Correct 269 ms 24172 KB Output is correct
7 Correct 286 ms 24172 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 79 ms 6380 KB Output is correct
10 Correct 266 ms 24044 KB Output is correct
11 Correct 273 ms 24172 KB Output is correct
12 Correct 290 ms 24044 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 68 ms 6380 KB Output is correct
17 Correct 265 ms 24172 KB Output is correct
18 Correct 273 ms 24044 KB Output is correct
19 Correct 273 ms 24044 KB Output is correct
20 Correct 261 ms 24172 KB Output is correct

Subtask #5
21.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 12 ms 1388 KB Output is correct
7 Correct 275 ms 24300 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 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 24172 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 748 KB Output is correct
17 Correct 108 ms 10220 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 71 ms 6508 KB Output is correct
21 Correct 285 ms 24172 KB Output is correct
22 Correct 271 ms 24172 KB Output is correct
23 Correct 286 ms 24172 KB Output is correct
24 Correct 257 ms 24300 KB Output is correct
25 Correct 107 ms 10220 KB Output is correct
26 Correct 103 ms 10220 KB Output is correct
27 Correct 289 ms 24172 KB Output is correct
28 Correct 255 ms 24172 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1388 KB Output is correct
37 Correct 257 ms 24172 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 259 ms 24300 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 109 ms 10220 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 67 ms 6380 KB Output is correct
50 Correct 268 ms 24096 KB Output is correct
51 Correct 266 ms 24172 KB Output is correct
52 Correct 285 ms 24044 KB Output is correct
53 Correct 111 ms 14188 KB Output is correct
54 Correct 105 ms 10220 KB Output is correct
55 Correct 272 ms 24044 KB Output is correct
56 Correct 285 ms 24044 KB Output is correct
57 Correct 112 ms 14188 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 5 ms 748 KB Output is correct
61 Correct 106 ms 10220 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 69 ms 6380 KB Output is correct
66 Correct 106 ms 10220 KB Output is correct
67 Correct 103 ms 10244 KB Output is correct
68 Correct 103 ms 10136 KB Output is correct
69 Correct 112 ms 14188 KB Output is correct

Subtask #6
4.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 12 ms 1388 KB Output is correct
7 Correct 275 ms 24300 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 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 24172 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 748 KB Output is correct
17 Correct 108 ms 10220 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 71 ms 6508 KB Output is correct
21 Correct 285 ms 24172 KB Output is correct
22 Correct 271 ms 24172 KB Output is correct
23 Correct 286 ms 24172 KB Output is correct
24 Correct 257 ms 24300 KB Output is correct
25 Correct 107 ms 10220 KB Output is correct
26 Correct 103 ms 10220 KB Output is correct
27 Correct 289 ms 24172 KB Output is correct
28 Correct 255 ms 24172 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 11 ms 1388 KB Output is correct
37 Correct 257 ms 24172 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 11 ms 1388 KB Output is correct
41 Correct 259 ms 24300 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 109 ms 10220 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 67 ms 6380 KB Output is correct
50 Correct 268 ms 24096 KB Output is correct
51 Correct 266 ms 24172 KB Output is correct
52 Correct 285 ms 24044 KB Output is correct
53 Correct 111 ms 14188 KB Output is correct
54 Correct 105 ms 10220 KB Output is correct
55 Correct 272 ms 24044 KB Output is correct
56 Correct 285 ms 24044 KB Output is correct
57 Correct 112 ms 14188 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 67 ms 6380 KB Output is correct
62 Correct 273 ms 24172 KB Output is correct
63 Correct 269 ms 24172 KB Output is correct
64 Correct 286 ms 24172 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 79 ms 6380 KB Output is correct
67 Correct 266 ms 24044 KB Output is correct
68 Correct 273 ms 24172 KB Output is correct
69 Correct 290 ms 24044 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 68 ms 6380 KB Output is correct
74 Correct 265 ms 24172 KB Output is correct
75 Correct 273 ms 24044 KB Output is correct
76 Correct 273 ms 24044 KB Output is correct
77 Correct 261 ms 24172 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 5 ms 748 KB Output is correct
81 Correct 106 ms 10220 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 69 ms 6380 KB Output is correct
86 Correct 106 ms 10220 KB Output is correct
87 Correct 103 ms 10244 KB Output is correct
88 Correct 103 ms 10136 KB Output is correct
89 Correct 112 ms 14188 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 5 ms 748 KB Output is correct
93 Correct 113 ms 10212 KB Output is correct
94 Correct 1 ms 364 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 26 ms 2796 KB Output is correct
98 Correct 102 ms 10220 KB Output is correct
99 Correct 103 ms 10220 KB Output is correct
100 Correct 101 ms 10220 KB Output is correct
101 Correct 101 ms 10220 KB Output is correct
102 Correct 99 ms 10220 KB Output is correct
103 Correct 91 ms 10348 KB Output is correct
104 Correct 97 ms 10220 KB Output is correct
105 Correct 111 ms 10220 KB Output is correct