oj.uz

Submission #301394

# Submission time Handle Problem Language Result Execution time Memory
301394 2020-09-17T22:06:35 Z Gilgamesh Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 279 ms 22264 KB 
#include "supertrees.h"
#include <vector>
#include <set>
const int mxN = 1000;

int parent[mxN];
int parent2[mxN];
int rnk[mxN];
int rnk2[mxN];

int find(int x) 
{ 
    if(parent[x] == -1)
        parent[x] = x;
    if (parent[x] != x) { 
        parent[x] = find(parent[x]); 
    }
    return parent[x]; 
}
bool merge(int x, int y) 
{ 
    int xRoot = find(x), yRoot = find(y); 
    if (xRoot == yRoot) 
        return false; 
    if (rnk[xRoot] < rnk[yRoot]) 
        parent[xRoot] = yRoot; 
    else if (rnk[yRoot] < rnk[xRoot]) 
        parent[yRoot] = xRoot; 
    else 
    { 
        parent[yRoot] = xRoot; 
        rnk[xRoot] = rnk[xRoot] + 1; 
    } 
    return true;
} 
int find2(int x) 
{ 
    if(parent2[x] == -1)
        parent2[x] = x;
    if (parent2[x] != x) { 
        parent2[x] = find(parent2[x]); 
    }
    return parent[x]; 
}
bool merge2(int x, int y) 
{ 
    int xRoot = find(x), yRoot = find(y); 
    if (xRoot == yRoot) 
        return false; 
    if (rnk2[xRoot] < rnk2[yRoot]) 
        parent2[xRoot] = yRoot; 
    else if (rnk2[yRoot] < rnk2[xRoot]) 
        parent2[yRoot] = xRoot; 
    else 
    { 
        parent2[yRoot] = xRoot; 
        rnk2[xRoot] = rnk2[xRoot] + 1; 
    } 
    return true;
} 


int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    std::vector<std::vector<int>> answer;
    for (int i = 0; i < n; i++) {
        std::vector<int> row;
        row.resize(n);
        answer.push_back(row);
    }
    bool zero = false, one = false, two = false, three = false;
    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            if(p[i][j] == 0) zero = true;
            else if(p[i][j] == 1) one = true;
            else if(p[i][j] == 2) two = true;
            else three = true;
        }
    }
    for(int i = 0; i < n; ++i){
        parent[i] = i;
        parent2[i] = i;
    }
    if(!one && !three){
        for(int i = 0; i < n; ++i){
            for(int j = i + 1; j < n; ++j){
                if(!p[i][j] && find(i) == find(j)){
                    return 0;
                }
                if(p[i][j]) merge(i, j);
            }
        }
        for(int i = 0; i < n; ++i){
            for(int j = i + 1; j < n; ++j){
                if(!p[i][j] && find(i) == find(j)) return 0;
            }
        }
        std::vector<int> sets[n];
        for(int i = 0; i < n; ++i){
            int rep = find(i);
            sets[rep].emplace_back(i);
        }
        for(int i = 0; i < n; ++i){
            int sz = sets[i].size();
            if(sz == 2) return 0;
            for(int j = 0; j < sz - 1; ++j){
                answer[sets[i][j]][sets[i][j + 1]] = 1;
                answer[sets[i][j + 1]][sets[i][j]] = 1;
            }
            if(sz > 1){
                answer[sets[i][0]][sets[i][sz-1]] = 1;
                answer[sets[i][sz-1]][sets[i][0]] = 1;
            }
        }
    }
    else if(!two && !three){
        for(int i = 0; i < n; ++i){
            for(int j = i + 1; j < n; ++j){
                if(!p[i][j] && find(i) == find(j)){
                    return 0;
                }
                if(p[i][j]) merge(i, j);
            }
        }
        for(int i = 0; i < n; ++i){
            for(int j = i + 1; j < n; ++j){
                if(!p[i][j] && find(i) == find(j)) return 0;
            }
        }
        for(int i = 0; i < n; ++i){
            int rep = find(i);
            if(rep == i) continue;
            answer[rep][i] = 1;
            answer[i][rep] = 1;
        }
    }
    else if(!three){
        std::vector<int> sets[n];
        for(int i = 0; i < n; ++i){
            bool o = false, t = false;
            for(int j = 0; j < n; ++j){
                if(i == j) continue;
                if(p[i][j] == 1) o = true;
                else if(p[i][j] == 2) t = true;
            }
            if(!o && !t) continue;
            if(t){
                for(int j = 0; j < n; ++j){
                    if(i == j) continue;
                    merge2(i, j);
                }
            }
            else if(o){
                for(int j = 0; j < n; ++j){
                    if(i == j) continue;
                    if(p[i][j] == 1){
                        answer[i][j] = 1;
                        answer[j][i] = 1;
                        break;
                    }
                }
            }
        }
        for(int i = 0; i < n; ++i){
            int rep = find(i);
            sets[rep].emplace_back(i);
        }
        for(int i = 0; i < n; ++i){
            int sz = sets[i].size();
            if(sz == 2) return 0;
            for(int j = 0; j < sz - 1; ++j){
                answer[sets[i][j]][sets[i][j + 1]] = 1;
                answer[sets[i][j + 1]][sets[i][j]] = 1;
            }
            if(sz > 1){
                answer[sets[i][0]][sets[i][sz-1]] = 1;
                answer[sets[i][sz-1]][sets[i][0]] = 1;
            }
        }
    }
    build(answer);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:71:10: warning: variable 'zero' set but not used [-Wunused-but-set-variable]
   71 |     bool zero = false, one = false, two = false, three = false;
      |          ^~~~

