답안 #1039734

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1039734	2024-07-31T08:14:24 Z	amirhoseinfar1385	슈퍼트리 잇기 (IOI20_supertrees)	C++17	56 / 100	139 ms	23472 KB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000+10;
int n,vis[maxn];
vector<vector<int>>res;

struct dsu{
	int par[maxn];
	vector<int>adj[maxn];
	dsu(){
		for(int i=0;i<maxn;i++){
			par[i]=i;
		}
	}
	int root(int u){
		if(u==par[u]){
			return u;
		}
		return par[u]=root(par[u]);
	}
	void con(int u,int v){
		u=root(u),v=root(v);
		if(u!=v){
			par[u]=v;
			adj[v].push_back(u);
		}
	}
	vector<int>ret;
	void dfs(int u,int par=-1){
		ret.push_back(u);
		for(auto x:adj[u]){
			if(x==par){
				continue;
			}
			dfs(x,u);
		}
	}
	vector<int>allc(int u){
		ret.clear();
		u=root(u);
		dfs(u);
		return ret;
	}
}ds1,ds2;

void adde(int u,int v){
	res[u][v]=res[v][u]=1;
}

void addp(vector<int>a){
	for(int i=1;i<(int)a.size();i++){
		adde(a[i-1],a[i]);
	}
}

int construct(std::vector<std::vector<int>> p) {
	n = p.size();
	res.resize(n,vector<int>(n));
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j){
				continue;
			}
			if(p[i][j]==1){
				ds1.con(i,j);
			}
		}
	}
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			vector<int>hey=ds1.allc(i);
			for(auto x:hey){
				vis[x]=1;
			}
			addp(hey);
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j){
				continue;
			}
			if(p[i][j]==2){
				ds2.con(ds1.root(i),ds1.root(j));
			}
		}
		vis[i]=0;
	}
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			vector<int>hey=ds2.allc(i);
			for(auto x:hey){
				vis[x]=1;
			}
			addp(hey);
			if((int)hey.size()>1){
				adde(hey[0],hey.back());
			}
		}
	}
	int retrr=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(i==j){
				continue;
			}
			//if(p[i][j]==0){
		//		cout<<"wtf: "<<i<<" "<<j<<" "<<ds2.root(i)<<" "<<ds2.root(j)<<endl;
		//	}
			if(p[i][j]==1&&ds1.root(i)!=ds1.root(j)){
				retrr=-1;
			}
			if(p[i][j]==0&&(ds1.root(i)==ds1.root(j)||ds2.root(ds1.root(i))==ds2.root(ds1.root(j)))){
		//		cout<<"salam"<<endl;
				retrr=-1;
			}
			if(p[i][j]==2&&(ds2.root(ds1.root(i))!=ds2.root(ds1.root(j))||ds1.root(i)==ds1.root(j))){
				retrr=-1;
			}
		}
	}
	if(retrr==-1){
		return 0;
	}
	build(res);
	return retrr;
}

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	344 KB	Output is correct
6	Correct	5 ms	1432 KB	Output is correct
7	Correct	116 ms	23124 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	344 KB	Output is correct
6	Correct	5 ms	1432 KB	Output is correct
7	Correct	116 ms	23124 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	6 ms	1372 KB	Output is correct
13	Correct	123 ms	23116 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	992 KB	Output is correct
17	Correct	120 ms	13648 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	30 ms	6236 KB	Output is correct
21	Correct	121 ms	23380 KB	Output is correct
22	Correct	122 ms	23396 KB	Output is correct
23	Correct	129 ms	23380 KB	Output is correct
24	Correct	118 ms	23380 KB	Output is correct
25	Correct	60 ms	13588 KB	Output is correct
26	Correct	60 ms	13648 KB	Output is correct
27	Correct	128 ms	23380 KB	Output is correct
28	Correct	118 ms	23408 KB	Output is correct

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Incorrect	0 ms	348 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

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	0 ms	348 KB	Output is correct
4	Correct	31 ms	6308 KB	Output is correct
5	Correct	127 ms	23124 KB	Output is correct
6	Correct	124 ms	23464 KB	Output is correct
7	Correct	129 ms	23120 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	32 ms	6244 KB	Output is correct
10	Correct	119 ms	23248 KB	Output is correct
11	Correct	121 ms	23120 KB	Output is correct
12	Correct	139 ms	23280 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	31 ms	6236 KB	Output is correct
17	Correct	121 ms	23396 KB	Output is correct
18	Correct	128 ms	23380 KB	Output is correct
19	Correct	126 ms	23368 KB	Output is correct
20	Correct	122 ms	23472 KB	Output is correct

Subtask #5

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	344 KB	Output is correct
6	Correct	5 ms	1432 KB	Output is correct
7	Correct	116 ms	23124 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	6 ms	1372 KB	Output is correct
13	Correct	123 ms	23116 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	992 KB	Output is correct
17	Correct	120 ms	13648 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	30 ms	6236 KB	Output is correct
21	Correct	121 ms	23380 KB	Output is correct
22	Correct	122 ms	23396 KB	Output is correct
23	Correct	129 ms	23380 KB	Output is correct
24	Correct	118 ms	23380 KB	Output is correct
25	Correct	60 ms	13588 KB	Output is correct
26	Correct	60 ms	13648 KB	Output is correct
27	Correct	128 ms	23380 KB	Output is correct
28	Correct	118 ms	23408 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	0 ms	348 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6

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	344 KB	Output is correct
6	Correct	5 ms	1432 KB	Output is correct
7	Correct	116 ms	23124 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	604 KB	Output is correct
12	Correct	6 ms	1372 KB	Output is correct
13	Correct	123 ms	23116 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	992 KB	Output is correct
17	Correct	120 ms	13648 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	30 ms	6236 KB	Output is correct
21	Correct	121 ms	23380 KB	Output is correct
22	Correct	122 ms	23396 KB	Output is correct
23	Correct	129 ms	23380 KB	Output is correct
24	Correct	118 ms	23380 KB	Output is correct
25	Correct	60 ms	13588 KB	Output is correct
26	Correct	60 ms	13648 KB	Output is correct
27	Correct	128 ms	23380 KB	Output is correct
28	Correct	118 ms	23408 KB	Output is correct
29	Correct	0 ms	344 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	0 ms	348 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-