oj.uz

답안 #309938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309938 2020-10-05T03:44:49 Z Genius1506 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 275 ms 22396 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;

const int mxN = 1002;
int par[mxN];
void init(int n){
    for(int i = 0; i <= n; i++)
        par[i] = i;
}
int find(int x){
    if(par[x]!=x)
        return par[x] = find(par[x]);
    return par[x];
}
void merge(int x, int y){
    x = find(x);
    y = find(y);
    if(x==y)
        return;
    par[x]=y;
}
int construct(vector<vector<int>> p){
    for(auto x : p){
        for(auto y: x)
            if(y==3)
                return 0;
    }
    int n = p.size();
    vector<vector<int>>ans(n,vector<int>(n,0)),comp(n,vector<int>()),tree(n,vector<int>());
    init(n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(p[i][j])
                merge(i,j);
        }
    }
    for(int i = 0; i < n; i++)
        comp[find(i)].push_back(i);
    init(n);
    for(int i = 0; i < n; i++){
        for(int c1 : comp[i]){
            for(int c2 : comp[i]){
                if(p[c1][c2]==0)
                    return 0;
                else if(p[c1][c2]==1)
                    merge(c1,c2);
            }
        }
        vector<int>cycle;
        for(int x : comp[i]){
            if(find(x)==x)
                cycle.push_back(x);
            tree[find(x)].push_back(x);
        }
        if(cycle.size()==2)
            return 0;
        if(cycle.size()==1)
            continue;
        for(int j=0;j<cycle.size();j++){
            int x = (j+1==cycle.size()?0:j+1);
            ans[cycle[j]][cycle[x]]=1;
            ans[cycle[x]][cycle[j]]=1;
        }
    }
    for(int i = 0; i < n; i++){
        if(tree[i].size()==0)
            continue;
        int repn = tree[i][0];
        for(int j = 1; j < tree[i].size(); j++){
            ans[repn][tree[i][j]]=1;
            ans[tree[i][j]][repn]=1;
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:60:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int j=0;j<cycle.size();j++){
      |                     ~^~~~~~~~~~~~~
supertrees.cpp:61:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             int x = (j+1==cycle.size()?0:j+1);
      |                      ~~~^~~~~~~~~~~~~~
supertrees.cpp:70:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int j = 1; j < tree[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 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 256 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 265 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 1280 KB Output is correct
13 Correct 230 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 120 ms 12280 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5836 KB Output is correct
21 Correct 239 ms 22112 KB Output is correct
22 Correct 238 ms 22392 KB Output is correct
23 Correct 267 ms 22136 KB Output is correct
24 Correct 235 ms 22264 KB Output is correct
25 Correct 102 ms 12280 KB Output is correct
26 Correct 101 ms 12280 KB Output is correct
27 Correct 272 ms 22136 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 257 ms 22348 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 13 ms 1280 KB Output is correct
13 Correct 275 ms 22136 KB Output is correct
14 Correct 1 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 133 ms 12248 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 69 ms 5880 KB Output is correct
22 Correct 240 ms 22136 KB Output is correct
23 Correct 234 ms 22136 KB Output is correct
24 Correct 265 ms 22136 KB Output is correct
25 Correct 99 ms 12284 KB Output is correct
26 Correct 100 ms 12252 KB Output is correct
27 Correct 238 ms 22136 KB Output is correct
28 Correct 260 ms 22232 KB Output is correct
29 Correct 94 ms 12280 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 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 61 ms 5884 KB Output is correct
5 Correct 241 ms 22136 KB Output is correct
6 Correct 234 ms 22264 KB Output is correct
7 Correct 259 ms 22264 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 60 ms 5840 KB Output is correct
10 Correct 242 ms 22136 KB Output is correct
11 Correct 235 ms 22232 KB Output is correct
12 Correct 261 ms 22268 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 63 ms 5880 KB Output is correct
17 Correct 238 ms 22264 KB Output is correct
18 Correct 242 ms 22136 KB Output is correct
19 Correct 239 ms 22136 KB Output is correct
20 Correct 238 ms 22396 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 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 256 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 265 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 1280 KB Output is correct
13 Correct 230 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 120 ms 12280 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5836 KB Output is correct
21 Correct 239 ms 22112 KB Output is correct
22 Correct 238 ms 22392 KB Output is correct
23 Correct 267 ms 22136 KB Output is correct
24 Correct 235 ms 22264 KB Output is correct
25 Correct 102 ms 12280 KB Output is correct
26 Correct 101 ms 12280 KB Output is correct
27 Correct 272 ms 22136 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 257 ms 22348 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 13 ms 1280 KB Output is correct
41 Correct 275 ms 22136 KB Output is correct
42 Correct 1 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 133 ms 12248 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 69 ms 5880 KB Output is correct
50 Correct 240 ms 22136 KB Output is correct
51 Correct 234 ms 22136 KB Output is correct
52 Correct 265 ms 22136 KB Output is correct
53 Correct 99 ms 12284 KB Output is correct
54 Correct 100 ms 12252 KB Output is correct
55 Correct 238 ms 22136 KB Output is correct
56 Correct 260 ms 22232 KB Output is correct
57 Correct 94 ms 12280 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 119 ms 12252 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 256 KB Output is correct
65 Correct 61 ms 5880 KB Output is correct
66 Correct 101 ms 12300 KB Output is correct
67 Correct 105 ms 12152 KB Output is correct
68 Correct 96 ms 12152 KB Output is correct
69 Correct 98 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 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 256 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 265 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 1280 KB Output is correct
13 Correct 230 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 120 ms 12280 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 60 ms 5836 KB Output is correct
21 Correct 239 ms 22112 KB Output is correct
22 Correct 238 ms 22392 KB Output is correct
23 Correct 267 ms 22136 KB Output is correct
24 Correct 235 ms 22264 KB Output is correct
25 Correct 102 ms 12280 KB Output is correct
26 Correct 101 ms 12280 KB Output is correct
27 Correct 272 ms 22136 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 257 ms 22348 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 13 ms 1280 KB Output is correct
41 Correct 275 ms 22136 KB Output is correct
42 Correct 1 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 133 ms 12248 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 69 ms 5880 KB Output is correct
50 Correct 240 ms 22136 KB Output is correct
51 Correct 234 ms 22136 KB Output is correct
52 Correct 265 ms 22136 KB Output is correct
53 Correct 99 ms 12284 KB Output is correct
54 Correct 100 ms 12252 KB Output is correct
55 Correct 238 ms 22136 KB Output is correct
56 Correct 260 ms 22232 KB Output is correct
57 Correct 94 ms 12280 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 61 ms 5884 KB Output is correct
62 Correct 241 ms 22136 KB Output is correct
63 Correct 234 ms 22264 KB Output is correct
64 Correct 259 ms 22264 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 60 ms 5840 KB Output is correct
67 Correct 242 ms 22136 KB Output is correct
68 Correct 235 ms 22232 KB Output is correct
69 Correct 261 ms 22268 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 63 ms 5880 KB Output is correct
74 Correct 238 ms 22264 KB Output is correct
75 Correct 242 ms 22136 KB Output is correct
76 Correct 239 ms 22136 KB Output is correct
77 Correct 238 ms 22396 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 119 ms 12252 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 256 KB Output is correct
85 Correct 61 ms 5880 KB Output is correct
86 Correct 101 ms 12300 KB Output is correct
87 Correct 105 ms 12152 KB Output is correct
88 Correct 96 ms 12152 KB Output is correct
89 Correct 98 ms 12280 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 640 KB Output is correct
93 Correct 107 ms 8156 KB Output is correct
94 Correct 1 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 23 ms 2304 KB Output is correct
98 Correct 94 ms 8312 KB Output is correct
99 Correct 93 ms 8184 KB Output is correct
100 Correct 91 ms 8184 KB Output is correct
101 Correct 97 ms 8184 KB Output is correct
102 Correct 102 ms 8312 KB Output is correct
103 Correct 109 ms 8184 KB Output is correct
104 Correct 101 ms 8184 KB Output is correct
105 Correct 105 ms 8184 KB Output is correct