oj.uz

답안 #928174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928174 2024-02-16T02:48:20 Z AlphaMale06 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 166 ms 22464 KB 
#include<bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define pb push_back

const int N = 1005;
int par[N];
int sz[N];
vector<int> comp[N];
vector<vector<int>> answer;

void make(int v){
    par[v]=v;
    sz[v]=1;
}

int find(int v){
    if(par[v]==v)return v;
    return par[v]=find(par[v]);
}

void merge(int u, int v){
    u=find(u);
    v=find(v);
    if(u==v)return;
    if(sz[u]<sz[v])swap(u, v);
    sz[u]+=sz[v];
    par[v]=u;
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	answer.resize(n);
	for(int i=0; i<n; i++){
        answer[i].resize(n);
        for(int j=0; j<n; j++)answer[i][j]=0;
	}
    for(int i=0; i<n; i++)make(i);
    for(int i=0; i< n; i++){
        for(int j=0; j< n; j++){
            if(p[i][j]!=0)merge(i, j);
            if(p[i][j]==3)return 0;
        }
    }
    for(int i=0; i< n; i++){
        for(int j=0; j< n; j++){
            if(p[i][j]==0 && find(i)==find(j))return 0;
        }
    }
    for(int i=0; i< n; i++){
        comp[find(i)].pb(i);
    }
    for(int i=0; i < n; i++)make(i);
    for(vector<int> cmp : comp){
        if(!cmp.size())continue;
        for(int e : cmp){
            for(int i : cmp){
                if(p[e][i]==1){
                    merge(e, i);
                }
            }
        }
        for(int e : cmp){
            for(int i : cmp){
                if(p[e][i]==2 && find(e)==find(i))return 0;
            }
        }
        for(int e : cmp){
            int f=find(e);
            if(f!=e){
                answer[e][f]=1;
                answer[f][e]=1;
            }
        }
        vector<int> vc;
        int cnt=1;
        for(int e : cmp)vc.pb(find(e));
        sort(vc.begin(), vc.end());
        for(int i=1; i<vc.size(); i++){
            if(vc[i]!=vc[i-1]){
                cnt++;
                answer[vc[i]][vc[i-1]]=1;
                answer[vc[i-1]][vc[i]]=1;
            }
            if(vc.back()!=vc[0]){
                answer[vc.back()][vc[0]]=1;
                answer[vc[0]][vc.back()]=1;
            }
        }
        if(cnt==2 && p[cmp[0]][cmp[1]]==2)return 0;
    }
    build(answer);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 156 ms 22144 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12080 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 38 ms 5716 KB Output is correct
21 Correct 154 ms 22096 KB Output is correct
22 Correct 159 ms 22104 KB Output is correct
23 Correct 157 ms 22164 KB Output is correct
24 Correct 151 ms 22052 KB Output is correct
25 Correct 60 ms 12064 KB Output is correct
26 Correct 59 ms 12112 KB Output is correct
27 Correct 159 ms 22060 KB Output is correct
28 Correct 162 ms 22068 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 360 KB Output is correct
4 Correct 0 ms 424 KB Output is correct
5 Correct 0 ms 348 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 1116 KB Output is correct
9 Correct 152 ms 22100 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 9 ms 1160 KB Output is correct
13 Correct 158 ms 22464 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12088 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 48 ms 5936 KB Output is correct
22 Correct 154 ms 22096 KB Output is correct
23 Correct 153 ms 22216 KB Output is correct
24 Correct 158 ms 22144 KB Output is correct
25 Correct 60 ms 12116 KB Output is correct
26 Correct 77 ms 12064 KB Output is correct
27 Correct 154 ms 22068 KB Output is correct
28 Correct 160 ms 22100 KB Output is correct
29 Correct 62 ms 12116 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 38 ms 5728 KB Output is correct
5 Correct 158 ms 22100 KB Output is correct
6 Correct 152 ms 22356 KB Output is correct
7 Correct 157 ms 22068 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 38 ms 5796 KB Output is correct
10 Correct 156 ms 22020 KB Output is correct
11 Correct 151 ms 22128 KB Output is correct
12 Correct 166 ms 21996 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 38 ms 5696 KB Output is correct
17 Correct 152 ms 22048 KB Output is correct
18 Correct 159 ms 21996 KB Output is correct
19 Correct 153 ms 22012 KB Output is correct
20 Correct 153 ms 22324 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 156 ms 22144 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12080 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 38 ms 5716 KB Output is correct
21 Correct 154 ms 22096 KB Output is correct
22 Correct 159 ms 22104 KB Output is correct
23 Correct 157 ms 22164 KB Output is correct
24 Correct 151 ms 22052 KB Output is correct
25 Correct 60 ms 12064 KB Output is correct
26 Correct 59 ms 12112 KB Output is correct
27 Correct 159 ms 22060 KB Output is correct
28 Correct 162 ms 22068 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 360 KB Output is correct
32 Correct 0 ms 424 KB Output is correct
33 Correct 0 ms 348 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 1116 KB Output is correct
37 Correct 152 ms 22100 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 9 ms 1160 KB Output is correct
41 Correct 158 ms 22464 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 70 ms 12088 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 48 ms 5936 KB Output is correct
50 Correct 154 ms 22096 KB Output is correct
51 Correct 153 ms 22216 KB Output is correct
52 Correct 158 ms 22144 KB Output is correct
53 Correct 60 ms 12116 KB Output is correct
54 Correct 77 ms 12064 KB Output is correct
55 Correct 154 ms 22068 KB Output is correct
56 Correct 160 ms 22100 KB Output is correct
57 Correct 62 ms 12116 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 77 ms 12064 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 38 ms 5872 KB Output is correct
66 Correct 65 ms 12068 KB Output is correct
67 Correct 61 ms 12088 KB Output is correct
68 Correct 65 ms 12060 KB Output is correct
69 Correct 61 ms 12116 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 156 ms 22144 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 70 ms 12080 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 38 ms 5716 KB Output is correct
21 Correct 154 ms 22096 KB Output is correct
22 Correct 159 ms 22104 KB Output is correct
23 Correct 157 ms 22164 KB Output is correct
24 Correct 151 ms 22052 KB Output is correct
25 Correct 60 ms 12064 KB Output is correct
26 Correct 59 ms 12112 KB Output is correct
27 Correct 159 ms 22060 KB Output is correct
28 Correct 162 ms 22068 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 360 KB Output is correct
32 Correct 0 ms 424 KB Output is correct
33 Correct 0 ms 348 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 1116 KB Output is correct
37 Correct 152 ms 22100 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 9 ms 1160 KB Output is correct
41 Correct 158 ms 22464 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 70 ms 12088 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 48 ms 5936 KB Output is correct
50 Correct 154 ms 22096 KB Output is correct
51 Correct 153 ms 22216 KB Output is correct
52 Correct 158 ms 22144 KB Output is correct
53 Correct 60 ms 12116 KB Output is correct
54 Correct 77 ms 12064 KB Output is correct
55 Correct 154 ms 22068 KB Output is correct
56 Correct 160 ms 22100 KB Output is correct
57 Correct 62 ms 12116 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 38 ms 5728 KB Output is correct
62 Correct 158 ms 22100 KB Output is correct
63 Correct 152 ms 22356 KB Output is correct
64 Correct 157 ms 22068 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 38 ms 5796 KB Output is correct
67 Correct 156 ms 22020 KB Output is correct
68 Correct 151 ms 22128 KB Output is correct
69 Correct 166 ms 21996 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 38 ms 5696 KB Output is correct
74 Correct 152 ms 22048 KB Output is correct
75 Correct 159 ms 21996 KB Output is correct
76 Correct 153 ms 22012 KB Output is correct
77 Correct 153 ms 22324 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 77 ms 12064 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 38 ms 5872 KB Output is correct
86 Correct 65 ms 12068 KB Output is correct
87 Correct 61 ms 12088 KB Output is correct
88 Correct 65 ms 12060 KB Output is correct
89 Correct 61 ms 12116 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 96 ms 12068 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 15 ms 3248 KB Output is correct
98 Correct 59 ms 12116 KB Output is correct
99 Correct 60 ms 12112 KB Output is correct
100 Correct 60 ms 12116 KB Output is correct
101 Correct 59 ms 12064 KB Output is correct
102 Correct 58 ms 12116 KB Output is correct
103 Correct 60 ms 12112 KB Output is correct
104 Correct 59 ms 12116 KB Output is correct
105 Correct 69 ms 12116 KB Output is correct