oj.uz

답안 #300646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300646 2020-09-17T10:56:14 Z nandonathaniel 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 280 ms 24168 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);
			}
		}
		for(auto isi : kel[i])kelkecil[find(isi)].push_back(isi);
		vector<int> satu1,satu2,dua;
		for(int j=0;j<n;j++){
			if(kelkecil[j].size()<=1)continue;
			if(satu1.empty()){
				satu1=kelkecil[j];
			}
			else{
				if(satu2.empty())satu2=kelkecil[j];
				else return 0;
			}
		}
		for(auto isi : satu1)idx[isi]=true;
		for(auto isi : satu2)idx[isi]=true;
		for(auto isi : kel[i]){
			if(!idx[isi])dua.push_back(isi);
		}
		if(satu1.empty() && satu2.empty()){
			if(dua.size()==2)return 0;
			for(int j=0;j<dua.size()-1;j++){
				ans[dua[j]][dua[j+1]]=1;
				ans[dua[j+1]][dua[j]]=1;
			}
			ans[dua[0]][dua.back()]=1;
			ans[dua.back()][dua[0]]=1;
			continue;
		}
		if(!satu1.empty() && !satu2.empty()){
			if(dua.empty())return 0;
			for(int j=0;j<satu1.size()-1;j++){
				ans[satu1[j]][satu1[j+1]]=1;
				ans[satu1[j+1]][satu1[j]]=1;
			}
			ans[satu1.back()][dua[0]]=1;
			ans[dua[0]][satu1.back()]=1;
			for(int j=0;j<(int)dua.size()-1;j++){
				ans[dua[j]][dua[j+1]]=1;
				ans[dua[j+1]][dua[j]]=1;
			}
			ans[dua.back()][satu2[0]]=1;
			ans[satu2[0]][dua.back()]=1;
			for(int j=0;j<satu2.size()-1;j++){
				ans[satu2[j]][satu2[j+1]]=1;
				ans[satu2[j+1]][satu2[j]]=1;
			}
			ans[satu1.back()][satu2[0]]=1;
			ans[satu2[0]][satu1.back()]=1;
		}
		else{
			if(dua.size()==1)return 0;
			for(int j=0;j<satu1.size()-1;j++){
				ans[satu1[j]][satu1[j+1]]=1;
				ans[satu1[j+1]][satu1[j]]=1;
			}
			for(int j=0;j<(int)dua.size()-1;j++){
				ans[dua[j]][dua[j+1]]=1;
				ans[dua[j+1]][dua[j]]=1;
			}
			if(!dua.empty()){
				ans[dua.back()][satu1[0]]=1;
				ans[satu1[0]][dua.back()]=1;
				ans[dua[0]][satu1[0]]=1;
				ans[satu1[0]][dua[0]]=1;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:71:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |    for(int j=0;j<dua.size()-1;j++){
      |                ~^~~~~~~~~~~~~
supertrees.cpp:81:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |    for(int j=0;j<satu1.size()-1;j++){
      |                ~^~~~~~~~~~~~~~~
supertrees.cpp:93:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |    for(int j=0;j<satu2.size()-1;j++){
      |                ~^~~~~~~~~~~~~~~
supertrees.cpp:102:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |    for(int j=0;j<satu1.size()-1;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 11 ms 1280 KB Output is correct
7 Correct 276 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 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 11 ms 1280 KB Output is correct
7 Correct 276 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 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 248 ms 24032 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 122 ms 14312 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 69 ms 6252 KB Output is correct
21 Correct 253 ms 23612 KB Output is correct
22 Correct 254 ms 24036 KB Output is correct
23 Correct 269 ms 22320 KB Output is correct
24 Correct 246 ms 24036 KB Output is correct
25 Correct 116 ms 15716 KB Output is correct
26 Correct 108 ms 16116 KB Output is correct
27 Correct 270 ms 22344 KB Output is correct
28 Correct 251 ms 24036 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 242 ms 24044 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 246 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 120 ms 14184 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 62 ms 6252 KB Output is correct
22 Correct 250 ms 23652 KB Output is correct
23 Correct 257 ms 24032 KB Output is correct
24 Correct 264 ms 22196 KB Output is correct
25 Correct 109 ms 16100 KB Output is correct
26 Correct 110 ms 15844 KB Output is correct
27 Correct 251 ms 24036 KB Output is correct
28 Correct 259 ms 22164 KB Output is correct
29 Correct 116 ms 16356 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 72 ms 6252 KB Output is correct
5 Correct 257 ms 23684 KB Output is correct
6 Correct 269 ms 24168 KB Output is correct
7 Correct 280 ms 22192 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 64 ms 6380 KB Output is correct
10 Correct 259 ms 23652 KB Output is correct
11 Correct 260 ms 24008 KB Output is correct
12 Correct 272 ms 22192 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Incorrect 28 ms 4348 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
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 11 ms 1280 KB Output is correct
7 Correct 276 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 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 248 ms 24032 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 122 ms 14312 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 69 ms 6252 KB Output is correct
21 Correct 253 ms 23612 KB Output is correct
22 Correct 254 ms 24036 KB Output is correct
23 Correct 269 ms 22320 KB Output is correct
24 Correct 246 ms 24036 KB Output is correct
25 Correct 116 ms 15716 KB Output is correct
26 Correct 108 ms 16116 KB Output is correct
27 Correct 270 ms 22344 KB Output is correct
28 Correct 251 ms 24036 KB Output is correct
29 Correct 0 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 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1368 KB Output is correct
37 Correct 242 ms 24044 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 246 ms 22136 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 120 ms 14184 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 62 ms 6252 KB Output is correct
50 Correct 250 ms 23652 KB Output is correct
51 Correct 257 ms 24032 KB Output is correct
52 Correct 264 ms 22196 KB Output is correct
53 Correct 109 ms 16100 KB Output is correct
54 Correct 110 ms 15844 KB Output is correct
55 Correct 251 ms 24036 KB Output is correct
56 Correct 259 ms 22164 KB Output is correct
57 Correct 116 ms 16356 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 7 ms 896 KB Output is correct
61 Correct 133 ms 13564 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Incorrect 30 ms 4332 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
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 11 ms 1280 KB Output is correct
7 Correct 276 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 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1368 KB Output is correct
13 Correct 248 ms 24032 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 122 ms 14312 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 69 ms 6252 KB Output is correct
21 Correct 253 ms 23612 KB Output is correct
22 Correct 254 ms 24036 KB Output is correct
23 Correct 269 ms 22320 KB Output is correct
24 Correct 246 ms 24036 KB Output is correct
25 Correct 116 ms 15716 KB Output is correct
26 Correct 108 ms 16116 KB Output is correct
27 Correct 270 ms 22344 KB Output is correct
28 Correct 251 ms 24036 KB Output is correct
29 Correct 0 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 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1368 KB Output is correct
37 Correct 242 ms 24044 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 246 ms 22136 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 120 ms 14184 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 62 ms 6252 KB Output is correct
50 Correct 250 ms 23652 KB Output is correct
51 Correct 257 ms 24032 KB Output is correct
52 Correct 264 ms 22196 KB Output is correct
53 Correct 109 ms 16100 KB Output is correct
54 Correct 110 ms 15844 KB Output is correct
55 Correct 251 ms 24036 KB Output is correct
56 Correct 259 ms 22164 KB Output is correct
57 Correct 116 ms 16356 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 404 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 72 ms 6252 KB Output is correct
62 Correct 257 ms 23684 KB Output is correct
63 Correct 269 ms 24168 KB Output is correct
64 Correct 280 ms 22192 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 64 ms 6380 KB Output is correct
67 Correct 259 ms 23652 KB Output is correct
68 Correct 260 ms 24008 KB Output is correct
69 Correct 272 ms 22192 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct
73 Incorrect 28 ms 4348 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -