oj.uz

Submission #853681

# Submission time Handle Problem Language Result Execution time Memory
853681 2023-09-25T02:24:54 Z ntkphong Connecting Supertrees (IOI20_supertrees) C++14
96 / 100
 176 ms 24400 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.back() <= 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 1 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1568 KB Output is correct
7 Correct 164 ms 23600 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 1 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1568 KB Output is correct
7 Correct 164 ms 23600 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 161 ms 23376 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 75 ms 14160 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 43 ms 6264 KB Output is correct
21 Correct 174 ms 24400 KB Output is correct
22 Correct 169 ms 24072 KB Output is correct
23 Correct 174 ms 24080 KB Output is correct
24 Correct 163 ms 24144 KB Output is correct
25 Correct 62 ms 14160 KB Output is correct
26 Correct 61 ms 14160 KB Output is correct
27 Correct 174 ms 23928 KB Output is correct
28 Correct 162 ms 24144 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 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 162 ms 23256 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 7 ms 1368 KB Output is correct
13 Correct 163 ms 23312 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 76 ms 12112 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 42 ms 6228 KB Output is correct
22 Correct 173 ms 23300 KB Output is correct
23 Correct 176 ms 23220 KB Output is correct
24 Correct 170 ms 23228 KB Output is correct
25 Correct 64 ms 13304 KB Output is correct
26 Correct 63 ms 13444 KB Output is correct
27 Correct 167 ms 24148 KB Output is correct
28 Correct 170 ms 23960 KB Output is correct
29 Correct 63 ms 14164 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 344 KB Output is correct
4 Correct 44 ms 6224 KB Output is correct
5 Correct 168 ms 23356 KB Output is correct
6 Correct 172 ms 23500 KB Output is correct
7 Correct 173 ms 23300 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 41 ms 6228 KB Output is correct
10 Correct 163 ms 23376 KB Output is correct
11 Correct 167 ms 23300 KB Output is correct
12 Correct 172 ms 23376 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 42 ms 6228 KB Output is correct
17 Correct 167 ms 23380 KB Output is correct
18 Correct 176 ms 23300 KB Output is correct
19 Correct 167 ms 23632 KB Output is correct
20 Correct 167 ms 23548 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 1 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1568 KB Output is correct
7 Correct 164 ms 23600 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 161 ms 23376 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 75 ms 14160 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 43 ms 6264 KB Output is correct
21 Correct 174 ms 24400 KB Output is correct
22 Correct 169 ms 24072 KB Output is correct
23 Correct 174 ms 24080 KB Output is correct
24 Correct 163 ms 24144 KB Output is correct
25 Correct 62 ms 14160 KB Output is correct
26 Correct 61 ms 14160 KB Output is correct
27 Correct 174 ms 23928 KB Output is correct
28 Correct 162 ms 24144 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 162 ms 23256 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 163 ms 23312 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 76 ms 12112 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 6228 KB Output is correct
50 Correct 173 ms 23300 KB Output is correct
51 Correct 176 ms 23220 KB Output is correct
52 Correct 170 ms 23228 KB Output is correct
53 Correct 64 ms 13304 KB Output is correct
54 Correct 63 ms 13444 KB Output is correct
55 Correct 167 ms 24148 KB Output is correct
56 Correct 170 ms 23960 KB Output is correct
57 Correct 63 ms 14164 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 70 ms 14232 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 45 ms 6228 KB Output is correct
66 Correct 63 ms 14160 KB Output is correct
67 Correct 61 ms 14164 KB Output is correct
68 Correct 65 ms 14212 KB Output is correct
69 Correct 65 ms 14208 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 1 ms 504 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1568 KB Output is correct
7 Correct 164 ms 23600 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 161 ms 23376 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 75 ms 14160 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 43 ms 6264 KB Output is correct
21 Correct 174 ms 24400 KB Output is correct
22 Correct 169 ms 24072 KB Output is correct
23 Correct 174 ms 24080 KB Output is correct
24 Correct 163 ms 24144 KB Output is correct
25 Correct 62 ms 14160 KB Output is correct
26 Correct 61 ms 14160 KB Output is correct
27 Correct 174 ms 23928 KB Output is correct
28 Correct 162 ms 24144 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 162 ms 23256 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 163 ms 23312 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 3 ms 856 KB Output is correct
45 Correct 76 ms 12112 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 6228 KB Output is correct
50 Correct 173 ms 23300 KB Output is correct
51 Correct 176 ms 23220 KB Output is correct
52 Correct 170 ms 23228 KB Output is correct
53 Correct 64 ms 13304 KB Output is correct
54 Correct 63 ms 13444 KB Output is correct
55 Correct 167 ms 24148 KB Output is correct
56 Correct 170 ms 23960 KB Output is correct
57 Correct 63 ms 14164 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 344 KB Output is correct
61 Correct 44 ms 6224 KB Output is correct
62 Correct 168 ms 23356 KB Output is correct
63 Correct 172 ms 23500 KB Output is correct
64 Correct 173 ms 23300 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 41 ms 6228 KB Output is correct
67 Correct 163 ms 23376 KB Output is correct
68 Correct 167 ms 23300 KB Output is correct
69 Correct 172 ms 23376 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 42 ms 6228 KB Output is correct
74 Correct 167 ms 23380 KB Output is correct
75 Correct 176 ms 23300 KB Output is correct
76 Correct 167 ms 23632 KB Output is correct
77 Correct 167 ms 23548 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 70 ms 14232 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 45 ms 6228 KB Output is correct
86 Correct 63 ms 14160 KB Output is correct
87 Correct 61 ms 14164 KB Output is correct
88 Correct 65 ms 14212 KB Output is correct
89 Correct 65 ms 14208 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 3 ms 856 KB Output is correct
93 Correct 69 ms 14108 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 0 ms 344 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 19 ms 3672 KB Output is correct
98 Correct 73 ms 14160 KB Output is correct
99 Correct 78 ms 14164 KB Output is correct
100 Correct 72 ms 13992 KB Output is correct
101 Incorrect 169 ms 24088 KB Answer gives possible 1 while actual possible 0
102 Halted 0 ms 0 KB -