oj.uz

Submission #733281

# Submission time Handle Problem Language Result Execution time Memory
733281 2023-04-30T11:23:35 Z ismayil Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1000 ms 2097152 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e3 + 3;
int par[MAX];
int find(int u){
	if(par[u] < 0) return u;
	return par[u] = find(par[u]);
}
bool unite(int u, int v){
	u = find(u), v = find(v);
	if(u == v) return false;
	if(par[u] > par[v]) swap(u, v);
	par[u] += par[v];
	par[v] = u;
	return true;
}
int construct(vector<vector<int>> p) 
{
	int n = p.size();
	vector<vector<int>> answer(n, vector<int>(n, 0));
	for (int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(!p[i][j]) continue;
			if(unite(i, j)){
				answer[i][j] = answer[j][i] = 1;
			}
		}
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1157 ms 1660128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1157 ms 1660128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1137 ms 1925248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1121 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1157 ms 1660128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1157 ms 1660128 KB Time limit exceeded
2 Halted 0 ms 0 KB -