Submission #733282

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
733282	2023-04-30T11:26:08 Z	ismayil	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	174 ms	23928 KB

supertrees

#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) 
{
	memset(par, -1, sizeof(par));
	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

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	174 ms	23928 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	174 ms	23928 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	7 ms	1208 KB	Output is correct
13	Correct	165 ms	23928 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

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

Subtask #4

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Incorrect	1 ms	212 KB	Too few ways to get from 0 to 1, should be 2 found 1
3	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	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	174 ms	23928 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	7 ms	1208 KB	Output is correct
13	Correct	165 ms	23928 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	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	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	174 ms	23928 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	7 ms	1208 KB	Output is correct
13	Correct	165 ms	23928 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-