oj.uz

답안 #315460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315460 2020-10-22T23:47:42 Z tevdore 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 278 ms 22280 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
const int N = 1e3 + 10;
int f[N], a[N], P[N];
int find_set(int x) {
    if(x == P[x]) return x;
    return P[x] = find_set(P[x]);
}
void union_set(int x, int y) {
    x = find_set(x);
    y = find_set(y);
    P[y] = x;
}
int construct(vector < vector < int > > p) {
    for(int i = 0; i < p.size(); i++) P[i] = i;
    for(int i = 0; i < p.size(); i++) {
        for(int j = 0; j < p.size(); j++) {
            if(p[i][j] != 0) union_set(i, j);
        }
    }
    for(int i = 0; i < p.size(); i++) {
        for(int j = 0; j < p.size(); j++) {
            if(p[i][j] == 3 || (find_set(i) == find_set(j) && p[i][j] == 0)) return 0;
        }
    }
    vector < vector < int > > vr(p.size(), vector < int > (0, 0));
    for(int i = 0; i < p.size(); i++) {
        int m = find_set(i);
        vr[m].push_back(i);
    }
    int q = 0;
    vector < vector < int > > ans(p.size(), vector < int > (p.size(), 0));
    for(int i = 0; i < p.size(); i++) P[i] = i;
    for(int i = 0; i < p.size(); i++) {
        if(vr[i].size()) {
            for(int u : vr[i]) {
                for(int v : vr[i]) {
                    if(p[u][v] == 1) {
                        union_set(u, v);
                    }
                }
            }
            for(int u : vr[i]) {
                for(int v : vr[i]) {
                    if(p[u][v] == 2) {
                        if(find_set(u) == find_set(v)) return 0;
                    }
                }
            }
            for(int j = 0; j < p.size(); j++) f[j] = -1e9;
            for(int u : vr[i]) {
                if(u == find_set(u)) {
                    a[++q] = u;
                }
                int m = find_set(u);
                if(f[m] != -1e9) {
                    ans[f[m]][u] = 1;
                    ans[u][f[m]] = 1;
                }
                f[m] = u;
            }
            if(q == 2) return 0;
            for(int i = 2; i <= q + 1; i++) {
                if(q + 1 == i) {
                    if(a[i - 1] != a[i - q]) {
                        ans[a[i - 1]][a[i - q]] = 1;
                        ans[a[i - q]][a[i - 1]] = 1;
                    }
                    continue;
                }
                ans[a[i]][a[i - 1]] = 1;
                ans[a[i - 1]][a[i]] = 1;
            }
            q = 0;
        }
    }
    build(ans);
    return 1;
}
// main() {
//     cout << construct({{1, 1, 2 , 2}, {1, 1, 2, 2}, {2, 2, 1, 2}, {2, 2, 2, 1}}) << "\n";
// }

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i = 0; i < p.size(); i++) P[i] = i;
      |                    ~~^~~~~~~~~~
supertrees.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i = 0; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~
supertrees.cpp:18:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for(int j = 0; j < p.size(); j++) {
      |                        ~~^~~~~~~~~~
supertrees.cpp:22:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 0; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~
supertrees.cpp:23:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for(int j = 0; j < p.size(); j++) {
      |                        ~~^~~~~~~~~~
supertrees.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i = 0; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~
supertrees.cpp:34:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0; i < p.size(); i++) P[i] = i;
      |                    ~~^~~~~~~~~~
supertrees.cpp:35:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 0; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~
supertrees.cpp:51:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |             for(int j = 0; j < p.size(); j++) f[j] = -1e9;
      |                            ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 271 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 271 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 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 235 ms 22104 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 119 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5884 KB Output is correct
21 Correct 250 ms 22264 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 274 ms 22136 KB Output is correct
24 Correct 245 ms 22280 KB Output is correct
25 Correct 100 ms 8184 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 278 ms 22136 KB Output is correct
28 Correct 237 ms 22240 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 233 ms 22136 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 1280 KB Output is correct
13 Correct 256 ms 22236 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 640 KB Output is correct
17 Correct 114 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 62 ms 5880 KB Output is correct
22 Correct 246 ms 22140 KB Output is correct
23 Correct 239 ms 22136 KB Output is correct
24 Correct 264 ms 22136 KB Output is correct
25 Correct 96 ms 12152 KB Output is correct
26 Correct 96 ms 8184 KB Output is correct
27 Correct 244 ms 22136 KB Output is correct
28 Correct 263 ms 22136 KB Output is correct
29 Correct 98 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 250 ms 22136 KB Output is correct
6 Correct 239 ms 22136 KB Output is correct
7 Correct 269 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 60 ms 5880 KB Output is correct
10 Correct 246 ms 22136 KB Output is correct
11 Correct 246 ms 22136 KB Output is correct
12 Correct 269 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 61 ms 5880 KB Output is correct
17 Correct 243 ms 22136 KB Output is correct
18 Correct 244 ms 22096 KB Output is correct
19 Correct 238 ms 22136 KB Output is correct
20 Correct 234 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 271 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 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 235 ms 22104 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 119 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5884 KB Output is correct
21 Correct 250 ms 22264 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 274 ms 22136 KB Output is correct
24 Correct 245 ms 22280 KB Output is correct
25 Correct 100 ms 8184 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 278 ms 22136 KB Output is correct
28 Correct 237 ms 22240 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 308 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 233 ms 22136 KB Output is correct
38 Correct 1 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 256 ms 22236 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 640 KB Output is correct
45 Correct 114 ms 8184 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 62 ms 5880 KB Output is correct
50 Correct 246 ms 22140 KB Output is correct
51 Correct 239 ms 22136 KB Output is correct
52 Correct 264 ms 22136 KB Output is correct
53 Correct 96 ms 12152 KB Output is correct
54 Correct 96 ms 8184 KB Output is correct
55 Correct 244 ms 22136 KB Output is correct
56 Correct 263 ms 22136 KB Output is correct
57 Correct 98 ms 12152 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 121 ms 8184 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 60 ms 5884 KB Output is correct
66 Correct 97 ms 8184 KB Output is correct
67 Correct 101 ms 8184 KB Output is correct
68 Correct 94 ms 8284 KB Output is correct
69 Correct 96 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 271 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 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 235 ms 22104 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 119 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5884 KB Output is correct
21 Correct 250 ms 22264 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 274 ms 22136 KB Output is correct
24 Correct 245 ms 22280 KB Output is correct
25 Correct 100 ms 8184 KB Output is correct
26 Correct 94 ms 8184 KB Output is correct
27 Correct 278 ms 22136 KB Output is correct
28 Correct 237 ms 22240 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 308 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 233 ms 22136 KB Output is correct
38 Correct 1 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 256 ms 22236 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 640 KB Output is correct
45 Correct 114 ms 8184 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 62 ms 5880 KB Output is correct
50 Correct 246 ms 22140 KB Output is correct
51 Correct 239 ms 22136 KB Output is correct
52 Correct 264 ms 22136 KB Output is correct
53 Correct 96 ms 12152 KB Output is correct
54 Correct 96 ms 8184 KB Output is correct
55 Correct 244 ms 22136 KB Output is correct
56 Correct 263 ms 22136 KB Output is correct
57 Correct 98 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 250 ms 22136 KB Output is correct
63 Correct 239 ms 22136 KB Output is correct
64 Correct 269 ms 22136 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 60 ms 5880 KB Output is correct
67 Correct 246 ms 22136 KB Output is correct
68 Correct 246 ms 22136 KB Output is correct
69 Correct 269 ms 22136 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Correct 61 ms 5880 KB Output is correct
74 Correct 243 ms 22136 KB Output is correct
75 Correct 244 ms 22096 KB Output is correct
76 Correct 238 ms 22136 KB Output is correct
77 Correct 234 ms 22136 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 5 ms 640 KB Output is correct
81 Correct 121 ms 8184 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 60 ms 5884 KB Output is correct
86 Correct 97 ms 8184 KB Output is correct
87 Correct 101 ms 8184 KB Output is correct
88 Correct 94 ms 8284 KB Output is correct
89 Correct 96 ms 12280 KB Output is correct
90 Correct 1 ms 288 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 114 ms 8184 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 25 ms 2304 KB Output is correct
98 Correct 96 ms 8184 KB Output is correct
99 Correct 102 ms 8184 KB Output is correct
100 Correct 94 ms 8184 KB Output is correct
101 Correct 93 ms 8184 KB Output is correct
102 Correct 108 ms 8184 KB Output is correct
103 Correct 113 ms 8156 KB Output is correct
104 Correct 110 ms 8184 KB Output is correct
105 Correct 118 ms 8184 KB Output is correct