oj.uz

답안 #312424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312424 2020-10-13T06:59:14 Z huangqr 슈퍼트리 잇기 (IOI20_supertrees) C++14
100 / 100
 284 ms 22400 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;


int vis[1005];
std::vector<std::vector<int>> answer;

int nnn;


void dfs(int pos,vector<int>vd){
	vd.push_back(pos);
	vis[pos]++;
	for(int i=0;i<nnn;i++){
		if(answer[pos][i]==1){
			for(auto x:vd)if(x==i)goto br;
			dfs(i,vd);
		}
		br:;
	}
}

int construct(std::vector<std::vector<int>> p) {
	using namespace std;
	int n=p.size();
	nnn=n;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++)if(p[i][j]==3||p[j][i]!=p[i][j]||(n<=2&&p[i][j]==2))return 0;
	}
	int group[1005],small[1005],ctr=-1,ctr2=-1;;
	vector<set<int> >groups,smalls;
	unordered_map<int,vector<int> >groupstosmalls;
	for(int i=0;i<n;i++)group[i]=small[i]=-1;
	for(int i=0;i<n;i++){
		if(p[i][i]!=1)return 0;
		vector<int>r=p[i];
		if(group[i]==-1){
			group[i]=++ctr;
			set<int>cgp={i};
			for(int j=0;j<n;j++){
				if(j==i)continue;
				if(r[j]){
					if(group[j]!=-1)return 0;
					group[j]=ctr;
					cgp.insert(j);
				}
			}
			groups.push_back(cgp);
		}
		else{
			int g=group[i];
			for(int j=0;j<n;j++){
				if(group[j]==g&&r[j]==0)return 0;
				if(group[j]!=g&&r[j])return 0;
			}
		}
		if(small[i]==-1){
			small[i]=i;
			groupstosmalls[group[i]].push_back(i);
			set<int>cgp={i};
			for(int j=0;j<n;j++){
				if(j==i)continue;
				if(r[j]==1){
					if(small[j]!=-1)return 0;
					small[j]=i;
					cgp.insert(j);
				}
			}
			smalls.push_back(cgp);
		}
		else{
			int g=small[i];
			for(int j=0;j<n;j++){
				if(small[j]==g&&r[j]!=1)return 0;
				if(small[j]!=g&&r[j]==1)return 0;
			}
		}
	}
	ctr++;
/*	cout<<"Groups\n";
	for(auto x:groups){
		for(auto y:x){
			cout<<y<<" ";
		}
		cout<<"\n";
	}
	cout<<"Smalls\n";
	for(auto x:smalls){
		for(auto y:x){
			cout<<y<<" ";
		}
		cout<<"\n";
	}
	cout<<"g2s\n";
	for(auto x:groupstosmalls){
		cout<<x.first<<": ";
		for(auto y:x.second)cout<<y<<" ";
		cout<<"\n";
	}
	cout<<"small_val\n";
	for(int i=0;i<n;i++)cout<<small[i]<<" ";
	cout<<"\n";*/
	
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(group[i]!=group[j]&&p[i][j]!=0)return 0;
			if(group[i]==group[j]&&p[i][j]==0)return 0;
			if(small[i]==small[j]&&group[i]!=group[j])return 0;
			if(small[i]==small[j]&&p[i][j]!=1)return 0;
			if(small[i]!=small[j]&&group[i]==group[j]&&p[i][j]!=2)return 0;
		}
	}
	
	//Set up the empty answer
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		for(int j=0;j<n;j++)row.push_back(0);
		answer.push_back(row);
	}
	
	for(auto x:smalls){
		auto y=++x.begin(),yy=x.begin();
		while(y!=x.end()){
			answer[*y][*yy]=answer[*yy][*y]=1;
			y++,yy++;
		}
	}
	
	for(auto x:groupstosmalls){
      if(x.second.size()==2)return 0;
		for(int i=0;i<x.second.size()-1;i++){
			answer[x.second[i]][x.second[i+1]]=answer[x.second[i+1]][x.second[i]]=1;
		}
		if(x.second.size()-1)answer[x.second[0]][x.second[x.second.size()-1]]=answer[x.second[x.second.size()-1]][x.second[0]]=1;
	}
	
/*	auto y=++groups.begin(),yy=groups.begin();
	auto aa=yy->begin(),bb=groups.back().begin();
	answer[*aa][*bb]=answer[*bb][*aa]=1;
	while(y!=groups.end()){
		auto aa=yy->begin(),bb=y->begin();
		answer[*aa][*bb]=answer[*bb][*aa]=1;
		y++,yy++;
	}*/
	
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:132:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |   for(int i=0;i<x.second.size()-1;i++){
      |               ~^~~~~~~~~~~~~~~~~~
supertrees.cpp:31:37: warning: unused variable 'ctr2' [-Wunused-variable]
   31 |  int group[1005],small[1005],ctr=-1,ctr2=-1;;
      |                                     ^~~~

Subtask #1
11.0 / 11.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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 273 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 273 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 11 ms 1280 KB Output is correct
13 Correct 248 ms 22392 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 111 ms 8280 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 69 ms 5880 KB Output is correct
21 Correct 245 ms 22264 KB Output is correct
22 Correct 241 ms 22240 KB Output is correct
23 Correct 253 ms 22136 KB Output is correct
24 Correct 264 ms 22388 KB Output is correct
25 Correct 102 ms 8312 KB Output is correct
26 Correct 96 ms 8312 KB Output is correct
27 Correct 268 ms 22264 KB Output is correct
28 Correct 257 ms 22392 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 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 11 ms 1280 KB Output is correct
9 Correct 245 ms 22396 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 264 ms 22236 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 108 ms 8288 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 64 ms 5964 KB Output is correct
22 Correct 265 ms 22268 KB Output is correct
23 Correct 240 ms 22264 KB Output is correct
24 Correct 271 ms 22264 KB Output is correct
25 Correct 126 ms 12536 KB Output is correct
26 Correct 103 ms 8312 KB Output is correct
27 Correct 260 ms 22264 KB Output is correct
28 Correct 255 ms 22232 KB Output is correct
29 Correct 113 ms 12540 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 384 KB Output is correct
4 Correct 77 ms 5880 KB Output is correct
5 Correct 278 ms 22136 KB Output is correct
6 Correct 248 ms 22240 KB Output is correct
7 Correct 252 ms 22264 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 61 ms 5880 KB Output is correct
10 Correct 259 ms 22264 KB Output is correct
11 Correct 250 ms 22392 KB Output is correct
12 Correct 284 ms 22264 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 384 KB Output is correct
16 Correct 66 ms 5972 KB Output is correct
17 Correct 249 ms 22264 KB Output is correct
18 Correct 257 ms 22384 KB Output is correct
19 Correct 242 ms 22264 KB Output is correct
20 Correct 272 ms 22400 KB Output is correct

Subtask #5
21.0 / 21.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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 273 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 11 ms 1280 KB Output is correct
13 Correct 248 ms 22392 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 111 ms 8280 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 69 ms 5880 KB Output is correct
21 Correct 245 ms 22264 KB Output is correct
22 Correct 241 ms 22240 KB Output is correct
23 Correct 253 ms 22136 KB Output is correct
24 Correct 264 ms 22388 KB Output is correct
25 Correct 102 ms 8312 KB Output is correct
26 Correct 96 ms 8312 KB Output is correct
27 Correct 268 ms 22264 KB Output is correct
28 Correct 257 ms 22392 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 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 245 ms 22396 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 264 ms 22236 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 108 ms 8288 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 64 ms 5964 KB Output is correct
50 Correct 265 ms 22268 KB Output is correct
51 Correct 240 ms 22264 KB Output is correct
52 Correct 271 ms 22264 KB Output is correct
53 Correct 126 ms 12536 KB Output is correct
54 Correct 103 ms 8312 KB Output is correct
55 Correct 260 ms 22264 KB Output is correct
56 Correct 255 ms 22232 KB Output is correct
57 Correct 113 ms 12540 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 640 KB Output is correct
61 Correct 109 ms 8312 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 62 ms 5880 KB Output is correct
66 Correct 112 ms 8312 KB Output is correct
67 Correct 106 ms 8312 KB Output is correct
68 Correct 131 ms 8312 KB Output is correct
69 Correct 109 ms 12408 KB Output is correct

Subtask #6
4.0 / 4.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 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 273 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 11 ms 1280 KB Output is correct
13 Correct 248 ms 22392 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 111 ms 8280 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 69 ms 5880 KB Output is correct
21 Correct 245 ms 22264 KB Output is correct
22 Correct 241 ms 22240 KB Output is correct
23 Correct 253 ms 22136 KB Output is correct
24 Correct 264 ms 22388 KB Output is correct
25 Correct 102 ms 8312 KB Output is correct
26 Correct 96 ms 8312 KB Output is correct
27 Correct 268 ms 22264 KB Output is correct
28 Correct 257 ms 22392 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 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 245 ms 22396 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 264 ms 22236 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 108 ms 8288 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 64 ms 5964 KB Output is correct
50 Correct 265 ms 22268 KB Output is correct
51 Correct 240 ms 22264 KB Output is correct
52 Correct 271 ms 22264 KB Output is correct
53 Correct 126 ms 12536 KB Output is correct
54 Correct 103 ms 8312 KB Output is correct
55 Correct 260 ms 22264 KB Output is correct
56 Correct 255 ms 22232 KB Output is correct
57 Correct 113 ms 12540 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 384 KB Output is correct
61 Correct 77 ms 5880 KB Output is correct
62 Correct 278 ms 22136 KB Output is correct
63 Correct 248 ms 22240 KB Output is correct
64 Correct 252 ms 22264 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 61 ms 5880 KB Output is correct
67 Correct 259 ms 22264 KB Output is correct
68 Correct 250 ms 22392 KB Output is correct
69 Correct 284 ms 22264 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 384 KB Output is correct
73 Correct 66 ms 5972 KB Output is correct
74 Correct 249 ms 22264 KB Output is correct
75 Correct 257 ms 22384 KB Output is correct
76 Correct 242 ms 22264 KB Output is correct
77 Correct 272 ms 22400 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 640 KB Output is correct
81 Correct 109 ms 8312 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 62 ms 5880 KB Output is correct
86 Correct 112 ms 8312 KB Output is correct
87 Correct 106 ms 8312 KB Output is correct
88 Correct 131 ms 8312 KB Output is correct
89 Correct 109 ms 12408 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 104 ms 8184 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 32 ms 2296 KB Output is correct
98 Correct 98 ms 8284 KB Output is correct
99 Correct 95 ms 8184 KB Output is correct
100 Correct 104 ms 8184 KB Output is correct
101 Correct 99 ms 8156 KB Output is correct
102 Correct 107 ms 8152 KB Output is correct
103 Correct 104 ms 8184 KB Output is correct
104 Correct 119 ms 8156 KB Output is correct
105 Correct 125 ms 8156 KB Output is correct