oj.uz

답안 #1022219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022219 2024-07-13T11:14:52 Z hmm789 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 161 ms 28240 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> grp[1000], grp2[1000];
vector<vector<int>> p;
int cnt = 0, n;
int pos[1000], pos2[1000];
bool v[1000];

void dfs(int x) {
    grp[cnt].push_back(x);
    pos[x] = cnt;
    v[x] = 1;
    for(int i = 0; i < n; i++) if(!v[i] && p[x][i] == 1) dfs(i);
}

void dfs2(int x, int g) {
    v[x] = 1;
    grp2[g].push_back(x);
    pos2[x] = g;
    for(int i = 0; i < cnt; i++) if(!v[i] && p[grp[x][0]][grp[i][0]] == 2) dfs2(i, g);
}

int construct(std::vector<std::vector<int>> P) {
    n = (int)P.size();
    vector<vector<int>> ans;
    for(int i = 0; i < n; i++) {
        vector<int> v;
        for(int j = 0; j < n; j++) v.push_back(P[i][j]);
        p.push_back(v);
        vector<int> v2;
        v2.resize(n);
        ans.push_back(v2);
    }
    for(int i = 0; i < n; i++) if(!v[i]) {
        dfs(i); cnt++;
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(pos[i] != pos[j] && p[i][j] == 1) return 0;
            if(pos[i] == pos[j] && p[i][j] != 1) return 0;
            if(p[grp[pos[i]][0]][grp[pos[j]][0]] != p[i][j]) return 0;
            if(p[i][j] == 3) return 0;
        }
    }
    memset(v, 0, sizeof(v));
    int c2 = 0;
    for(int i = 0; i < cnt; i++) if(!v[i]) dfs2(i, c2++);
    for(int i = 0; i < c2; i++) {
        for(int j : grp2[i]) {
            for(int k : grp2[i]) {
                if(p[grp[j][0]][grp[k][0]] == 0) return 0;
            }
        }
    }
    for(int i = 0; i < cnt; i++) {
        for(int j = 0; j < cnt; j++) {
            if(pos2[i] != pos2[j] && p[grp[i][0]][grp[j][0]] == 2) return 0;
        }
    }
    for(int i = 0; i < cnt; i++) {
        for(int j = 1; j < grp[i].size(); j++) {
            ans[grp[i][0]][grp[i][j]] = ans[grp[i][j]][grp[i][0]] = 1;
        }
    }
    memset(v, 0, sizeof(v));
    for(int i = 0; i < cnt; i++) if(!v[i]) {
        v[i] = 1;
        int prv = i, cnt2 = 0;
        for(int j = 0; j < cnt; j++) if(!v[j] && p[grp[i][0]][grp[j][0]] == 2) {
            ans[grp[prv][0]][grp[j][0]] = ans[grp[j][0]][grp[prv][0]] = 1;
            v[j] = 1;
            prv = j;
            cnt2++;
        }
        if(cnt2 == 1) return 0;
        if(i != prv) ans[grp[prv][0]][grp[i][0]] = ans[grp[i][0]][grp[prv][0]] = 1;
    }
    build(ans);
    return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1492 KB Output is correct
7 Correct 131 ms 27988 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1492 KB Output is correct
7 Correct 131 ms 27988 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 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1492 KB Output is correct
13 Correct 121 ms 27984 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 1116 KB Output is correct
17 Correct 62 ms 18260 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 7392 KB Output is correct
21 Correct 131 ms 28128 KB Output is correct
22 Correct 133 ms 28088 KB Output is correct
23 Correct 126 ms 27988 KB Output is correct
24 Correct 125 ms 27988 KB Output is correct
25 Correct 56 ms 18004 KB Output is correct
26 Correct 61 ms 18092 KB Output is correct
27 Correct 124 ms 27984 KB Output is correct
28 Correct 139 ms 27988 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 484 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 6 ms 1624 KB Output is correct
9 Correct 127 ms 27984 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1628 KB Output is correct
13 Correct 132 ms 28196 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 68 ms 18220 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 476 KB Output is correct
21 Correct 32 ms 7432 KB Output is correct
22 Correct 128 ms 27988 KB Output is correct
23 Correct 161 ms 28076 KB Output is correct
24 Correct 134 ms 28080 KB Output is correct
25 Correct 59 ms 18256 KB Output is correct
26 Correct 58 ms 18256 KB Output is correct
27 Correct 127 ms 28048 KB Output is correct
28 Correct 128 ms 27988 KB Output is correct
29 Correct 61 ms 18260 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 29 ms 7272 KB Output is correct
5 Correct 127 ms 28080 KB Output is correct
6 Correct 121 ms 27988 KB Output is correct
7 Correct 133 ms 28240 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 31 ms 7260 KB Output is correct
10 Correct 126 ms 27988 KB Output is correct
11 Correct 120 ms 27988 KB Output is correct
12 Correct 129 ms 27988 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 32 ms 7316 KB Output is correct
17 Correct 161 ms 27984 KB Output is correct
18 Correct 124 ms 27984 KB Output is correct
19 Correct 119 ms 28148 KB Output is correct
20 Correct 125 ms 28088 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1492 KB Output is correct
7 Correct 131 ms 27988 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 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1492 KB Output is correct
13 Correct 121 ms 27984 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 1116 KB Output is correct
17 Correct 62 ms 18260 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 7392 KB Output is correct
21 Correct 131 ms 28128 KB Output is correct
22 Correct 133 ms 28088 KB Output is correct
23 Correct 126 ms 27988 KB Output is correct
24 Correct 125 ms 27988 KB Output is correct
25 Correct 56 ms 18004 KB Output is correct
26 Correct 61 ms 18092 KB Output is correct
27 Correct 124 ms 27984 KB Output is correct
28 Correct 139 ms 27988 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 484 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 6 ms 1624 KB Output is correct
37 Correct 127 ms 27984 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1628 KB Output is correct
41 Correct 132 ms 28196 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 1116 KB Output is correct
45 Correct 68 ms 18220 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 476 KB Output is correct
49 Correct 32 ms 7432 KB Output is correct
50 Correct 128 ms 27988 KB Output is correct
51 Correct 161 ms 28076 KB Output is correct
52 Correct 134 ms 28080 KB Output is correct
53 Correct 59 ms 18256 KB Output is correct
54 Correct 58 ms 18256 KB Output is correct
55 Correct 127 ms 28048 KB Output is correct
56 Correct 128 ms 27988 KB Output is correct
57 Correct 61 ms 18260 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 1112 KB Output is correct
61 Correct 59 ms 18260 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 32 ms 7348 KB Output is correct
66 Correct 55 ms 18260 KB Output is correct
67 Correct 57 ms 18096 KB Output is correct
68 Correct 55 ms 18232 KB Output is correct
69 Correct 61 ms 18256 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1492 KB Output is correct
7 Correct 131 ms 27988 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 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1492 KB Output is correct
13 Correct 121 ms 27984 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 1116 KB Output is correct
17 Correct 62 ms 18260 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 7392 KB Output is correct
21 Correct 131 ms 28128 KB Output is correct
22 Correct 133 ms 28088 KB Output is correct
23 Correct 126 ms 27988 KB Output is correct
24 Correct 125 ms 27988 KB Output is correct
25 Correct 56 ms 18004 KB Output is correct
26 Correct 61 ms 18092 KB Output is correct
27 Correct 124 ms 27984 KB Output is correct
28 Correct 139 ms 27988 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 484 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 6 ms 1624 KB Output is correct
37 Correct 127 ms 27984 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1628 KB Output is correct
41 Correct 132 ms 28196 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 1116 KB Output is correct
45 Correct 68 ms 18220 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 476 KB Output is correct
49 Correct 32 ms 7432 KB Output is correct
50 Correct 128 ms 27988 KB Output is correct
51 Correct 161 ms 28076 KB Output is correct
52 Correct 134 ms 28080 KB Output is correct
53 Correct 59 ms 18256 KB Output is correct
54 Correct 58 ms 18256 KB Output is correct
55 Correct 127 ms 28048 KB Output is correct
56 Correct 128 ms 27988 KB Output is correct
57 Correct 61 ms 18260 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 29 ms 7272 KB Output is correct
62 Correct 127 ms 28080 KB Output is correct
63 Correct 121 ms 27988 KB Output is correct
64 Correct 133 ms 28240 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 31 ms 7260 KB Output is correct
67 Correct 126 ms 27988 KB Output is correct
68 Correct 120 ms 27988 KB Output is correct
69 Correct 129 ms 27988 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 32 ms 7316 KB Output is correct
74 Correct 161 ms 27984 KB Output is correct
75 Correct 124 ms 27984 KB Output is correct
76 Correct 119 ms 28148 KB Output is correct
77 Correct 125 ms 28088 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 1112 KB Output is correct
81 Correct 59 ms 18260 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 32 ms 7348 KB Output is correct
86 Correct 55 ms 18260 KB Output is correct
87 Correct 57 ms 18096 KB Output is correct
88 Correct 55 ms 18232 KB Output is correct
89 Correct 61 ms 18256 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 484 KB Output is correct
92 Correct 3 ms 1116 KB Output is correct
93 Correct 79 ms 18236 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 604 KB Output is correct
97 Correct 15 ms 4956 KB Output is correct
98 Correct 58 ms 18232 KB Output is correct
99 Correct 57 ms 18256 KB Output is correct
100 Correct 55 ms 18004 KB Output is correct
101 Correct 62 ms 18240 KB Output is correct
102 Correct 55 ms 18512 KB Output is correct
103 Correct 54 ms 18232 KB Output is correct
104 Correct 93 ms 18256 KB Output is correct
105 Correct 109 ms 18224 KB Output is correct