oj.uz

Submission #982936

# Submission time Handle Problem Language Result Execution time Memory
982936 2024-05-15T04:37:05 Z tamir1 Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 181 ms 22228 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001],vis[1001];
int find(int a){
	if(a==par[a]) return a;
	int x=find(par[a]);
	par[a]=x;
	return x;
}
vector<int> v[1001],x,y;
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	for(int i=0;i<n;i++){
		sz[i]=1;
		par[i]=i;
		for(int j=0;j<n;j++){
			if(p[i][j]==3) return 0;
		}
	}
	if(n==1){
		build({{0}});
		return 1;
	}
	std::vector<std::vector<int>> answer(n,vector<int> (n,0));
	for (int i = 0; i < n; i++) {
		for(int j=0;j<n;j++){
			int x=find(i);
			int y=find(j);
			if(p[i][j]==0 && x==y) return 0;
			if(p[i][j]==2){
				if(x==y) continue;
				if(sz[x]<sz[y]) swap(x,y);
				else if(sz[x]==sz[y] && x>y) swap(x,y);
				sz[x]+=sz[y];
				par[y]=x;
			}
		}
	}
	for(int i=0;i<n;i++){
		par[i]=find(i);
		v[par[i]].push_back(i);
	}
	
	for(int i=0;i<n;i++){
		int k=v[i].size();
		if(k==0 || k==1) continue;
		x.clear();
		y.clear();
		memset(vis,0,sizeof vis);
		for(int j=0;j<k;j++){
			bool a=0;
			for(int l=0;l<k;l++){
				if(l==j) continue;
				int e=p[v[i][j]][v[i][l]];
				if(e==1){
					a=1;
					break;
				}
			}
			if(!a){
				if(vis[v[i][j]]==1) return 0;
				vis[v[i][j]]=2;
				continue;
			}
			if(vis[v[i][j]]==2) return 0;
			vis[v[i][j]]=1;
			for(int l=0;l<k;l++){
				if(l==j) continue;
				int e=p[v[i][j]][v[i][l]];
				if(e==1){
					if(vis[v[i][l]]==2) return 0;
					vis[v[i][j]]=1;
				}
				else{
					if(vis[v[i][l]]==1) return 0;
					vis[v[i][j]]=2;
				}
			}
		}
		for(int j=0;j<k;j++){
			if(vis[v[i][j]]==1) x.push_back(v[i][j]);
			else y.push_back(v[i][j]);
		}
		int p=x.size();
		int q=y.size();
		if(q==1 || (q==2 && p<1)) return 0;
		for(int j=0;j<p-1;j++){
			answer[x[j]][x[j+1]]=1;
			answer[x[j+1]][x[j]]=1;
		}
		for(int j=0;j<q-1;j++){
			answer[y[j]][y[j+1]]=1;
			answer[y[j+1]][y[j]]=1;
		}
		if(q!=0){
		if(p==0){
			answer[y[0]][y[q-1]]=1;
			answer[y[q-1]][y[0]]=1;
		}
		else{
			answer[y[0]][x[0]]=1;
			answer[x[0]][y[0]]=1;
			answer[y[q-1]][x[0]]=1;
			answer[x[0]][y[q-1]]=1;
		}}
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1368 KB Output is correct
9 Correct 151 ms 22096 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 154 ms 22060 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 66 ms 12068 KB Output is correct
18 Correct 0 ms 544 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 41 ms 5968 KB Output is correct
22 Correct 181 ms 22100 KB Output is correct
23 Correct 155 ms 22096 KB Output is correct
24 Correct 157 ms 22100 KB Output is correct
25 Correct 63 ms 12336 KB Output is correct
26 Correct 73 ms 12068 KB Output is correct
27 Correct 152 ms 22048 KB Output is correct
28 Correct 160 ms 22228 KB Output is correct
29 Correct 63 ms 12116 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 4.0

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