oj.uz

답안 #303124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303124 2020-09-19T22:39:57 Z Gilgamesh 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 284 ms 22264 KB 
#include "supertrees.h"
#include <vector>
#include <set>
const int mxN = 1000;

int parent[mxN];
int rnk[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 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;
    }
    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){
        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::set<int> sets[n];
        for(int i = 0; i < n; ++i){
            int rep = find(i);
            sets[rep].insert(i);
        }
        std::set<int> trees[n];
        for(int rep = 0; rep < n; ++rep){
            if(sets[rep].size() < 2) continue;
            if(sets[rep].size() == 2){
                if(p[*sets[rep].begin()][*prev(sets[rep].end())] == 2) return 0;
            }
            std::vector<int> circle;
            std::set<int> remove;
            for(int i : sets[rep]){
                if(remove.find(i) != remove.end()) continue;
                for(int j = 0; j < n; ++j){
                    if(j == i) continue;
                    if(p[i][j] == 1){
                        answer[i][j] = 1;
                        answer[j][i] = 1;
                        remove.insert(j);
                        trees[i].insert(j);
                    }
                }
                trees[i].insert(i);
                circle.emplace_back(i);
            }
            int sz = circle.size();
            for(int i = 0; i < sz - 1; ++i){
                answer[circle[i]][circle[i + 1]] = 1;
                answer[circle[i + 1]][circle[i]] = 1;
            }
            if(sz > 1){
                answer[circle[0]][circle[sz-1]] = 1;
                answer[circle[sz-1]][circle[0]] = 1;
            }
            for(int i = 0; i < sz; ++i){
                for(int j = i + 1; j < sz; ++j){
                    if(p[circle[i]][circle[j]] != 2) return 0;
                }
            }
            for(int i = 0; i < n; ++i){
                for(int j : trees[i]){
                    for(int k = 0; k < n; ++k){
                        if(j == k) continue;
                        if((p[j][k] == 1 && trees[i].find(k) == trees[i].end()) || (p[j][k] == 2 && trees[i].find(k) != trees[i].end())) return 0;
                    }
                }
            }
        }
    }
    else{
        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::set<int> sets[n];
        for(int i = 0; i < n; ++i){
            int rep = find(i);
            sets[rep].insert(i);
        }
        std::set<int> trees[n];
        for(int rep = 0; rep < n; ++rep){
            if(sets[rep].size() < 2) continue;
            if(sets[rep].size() == 2){
                if(p[*sets[rep].begin()][*prev(sets[rep].end())] >= 2) return 0;
            }
            std::vector<int> circle;
            std::set<int> remove;
            for(int i : sets[rep]){
                if(remove.find(i) != remove.end()) continue;
                for(int j = 0; j < n; ++j){
                    if(j == i) continue;
                    if(p[i][j] == 1){
                        answer[i][j] = 1;
                        answer[j][i] = 1;
                        remove.insert(j);
                        trees[i].insert(j);
                    }
                }
                trees[i].insert(i);
                circle.emplace_back(i);
            }
            int sz = circle.size();
            for(int i = 0; i < sz - 1; ++i){
                answer[circle[i]][circle[i + 1]] = 1;
                answer[circle[i + 1]][circle[i]] = 1;
            }
            if(sz > 1){
                answer[circle[0]][circle[sz-1]] = 1;
                answer[circle[sz-1]][circle[0]] = 1;
            }
            int tp = 0;
            if(sz > 1){
                tp = p[circle[0]][circle[1]];
            }
            for(int i = 0; i < sz; ++i){
                for(int j = i + 1; j < sz; ++j){
                    if(p[circle[i]][circle[j]] != tp) return 0;
                }
            }
            for(int i = 0; i < n; ++i){
                for(int j : trees[i]){
                    for(int k = 0; k < n; ++k){
                        if(j == k) continue;
                        if((p[j][k] == 1 && trees[i].find(k) == trees[i].end()) || (p[j][k] == tp && trees[i].find(k) != trees[i].end())) return 0;
                    }
                }
            }
            if(tp == 3){
                return 0;
            }
        }
    }
    build(answer);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 260 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 260 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 249 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 114 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 63 ms 5832 KB Output is correct
