oj.uz

Submission #777027

# Submission time Handle Problem Language Result Execution time Memory
777027 2023-07-08T14:08:56 Z YassirSalama Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 1 ms 212 KB 
#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1100;
int par[MAXN];
void make_set(){
	for(int i=0;i<MAXN;i++) par[i]=i;
}
int find(int node){
	if(node==par[node]) return node;
	return par[node]=find(par[node]);
}
void merge(int a,int b){
	par[find(a)]=b;
}
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n,vector<int>(n,0));
	make_set();
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(find(i)==find(j)) answer[i][j]=0;
			else{
				merge(i,j);
				answer[i][j]=1;
			}
		}

	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -