oj.uz

Submission #1063280

# Submission time Handle Problem Language Result Execution time Memory
1063280 2024-08-17T16:16:42 Z jamjanek Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 0 ms 348 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int father1[1010], father[1010], father3[1010];
int find1(int x){
	if(father1[x]==x)return x;
	return father1[x] = find1(father1[x]);
}
int find2(int x){
	if(father[x]==x)return x;
	return father[x] = find2(father[x]);
}
vector<int>cykle[1010];

int construct(std::vector<std::vector<int>> p) {
	int n = p.size(), i, j;
	for(i=0;i<n;i++)father[i] = father1[i] = i;
	std::vector<std::vector<int>> answer = p;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			answer[i][j] = 0;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++){
			if(p[i][j]==3 || (i==j && p[i][j]!=1) || (p[i][j]!=p[j][i]))
				return 0;
			if(p[i][j]>0)
				father1[find1(i)] = find1(j);
			else
				if(find1(i)==find2(j))return 0;
			if(p[i][j]==1 && find2(i)!=find2(j)){
				father[find2(i)] = find2(j);
				answer[i][j] = answer[j][i] = 1;
			}
		}
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			if(p[i][j]==2 && find2(i)==find2(j))
				return 0;
	for(i=0;i<n;i++)
		father3[i] = find2(i);
	for(i=0;i<n;i++)
		if(find2(i)==i)
			for(j=0;j<i;j++)
				if(p[i][j]==2){
					cykle[find2(j)].push_back(find2(i));
					break;
				}
	for(int j=0;j<n;j++){
		if(cykle[j].size()==1)return 0;
		cykle[j].push_back(j);
		for(i=0;i<(int)cykle[j].size();i++){
			int mod = cykle[j].size();
			answer[cykle[j][i]][cykle[j][(i+1)%mod]] = 1;
			answer[cykle[j][(i+1)%mod]][cykle[j][i]] = 1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -