oj.uz

답안 #301634

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301634 2020-09-18T05:36:17 Z nandonathaniel 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 284 ms 24212 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
typedef pair<int,int> pii;
const int MAXN=1005;

int par[MAXN];
bool idx[MAXN];
vector<int> kel[MAXN],kelkecil[MAXN];

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

void join(int a,int b){
	int ortua=find(a),ortub=find(b);
	par[ortua]=ortub;
}

int construct(vector<vector<int>> p){
	vector<pii> nol;
	vector<vector<int>> ans;
	int n = p.size();
	for(int i=0;i<n;i++)par[i]=i;
	ans.resize(n);
	for(int i=0;i<n;i++){
		ans[i].resize(n);
		for(int j=0;j<n;j++){
			ans[i][j]=0;
			if(i==j)continue;
			if(p[i][j])join(i,j);
			else if(i<j)nol.push_back({i,j});
		}
	}
	for(auto isi : nol){
		if(find(isi.first)==find(isi.second))return 0;
	}
	for(int i=0;i<n;i++)kel[find(i)].push_back(i);
	for(int i=0;i<n;i++){
		if(kel[i].size()<=1)continue;
		for(int j=0;j<n;j++){
			kelkecil[j].clear();
			par[j]=j;
			idx[j]=false;
		}
		for(auto isi : kel[i]){
			for(auto isi2 : kel[i]){
				if(p[isi][isi2]==1)join(isi,isi2);
				else if(p[isi][isi2]==3)return 0;
			}
		}
		for(auto isi : kel[i])kelkecil[find(isi)].push_back(isi);
		vector<vector<int>> satu;
		vector<int> rest;
		for(int j=0;j<n;j++){
			if(kelkecil[j].size()<=1)continue;
			for(auto isi : kelkecil[j]){
				for(auto isi2 : kelkecil[j]){
					if(p[isi][isi2]!=1)return 0;
				}
			}
			satu.push_back(kelkecil[j]);
		}
		for(auto isi : satu){
			for(auto isi2 : isi)idx[isi2]=true;
		}
		for(auto isi : kel[i]){
			if(!idx[isi])rest.push_back(isi);
		}
		vector<int> cycle;
		for(auto isi : rest)cycle.push_back(isi);
		for(auto isi : satu)cycle.push_back(isi.back());
		if(cycle.size()==2)return 0;
		for(auto isi : satu){
			for(int j=0;j<isi.size()-1;j++){
				ans[isi[j]][isi[j+1]]=1;
				ans[isi[j+1]][isi[j]]=1;
			}
		}
		if(cycle.size()>1){
			for(int j=0;j<cycle.size();j++){
				ans[cycle[j]][cycle[(j+1)%cycle.size()]]=1;
				ans[cycle[(j+1)%cycle.size()]][cycle[j]]=1;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

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

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 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 270 ms 22392 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 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 270 ms 22392 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1368 KB Output is correct
13 Correct 260 ms 24212 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 136 ms 14184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 67 ms 6252 KB Output is correct
21 Correct 269 ms 23656 KB Output is correct
22 Correct 271 ms 24032 KB Output is correct
23 Correct 278 ms 22320 KB Output is correct
24 Correct 262 ms 24036 KB Output is correct
25 Correct 124 ms 15720 KB Output is correct
26 Correct 121 ms 16228 KB Output is correct
27 Correct 274 ms 22320 KB Output is correct
28 Correct 265 ms 24164 KB Output is correct

Subtask #3
19.0 / 19.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 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 11 ms 1368 KB Output is correct
9 Correct 260 ms 24036 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 262 ms 22392 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 137 ms 14184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 65 ms 6388 KB Output is correct
22 Correct 265 ms 23784 KB Output is correct
23 Correct 263 ms 24036 KB Output is correct
24 Correct 272 ms 22192 KB Output is correct
25 Correct 122 ms 16104 KB Output is correct
26 Correct 125 ms 15844 KB Output is correct
27 Correct 262 ms 24160 KB Output is correct
28 Correct 267 ms 22188 KB Output is correct
29 Correct 125 ms 16228 KB Output is correct

Subtask #4
35.0 / 35.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 512 KB Output is correct
4 Correct 70 ms 6380 KB Output is correct
5 Correct 269 ms 23652 KB Output is correct
6 Correct 284 ms 24036 KB Output is correct
7 Correct 273 ms 22188 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 68 ms 6380 KB Output is correct
10 Correct 263 ms 23780 KB Output is correct
11 Correct 258 ms 24036 KB Output is correct
12 Correct 273 ms 22348 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 68 ms 6380 KB Output is correct
17 Correct 265 ms 23780 KB Output is correct
18 Correct 264 ms 23652 KB Output is correct
19 Correct 260 ms 23908 KB Output is correct
20 Correct 257 ms 24036 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 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 270 ms 22392 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1368 KB Output is correct
13 Correct 260 ms 24212 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 136 ms 14184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 67 ms 6252 KB Output is correct
21 Correct 269 ms 23656 KB Output is correct
22 Correct 271 ms 24032 KB Output is correct
23 Correct 278 ms 22320 KB Output is correct
24 Correct 262 ms 24036 KB Output is correct
25 Correct 124 ms 15720 KB Output is correct
26 Correct 121 ms 16228 KB Output is correct
27 Correct 274 ms 22320 KB Output is correct
28 Correct 265 ms 24164 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1368 KB Output is correct
37 Correct 260 ms 24036 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 262 ms 22392 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 137 ms 14184 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 65 ms 6388 KB Output is correct
50 Correct 265 ms 23784 KB Output is correct
51 Correct 263 ms 24036 KB Output is correct
52 Correct 272 ms 22192 KB Output is correct
53 Correct 122 ms 16104 KB Output is correct
54 Correct 125 ms 15844 KB Output is correct
55 Correct 262 ms 24160 KB Output is correct
56 Correct 267 ms 22188 KB Output is correct
57 Correct 125 ms 16228 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 139 ms 13544 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 70 ms 6388 KB Output is correct
66 Correct 126 ms 15716 KB Output is correct
67 Correct 126 ms 15716 KB Output is correct
68 Correct 126 ms 16100 KB Output is correct
69 Correct 125 ms 16228 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 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 270 ms 22392 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1368 KB Output is correct
13 Correct 260 ms 24212 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 136 ms 14184 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 67 ms 6252 KB Output is correct
21 Correct 269 ms 23656 KB Output is correct
22 Correct 271 ms 24032 KB Output is correct
23 Correct 278 ms 22320 KB Output is correct
24 Correct 262 ms 24036 KB Output is correct
25 Correct 124 ms 15720 KB Output is correct
26 Correct 121 ms 16228 KB Output is correct
27 Correct 274 ms 22320 KB Output is correct
28 Correct 265 ms 24164 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1368 KB Output is correct
37 Correct 260 ms 24036 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 262 ms 22392 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 137 ms 14184 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 65 ms 6388 KB Output is correct
50 Correct 265 ms 23784 KB Output is correct
51 Correct 263 ms 24036 KB Output is correct
52 Correct 272 ms 22192 KB Output is correct
53 Correct 122 ms 16104 KB Output is correct
54 Correct 125 ms 15844 KB Output is correct
55 Correct 262 ms 24160 KB Output is correct
56 Correct 267 ms 22188 KB Output is correct
57 Correct 125 ms 16228 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 512 KB Output is correct
61 Correct 70 ms 6380 KB Output is correct
62 Correct 269 ms 23652 KB Output is correct
63 Correct 284 ms 24036 KB Output is correct
64 Correct 273 ms 22188 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 68 ms 6380 KB Output is correct
67 Correct 263 ms 23780 KB Output is correct
68 Correct 258 ms 24036 KB Output is correct
69 Correct 273 ms 22348 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 512 KB Output is correct
73 Correct 68 ms 6380 KB Output is correct
74 Correct 265 ms 23780 KB Output is correct
75 Correct 264 ms 23652 KB Output is correct
76 Correct 260 ms 23908 KB Output is correct
77 Correct 257 ms 24036 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 6 ms 896 KB Output is correct
81 Correct 139 ms 13544 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 70 ms 6388 KB Output is correct
86 Correct 126 ms 15716 KB Output is correct
87 Correct 126 ms 15716 KB Output is correct
88 Correct 126 ms 16100 KB Output is correct
89 Correct 125 ms 16228 KB Output is correct
90 Correct 1 ms 416 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 6 ms 896 KB Output is correct
93 Correct 128 ms 13164 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 32 ms 4332 KB Output is correct
98 Correct 132 ms 15748 KB Output is correct
99 Correct 128 ms 15728 KB Output is correct
100 Correct 123 ms 16120 KB Output is correct
101 Correct 125 ms 16228 KB Output is correct
102 Correct 169 ms 12280 KB Output is correct
103 Correct 127 ms 12280 KB Output is correct
104 Correct 125 ms 12284 KB Output is correct
105 Correct 149 ms 14184 KB Output is correct