21 Correct 251 ms 22100 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 270 ms 22136 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 101 ms 12184 KB Output is correct
27 Correct 280 ms 22136 KB Output is correct
28 Correct 242 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 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 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 245 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 1152 KB Output is correct
13 Correct 255 ms 22092 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 12108 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 65 ms 5884 KB Output is correct
22 Correct 251 ms 22264 KB Output is correct
23 Correct 255 ms 22136 KB Output is correct
24 Correct 264 ms 22136 KB Output is correct
25 Correct 103 ms 12152 KB Output is correct
26 Correct 102 ms 12152 KB Output is correct
27 Correct 256 ms 22136 KB Output is correct
28 Correct 268 ms 22136 KB Output is correct
29 Correct 106 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 63 ms 5760 KB Output is correct
5 Correct 282 ms 22260 KB Output is correct
6 Correct 246 ms 22136 KB Output is correct
7 Correct 264 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 62 ms 5752 KB Output is correct
10 Correct 252 ms 22140 KB Output is correct
11 Correct 249 ms 22264 KB Output is correct
12 Correct 273 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 74 ms 5828 KB Output is correct
17 Correct 260 ms 22136 KB Output is correct
18 Correct 272 ms 22220 KB Output is correct
19 Correct 284 ms 22184 KB Output is correct
20 Correct 244 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 260 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 249 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 114 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 63 ms 5832 KB Output is correct
21 Correct 251 ms 22100 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 270 ms 22136 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 101 ms 12184 KB Output is correct
27 Correct 280 ms 22136 KB Output is correct
28 Correct 242 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 0 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 10 ms 1152 KB Output is correct
37 Correct 245 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 1152 KB Output is correct
41 Correct 255 ms 22092 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 12108 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 65 ms 5884 KB Output is correct
50 Correct 251 ms 22264 KB Output is correct
51 Correct 255 ms 22136 KB Output is correct
52 Correct 264 ms 22136 KB Output is correct
53 Correct 103 ms 12152 KB Output is correct
54 Correct 102 ms 12152 KB Output is correct
55 Correct 256 ms 22136 KB Output is correct
56 Correct 268 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 5 ms 768 KB Output is correct
61 Correct 116 ms 12152 KB Output is correct
62 Correct 0 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 83 ms 6008 KB Output is correct
66 Correct 107 ms 12108 KB Output is correct
67 Correct 103 ms 12156 KB Output is correct
68 Correct 109 ms 12152 KB Output is correct
69 Correct 107 ms 12236 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 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 260 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 249 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 114 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 63 ms 5832 KB Output is correct
21 Correct 251 ms 22100 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 270 ms 22136 KB Output is correct
24 Correct 245 ms 22136 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 101 ms 12184 KB Output is correct
27 Correct 280 ms 22136 KB Output is correct
28 Correct 242 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 0 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 10 ms 1152 KB Output is correct
37 Correct 245 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 1152 KB Output is correct
41 Correct 255 ms 22092 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 12108 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 65 ms 5884 KB Output is correct
50 Correct 251 ms 22264 KB Output is correct
51 Correct 255 ms 22136 KB Output is correct
52 Correct 264 ms 22136 KB Output is correct
53 Correct 103 ms 12152 KB Output is correct
54 Correct 102 ms 12152 KB Output is correct
55 Correct 256 ms 22136 KB Output is correct
56 Correct 268 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 63 ms 5760 KB Output is correct
62 Correct 282 ms 22260 KB Output is correct
63 Correct 246 ms 22136 KB Output is correct
64 Correct 264 ms 22136 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 62 ms 5752 KB Output is correct
67 Correct 252 ms 22140 KB Output is correct
68 Correct 249 ms 22264 KB Output is correct
69 Correct 273 ms 22136 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 74 ms 5828 KB Output is correct
74 Correct 260 ms 22136 KB Output is correct
75 Correct 272 ms 22220 KB Output is correct
76 Correct 284 ms 22184 KB Output is correct
77 Correct 244 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 116 ms 12152 KB Output is correct
82 Correct 0 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 83 ms 6008 KB Output is correct
86 Correct 107 ms 12108 KB Output is correct
87 Correct 103 ms 12156 KB Output is correct
88 Correct 109 ms 12152 KB Output is correct
89 Correct 107 ms 12236 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 768 KB Output is correct
93 Correct 116 ms 12152 KB Output is correct
94 Correct 0 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 26 ms 3328 KB Output is correct
98 Correct 107 ms 12152 KB Output is correct
99 Correct 102 ms 12280 KB Output is correct
100 Correct 104 ms 12152 KB Output is correct
101 Correct 113 ms 12236 KB Output is correct
102 Correct 128 ms 12280 KB Output is correct
103 Correct 124 ms 12280 KB Output is correct
104 Correct 121 ms 12536 KB Output is correct
105 Correct 115 ms 12152 KB Output is correct