Subtask #1
11.0 / 11.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 11 ms 1152 KB Output is correct
7 Correct 261 ms 22264 KB Output is correct

Subtask #2
10.0 / 10.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 11 ms 1152 KB Output is correct
7 Correct 261 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 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 260 ms 22164 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 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 68 ms 5752 KB Output is correct
21 Correct 266 ms 22136 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 275 ms 22136 KB Output is correct
24 Correct 253 ms 22136 KB Output is correct
25 Correct 114 ms 12156 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 279 ms 22136 KB Output is correct
28 Correct 269 ms 22136 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 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 11 ms 1152 KB Output is correct
9 Correct 254 ms 22136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 257 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 113 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 67 ms 5880 KB Output is correct
22 Correct 265 ms 22136 KB Output is correct
23 Correct 266 ms 22136 KB Output is correct
24 Correct 273 ms 22264 KB Output is correct
25 Correct 107 ms 12156 KB Output is correct
26 Correct 106 ms 12112 KB Output is correct
27 Correct 258 ms 22264 KB Output is correct
28 Correct 279 ms 22136 KB Output is correct
29 Correct 106 ms 12152 KB Output is correct

Subtask #4
0 / 35.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 68 ms 5752 KB Output is correct
5 Correct 262 ms 22136 KB Output is correct
6 Correct 267 ms 22136 KB Output is correct
7 Correct 278 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 65 ms 5880 KB Output is correct
10 Correct 264 ms 22136 KB Output is correct
11 Correct 265 ms 22136 KB Output is correct
12 Correct 271 ms 22264 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Incorrect 0 ms 256 KB Too few ways to get from 0 to 1, should be 2 found 0
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 11 ms 1152 KB Output is correct
7 Correct 261 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 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 260 ms 22164 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 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 68 ms 5752 KB Output is correct
21 Correct 266 ms 22136 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 275 ms 22136 KB Output is correct
24 Correct 253 ms 22136 KB Output is correct
25 Correct 114 ms 12156 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 279 ms 22136 KB Output is correct
28 Correct 269 ms 22136 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 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 254 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 257 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 113 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 67 ms 5880 KB Output is correct
50 Correct 265 ms 22136 KB Output is correct
51 Correct 266 ms 22136 KB Output is correct
52 Correct 273 ms 22264 KB Output is correct
53 Correct 107 ms 12156 KB Output is correct
54 Correct 106 ms 12112 KB Output is correct
55 Correct 258 ms 22264 KB Output is correct
56 Correct 279 ms 22136 KB Output is correct
57 Correct 106 ms 12152 KB Output is correct
58 Incorrect 0 ms 256 KB Answer gives possible 1 while actual possible 0
59 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 11 ms 1152 KB Output is correct
7 Correct 261 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 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 260 ms 22164 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 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 68 ms 5752 KB Output is correct
21 Correct 266 ms 22136 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 275 ms 22136 KB Output is correct
24 Correct 253 ms 22136 KB Output is correct
25 Correct 114 ms 12156 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 279 ms 22136 KB Output is correct
28 Correct 269 ms 22136 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 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 254 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 257 ms 22136 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 113 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 67 ms 5880 KB Output is correct
50 Correct 265 ms 22136 KB Output is correct
51 Correct 266 ms 22136 KB Output is correct
52 Correct 273 ms 22264 KB Output is correct
53 Correct 107 ms 12156 KB Output is correct
54 Correct 106 ms 12112 KB Output is correct
55 Correct 258 ms 22264 KB Output is correct
56 Correct 279 ms 22136 KB Output is correct
57 Correct 106 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 0 ms 256 KB Output is correct
61 Correct 68 ms 5752 KB Output is correct
62 Correct 262 ms 22136 KB Output is correct
63 Correct 267 ms 22136 KB Output is correct
64 Correct 278 ms 22136 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 65 ms 5880 KB Output is correct
67 Correct 264 ms 22136 KB Output is correct
68 Correct 265 ms 22136 KB Output is correct
69 Correct 271 ms 22264 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Incorrect 0 ms 256 KB Too few ways to get from 0 to 1, should be 2 found 0
72 Halted 0 ms 0 KB -