oj.uz

Submission #507449

# Submission time Handle Problem Language Result Execution time Memory
507449 2022-01-12T12:57:46 Z jamezzz Connecting Supertrees (IOI20_supertrees) C++17
56 / 100
 226 ms 24132 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

struct ufds{
	int par[1005],rnk[1005];
	void init(int n){
		for(int i=0;i<n;++i)par[i]=i,rnk[i]=0;
	}
	int fp(int i){return (par[i]==i)?i:par[i]=fp(par[i]);}
	void join(int x,int y){
		x=fp(x),y=fp(y);
		if(rnk[x]==rnk[y])par[x]=y;
		else par[y]=x;
		if(rnk[x]==rnk[y])++rnk[x];
	}
}u;

int construct(vector<vector<int>> p){
	int n=p.size();
	u.init(n);
	for(int i=0;i<n;++i){
		for(int j=0;j<n;++j){
			if(p[i][j]==3)return 0;
			if(p[i][j]!=0)u.join(i,j);
		}
	}
	vector<vector<int>> c1;
	c1.resize(n);
	for(int i=0;i<n;++i){
		c1[u.fp(i)].push_back(i);
		for(int j=0;j<n;++j){
			if(u.fp(i)==u.fp(j)&&p[i][j]==0){
				return 0;
			}
		}
	}

	u.init(n);
	for(int i=0;i<n;++i){
		for(int j=0;j<n;++j){
			if(p[i][j]==1)u.join(i,j);
		}
	}
	vector<vector<int>> c2,c3;
	c2.resize(n);
	c3.resize(n);
	for(int i=0;i<n;++i){
		c2[u.fp(i)].push_back(i);
		for(int j:c1[i]){
			if(u.fp(j)==j)c3[i].push_back(j);
		}
	}
	
	vector<vector<int>> answer;
	answer.resize(n);
	for(int i=0;i<n;i++)answer[i].resize(n);
	for(int i=0;i<n;++i){
		for(int j:c2[i]){
			if(i!=j)answer[i][j]=answer[j][i]=1;
		}
	}
	for(int i=0;i<n;++i){
		if(c3[i].size()>=2){
			int m=c3[i].size();
			for(int j=0;j<m;++j){
				int a=c3[i][j],b=c3[i][(j+1)%m];
				if(a!=b)answer[a][b]=answer[b][a]=1;
			}
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 9 ms 1200 KB Output is correct
7 Correct 181 ms 24068 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 9 ms 1200 KB Output is correct
7 Correct 181 ms 24068 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 173 ms 24072 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 4 ms 580 KB Output is correct
17 Correct 90 ms 10144 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 44 ms 6260 KB Output is correct
21 Correct 184 ms 24072 KB Output is correct
22 Correct 176 ms 24004 KB Output is correct
23 Correct 206 ms 24048 KB Output is correct
24 Correct 176 ms 24064 KB Output is correct
25 Correct 84 ms 10108 KB Output is correct
26 Correct 63 ms 10092 KB Output is correct
27 Correct 197 ms 24060 KB Output is correct
28 Correct 182 ms 24048 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 0 ms 300 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 52 ms 6188 KB Output is correct
5 Correct 176 ms 24048 KB Output is correct
6 Correct 226 ms 24132 KB Output is correct
7 Correct 202 ms 24004 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 44 ms 6256 KB Output is correct
10 Correct 176 ms 24116 KB Output is correct
11 Correct 181 ms 24020 KB Output is correct
12 Correct 197 ms 24056 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 44 ms 6200 KB Output is correct
17 Correct 193 ms 24032 KB Output is correct
18 Correct 210 ms 24036 KB Output is correct
19 Correct 177 ms 24004 KB Output is correct
20 Correct 175 ms 24132 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 9 ms 1200 KB Output is correct
7 Correct 181 ms 24068 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 173 ms 24072 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 4 ms 580 KB Output is correct
17 Correct 90 ms 10144 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 44 ms 6260 KB Output is correct
21 Correct 184 ms 24072 KB Output is correct
22 Correct 176 ms 24004 KB Output is correct
23 Correct 206 ms 24048 KB Output is correct
24 Correct 176 ms 24064 KB Output is correct
25 Correct 84 ms 10108 KB Output is correct
26 Correct 63 ms 10092 KB Output is correct
27 Correct 197 ms 24060 KB Output is correct
28 Correct 182 ms 24048 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 300 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 0 ms 300 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 9 ms 1200 KB Output is correct
7 Correct 181 ms 24068 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 284 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 173 ms 24072 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 4 ms 580 KB Output is correct
17 Correct 90 ms 10144 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 44 ms 6260 KB Output is correct
21 Correct 184 ms 24072 KB Output is correct
22 Correct 176 ms 24004 KB Output is correct
23 Correct 206 ms 24048 KB Output is correct
24 Correct 176 ms 24064 KB Output is correct
25 Correct 84 ms 10108 KB Output is correct
26 Correct 63 ms 10092 KB Output is correct
27 Correct 197 ms 24060 KB Output is correct
28 Correct 182 ms 24048 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 300 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 0 ms 300 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -