oj.uz

Submission #853682

# Submission time Handle Problem Language Result Execution time Memory
853682 2023-09-25T02:30:42 Z ntkphong Connecting Supertrees (IOI20_supertrees) C++14
96 / 100
 182 ms 23932 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> par;

int get_root(int u) {
    return par[u] == u ? u : par[u] = get_root(par[u]);
}

bool unite(int u, int v) {
    u = get_root(u);
    v = get_root(v);

    if(u == v) return false;
    
    par[v] = u;
    return true;
}

int construct(vector<vector<int>> p) {
	int n = p.size();

    par.resize(n);
    for(int i = 0; i < n; i ++) par[i] = i;
        
    vector<vector<int>> answer(n, vector<int> (n, 0));
    vector<bool> mark(n, false);
    
    for(int i = 0; i < n; i ++) {
        vector<int> a;
        
        for(int j = 0; j < n; j ++) {
            if(i == j || p[i][j] != 1) continue ;
            a.push_back(j);
        }
        
        if(a.empty()) continue ;
        
        for(int j = 0; j < a.size(); j ++) {
            if(unite(i, a[j])) {
                answer[i][a[j]] = 1;
                answer[a[j]][i] = 1;
            }
        }
    }
    
    for(int i = 0; i < n; i ++) {
        for(int j = 0; j < n; j ++) {
            if(i != j && p[i][j] == 1) {
                if(get_root(i) != get_root(j))
                    return 0;
            }
            
            if(i != j && p[i][j] == 0) {
                if(get_root(i) == get_root(j))
                    return 0;
            }
        }
    }
    
    for(int i = 0; i < n; i ++) {
        if(get_root(i) != i) continue ;
        
        vector<int> a;
        
        for(int j = 0; j < n; j ++) {
            if(i == j || p[i][j] != 2) continue ;
            
            if(mark[j]) return 0;
            a.push_back(j);
        }
        
        if(a.empty()) continue ;
        
        vector<int> b;
        b.push_back(i);
        
        for(int j = 0; j < a.size(); j ++) {
            if(unite(b.back(), a[j])) {
                answer[b.back()][a[j]] = 1;
                answer[a[j]][b.back()] = 1;
                
                b.push_back(a[j]);
            }
        }
        
        if(b.size() <= 2) return 0;
        
        answer[i][b.back()] = 1;
        answer[b.back()][i] = 1;
        
        for(int j = 0; j < n; j ++) {
            if(get_root(i) == get_root(j)) {
                mark[j] = true;
            }
        }
    }
    
    for(int i = 0; i < n; i ++) {
        for(int j = 0; j < n; j ++) {
            if(i != j && p[i][j] == 2) {
                if(get_root(i) != get_root(j) || mark[get_root(i)] == false)
                    return 0;
            }
            
            if(i != j && p[i][j] == 0) {
                if(get_root(i) == get_root(j))
                    return 0;
            }
        }
    }
    
    for(int i = 0; i < n; i ++) {
        if(get_root(i) != i) continue ;
        
        vector<int> a;
        
        for(int j = 0; j < n; j ++) {
            if(i == j || p[i][j] != 3) continue ;
            
            if(mark[j]) return 0;
            a.push_back(j);
        }
        
        if(a.empty()) continue ;
        
        vector<int> b;
        b.push_back(i);
        
        for(int j = 0; j < a.size(); j ++) {
            if(unite(b.back(), a[j])) {
                answer[b.back()][a[j]] = 1;
                answer[a[j]][b.back()] = 1;
                
                b.push_back(a[j]);
            }
        }
        
        if(b.size() <= 3) return 0;
        
        answer[i][b.back()] = 1;
        answer[b.back()][i] = 1;
        
        answer[i][b[b.size() - 2]] = 1;
        answer[b[b.size() - 2]][i] = 1;
        
        for(int j = 0; j < n; j ++) {
            if(get_root(i) == get_root(j)) {
                mark[j] = 1;
            }
        }
    }
    
    for(int i = 0; i < n; i ++) {
        for(int j = 0; j < n; j ++) {
            if(i != j && p[i][j] == 3) {
                if(get_root(i) != get_root(j) || mark[get_root(i)] == false)
                    return 0;
            }
            
            if(i != j && p[i][j] == 0) {
                if(get_root(i) == get_root(j))
                    return 0;
            }
        }
    }
 	
  	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:40:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for(int j = 0; j < a.size(); j ++) {
      |                        ~~^~~~~~~~~~
supertrees.cpp:79:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         for(int j = 0; j < a.size(); j ++) {
      |                        ~~^~~~~~~~~~
supertrees.cpp:131:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for(int j = 0; j < a.size(); j ++) {
      |                        ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 161 ms 22108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 161 ms 22108 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 165 ms 22100 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12112 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 5716 KB Output is correct
21 Correct 179 ms 22036 KB Output is correct
22 Correct 177 ms 22096 KB Output is correct
23 Correct 168 ms 22036 KB Output is correct
24 Correct 165 ms 22020 KB Output is correct
25 Correct 61 ms 12036 KB Output is correct
26 Correct 58 ms 12116 KB Output is correct
27 Correct 171 ms 22132 KB Output is correct
28 Correct 167 ms 22044 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1112 KB Output is correct
9 Correct 163 ms 22004 KB Output is correct
10 Correct 0 ms 544 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1272 KB Output is correct
13 Correct 158 ms 22004 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12036 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 44 ms 5692 KB Output is correct
22 Correct 169 ms 22024 KB Output is correct
23 Correct 167 ms 22040 KB Output is correct
24 Correct 176 ms 22024 KB Output is correct
25 Correct 62 ms 12116 KB Output is correct
26 Correct 61 ms 12052 KB Output is correct
27 Correct 173 ms 22120 KB Output is correct
28 Correct 173 ms 22024 KB Output is correct
29 Correct 61 ms 12116 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 42 ms 5884 KB Output is correct
5 Correct 169 ms 22040 KB Output is correct
6 Correct 168 ms 22096 KB Output is correct
7 Correct 168 ms 22096 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 41 ms 5752 KB Output is correct
10 Correct 165 ms 22024 KB Output is correct
11 Correct 162 ms 22004 KB Output is correct
12 Correct 175 ms 22288 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 42 ms 5696 KB Output is correct
17 Correct 164 ms 22160 KB Output is correct
18 Correct 168 ms 21948 KB Output is correct
19 Correct 182 ms 22012 KB Output is correct
20 Correct 164 ms 22100 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 161 ms 22108 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 165 ms 22100 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12112 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 5716 KB Output is correct
21 Correct 179 ms 22036 KB Output is correct
22 Correct 177 ms 22096 KB Output is correct
23 Correct 168 ms 22036 KB Output is correct
24 Correct 165 ms 22020 KB Output is correct
25 Correct 61 ms 12036 KB Output is correct
26 Correct 58 ms 12116 KB Output is correct
27 Correct 171 ms 22132 KB Output is correct
28 Correct 167 ms 22044 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 163 ms 22004 KB Output is correct
38 Correct 0 ms 544 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1272 KB Output is correct
41 Correct 158 ms 22004 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 70 ms 12036 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 44 ms 5692 KB Output is correct
50 Correct 169 ms 22024 KB Output is correct
51 Correct 167 ms 22040 KB Output is correct
52 Correct 176 ms 22024 KB Output is correct
53 Correct 62 ms 12116 KB Output is correct
54 Correct 61 ms 12052 KB Output is correct
55 Correct 173 ms 22120 KB Output is correct
56 Correct 173 ms 22024 KB Output is correct
57 Correct 61 ms 12116 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 3 ms 1304 KB Output is correct
61 Correct 67 ms 12040 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 46 ms 5972 KB Output is correct
66 Correct 68 ms 12112 KB Output is correct
67 Correct 63 ms 12052 KB Output is correct
68 Correct 64 ms 12116 KB Output is correct
69 Correct 61 ms 12112 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 161 ms 22108 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 165 ms 22100 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12112 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 5716 KB Output is correct
21 Correct 179 ms 22036 KB Output is correct
22 Correct 177 ms 22096 KB Output is correct
23 Correct 168 ms 22036 KB Output is correct
24 Correct 165 ms 22020 KB Output is correct
25 Correct 61 ms 12036 KB Output is correct
26 Correct 58 ms 12116 KB Output is correct
27 Correct 171 ms 22132 KB Output is correct
28 Correct 167 ms 22044 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 163 ms 22004 KB Output is correct
38 Correct 0 ms 544 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1272 KB Output is correct
41 Correct 158 ms 22004 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 70 ms 12036 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 44 ms 5692 KB Output is correct
50 Correct 169 ms 22024 KB Output is correct
51 Correct 167 ms 22040 KB Output is correct
52 Correct 176 ms 22024 KB Output is correct
53 Correct 62 ms 12116 KB Output is correct
54 Correct 61 ms 12052 KB Output is correct
55 Correct 173 ms 22120 KB Output is correct
56 Correct 173 ms 22024 KB Output is correct
57 Correct 61 ms 12116 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 42 ms 5884 KB Output is correct
62 Correct 169 ms 22040 KB Output is correct
63 Correct 168 ms 22096 KB Output is correct
64 Correct 168 ms 22096 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 41 ms 5752 KB Output is correct
67 Correct 165 ms 22024 KB Output is correct
68 Correct 162 ms 22004 KB Output is correct
69 Correct 175 ms 22288 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 42 ms 5696 KB Output is correct
74 Correct 164 ms 22160 KB Output is correct
75 Correct 168 ms 21948 KB Output is correct
76 Correct 182 ms 22012 KB Output is correct
77 Correct 164 ms 22100 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 3 ms 1304 KB Output is correct
81 Correct 67 ms 12040 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 46 ms 5972 KB Output is correct
86 Correct 68 ms 12112 KB Output is correct
87 Correct 63 ms 12052 KB Output is correct
88 Correct 64 ms 12116 KB Output is correct
89 Correct 61 ms 12112 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 856 KB Output is correct
93 Correct 66 ms 12052 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 23 ms 3420 KB Output is correct
98 Correct 70 ms 12060 KB Output is correct
99 Correct 86 ms 12040 KB Output is correct
100 Correct 71 ms 12116 KB Output is correct
101 Correct 71 ms 12112 KB Output is correct
102 Incorrect 162 ms 23932 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -