oj.uz

Submission #300641

# Submission time Handle Problem Language Result Execution time Memory
300641 2020-09-17T10:50:05 Z nandonathaniel Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 264 ms 24040 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;
			}
		}
		if(satu1.empty() && satu2.empty()){
			if(kel[i].size()==2)return 0;
			for(int j=0;j<kel[i].size()-1;j++){
				ans[kel[i][j]][kel[i][j+1]]=1;
				ans[kel[i][j+1]][kel[i][j]]=1;
			}
			continue;
		}
		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.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:66:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |    for(int j=0;j<kel[i].size()-1;j++){
      |                ~^~~~~~~~~~~~~~~~
supertrees.cpp:79:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for(int j=0;j<satu1.size()-1;j++){
      |                ~^~~~~~~~~~~~~~~
supertrees.cpp:91:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |    for(int j=0;j<satu2.size()-1;j++){
      |                ~^~~~~~~~~~~~~~~
supertrees.cpp:100:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |    for(int j=0;j<satu1.size()-1;j++){
      |                ~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 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 416 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 261 ms 22212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 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 416 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 261 ms 22212 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 249 ms 24036 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 128 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 72 ms 6388 KB Output is correct
21 Correct 256 ms 23652 KB Output is correct
22 Correct 252 ms 24036 KB Output is correct
23 Correct 264 ms 22444 KB Output is correct
24 Correct 248 ms 24036 KB Output is correct
25 Correct 119 ms 15716 KB Output is correct
26 Correct 114 ms 16228 KB Output is correct
27 Correct 263 ms 22192 KB Output is correct
28 Correct 246 ms 24040 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 1 ms 384 KB Output is correct
5 Incorrect 1 ms 384 KB Too few ways to get from 0 to 1, should be 2 found 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Incorrect 0 ms 384 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 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 416 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 261 ms 22212 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 249 ms 24036 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 128 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 72 ms 6388 KB Output is correct
21 Correct 256 ms 23652 KB Output is correct
22 Correct 252 ms 24036 KB Output is correct
23 Correct 264 ms 22444 KB Output is correct
24 Correct 248 ms 24036 KB Output is correct
25 Correct 119 ms 15716 KB Output is correct
26 Correct 114 ms 16228 KB Output is correct
27 Correct 263 ms 22192 KB Output is correct
28 Correct 246 ms 24040 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 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Incorrect 1 ms 384 KB Too few ways to get from 0 to 1, should be 2 found 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 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 416 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 261 ms 22212 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 249 ms 24036 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 128 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 72 ms 6388 KB Output is correct
21 Correct 256 ms 23652 KB Output is correct
22 Correct 252 ms 24036 KB Output is correct
23 Correct 264 ms 22444 KB Output is correct
24 Correct 248 ms 24036 KB Output is correct
25 Correct 119 ms 15716 KB Output is correct
26 Correct 114 ms 16228 KB Output is correct
27 Correct 263 ms 22192 KB Output is correct
28 Correct 246 ms 24040 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 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Incorrect 1 ms 384 KB Too few ways to get from 0 to 1, should be 2 found 1
34 Halted 0 ms 0 KB -