oj.uz

Submission #312628

# Submission time Handle Problem Language Result Execution time Memory
312628 2020-10-13T21:52:19 Z joseacaz Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 275 ms 22264 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pii>;
using vpl = vector<pll>;

const int MAXN = 1e3 + 5;
int N, par[MAXN], branch[MAXN];

int look(int node)
{
    if(par[node] == node)
        return node;
    return par[node] = look(par[node]);
}

void join(int a, int b)
{
    par[look(b)] = look(a);
}

int construct(vector<vi> p)
{
	N = p.size();
    vi branches, cycles;
    for(int i = 0; i < N; i++)
    {
        int one = 0, two = 0;
        for(int j = 0; j < N; j++)
        {
            if(i == j) continue;
            if(p[i][j] == 3)
                return 0;
            if(p[i][j] == 1)
                one++;
            if(p[i][j] == 2)
                two++;
        }
        
        //part of a branch
        if(one)
        {
            branches.pb(i);
            branch[i] = 1;
        }
        //part of the cycle
        else if(two)
            cycles.pb(i);
    }
    
	vector<vi> answer(N, vi(N, 0));
    for(int i = 0; i < N; i++)
        par[i] = i;
    for(auto i : branches)
    {
        if(look(i) != i)
            continue;

        int last = i;
        for(int j = 0; j < N; j++)
        {
            if(i == j) continue;
            if(p[i][j] == 1)
            {
                join(i, j);
                answer[last][j] = 1;
                answer[j][last] = 1;
                last = j;
            }
        }
        
        cycles.pb(i);
        branch[i] = 0;
    }
    
    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            if(i != j && p[i][j] != 1 && look(i) == look(j))
                return 0;
    
    for(int i = 0; i < N; i++)
        par[i] = i;
    for(auto i : cycles)
    {
        if(look(i) != i)
            continue;

        int last = i, cnt = 1;
        for(int j = 0; j < N; j++)
        {
            if(i == j) continue;
            if(p[i][j] == 2 && !branch[j])
            {
                cnt++;
                join(i, j);
                answer[last][j] = 1;
                answer[j][last] = 1;
                last = j;
            }
        }

        if(cnt == 2)
            return 0;
        
        if(last != i)
        {
            answer[last][i] = 1;
            answer[i][last] = 1;
        }
    }

    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            if(i != j && p[i][j] != 2 && look(i) == look(j))
                return 0;

    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            if(i != j && answer[i][j])
                join(i, j);
    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
        {
            if(i != j && !p[i][j] && look(i) == look(j))
                return 0;
            if(i != j && p[i][j] && look(i) != look(j))
                return 0;
        }
    build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 248 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 248 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 0 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 112 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 66 ms 5780 KB Output is correct
21 Correct 256 ms 22136 KB Output is correct
22 Correct 259 ms 22148 KB Output is correct
23 Correct 270 ms 22136 KB Output is correct
24 Correct 243 ms 22108 KB Output is correct
25 Correct 119 ms 12152 KB Output is correct
26 Correct 105 ms 12124 KB Output is correct
27 Correct 269 ms 22264 KB Output is correct
28 Correct 257 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 12 ms 1280 KB Output is correct
9 Correct 244 ms 22108 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 252 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 107 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 64 ms 5880 KB Output is correct
22 Correct 257 ms 22136 KB Output is correct
23 Correct 252 ms 22140 KB Output is correct
24 Correct 275 ms 22136 KB Output is correct
25 Correct 102 ms 12152 KB Output is correct
26 Correct 113 ms 12120 KB Output is correct
27 Correct 250 ms 22136 KB Output is correct
28 Correct 265 ms 22264 KB Output is correct
29 Correct 104 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 63 ms 5880 KB Output is correct
5 Correct 257 ms 22140 KB Output is correct
6 Correct 253 ms 22136 KB Output is correct
7 Correct 270 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 63 ms 5752 KB Output is correct
10 Correct 258 ms 22136 KB Output is correct
11 Correct 257 ms 22264 KB Output is correct
12 Correct 268 ms 22136 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 65 ms 5880 KB Output is correct
17 Correct 258 ms 22140 KB Output is correct
18 Correct 261 ms 22136 KB Output is correct
19 Correct 260 ms 22136 KB Output is correct
20 Correct 243 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 248 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 0 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 112 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 66 ms 5780 KB Output is correct
21 Correct 256 ms 22136 KB Output is correct
22 Correct 259 ms 22148 KB Output is correct
23 Correct 270 ms 22136 KB Output is correct
24 Correct 243 ms 22108 KB Output is correct
25 Correct 119 ms 12152 KB Output is correct
26 Correct 105 ms 12124 KB Output is correct
27 Correct 269 ms 22264 KB Output is correct
28 Correct 257 ms 22264 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 12 ms 1280 KB Output is correct
37 Correct 244 ms 22108 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 252 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 107 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 64 ms 5880 KB Output is correct
50 Correct 257 ms 22136 KB Output is correct
51 Correct 252 ms 22140 KB Output is correct
52 Correct 275 ms 22136 KB Output is correct
53 Correct 102 ms 12152 KB Output is correct
54 Correct 113 ms 12120 KB Output is correct
55 Correct 250 ms 22136 KB Output is correct
56 Correct 265 ms 22264 KB Output is correct
57 Correct 104 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 111 ms 12156 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 65 ms 5752 KB Output is correct
66 Correct 103 ms 12152 KB Output is correct
67 Correct 114 ms 12152 KB Output is correct
68 Correct 118 ms 12280 KB Output is correct
69 Correct 107 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 248 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 0 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 112 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 66 ms 5780 KB Output is correct
21 Correct 256 ms 22136 KB Output is correct
22 Correct 259 ms 22148 KB Output is correct
23 Correct 270 ms 22136 KB Output is correct
24 Correct 243 ms 22108 KB Output is correct
25 Correct 119 ms 12152 KB Output is correct
26 Correct 105 ms 12124 KB Output is correct
27 Correct 269 ms 22264 KB Output is correct
28 Correct 257 ms 22264 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 12 ms 1280 KB Output is correct
37 Correct 244 ms 22108 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 252 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 107 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 64 ms 5880 KB Output is correct
50 Correct 257 ms 22136 KB Output is correct
51 Correct 252 ms 22140 KB Output is correct
52 Correct 275 ms 22136 KB Output is correct
53 Correct 102 ms 12152 KB Output is correct
54 Correct 113 ms 12120 KB Output is correct
55 Correct 250 ms 22136 KB Output is correct
56 Correct 265 ms 22264 KB Output is correct
57 Correct 104 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 63 ms 5880 KB Output is correct
62 Correct 257 ms 22140 KB Output is correct
63 Correct 253 ms 22136 KB Output is correct
64 Correct 270 ms 22136 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 63 ms 5752 KB Output is correct
67 Correct 258 ms 22136 KB Output is correct
68 Correct 257 ms 22264 KB Output is correct
69 Correct 268 ms 22136 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 65 ms 5880 KB Output is correct
74 Correct 258 ms 22140 KB Output is correct
75 Correct 261 ms 22136 KB Output is correct
76 Correct 260 ms 22136 KB Output is correct
77 Correct 243 ms 22136 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 111 ms 12156 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 65 ms 5752 KB Output is correct
86 Correct 103 ms 12152 KB Output is correct
87 Correct 114 ms 12152 KB Output is correct
88 Correct 118 ms 12280 KB Output is correct
89 Correct 107 ms 12152 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct
92 Correct 5 ms 668 KB Output is correct
93 Correct 100 ms 8156 KB Output is correct
94 Correct 1 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 0 ms 256 KB Output is correct
97 Correct 24 ms 2296 KB Output is correct
98 Correct 98 ms 8184 KB Output is correct
99 Correct 97 ms 8184 KB Output is correct
100 Correct 99 ms 8160 KB Output is correct
101 Correct 97 ms 8184 KB Output is correct
102 Correct 97 ms 8184 KB Output is correct
103 Correct 99 ms 8184 KB Output is correct
104 Correct 100 ms 8184 KB Output is correct
105 Correct 101 ms 8184 KB Output is correct