Submission #777709

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
777709	2023-07-09T13:38:00 Z	Minindu206	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	157 ms	24004 KB

supertrees

#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
struct DSU
{
	/* data */
	int n;
	vector<int> par, sz;
	void init(int _n)
	{
		n = _n;
		par.resize(n + 1, -1);
		sz.resize(n + 1, 0);
	}
	int finds(int a)
	{
		if(par[a] == -1)
			return a;
		return par[a] = finds(par[a]);
	}
	void unites(int a, int b)
	{
		int x = finds(a);
		int y = finds(b);
		if(x != y)
		{
			if(sz[x] < sz[y])
				swap(x, y);
			par[y] = x;
			sz[x] += sz[y];
		}
	}
};
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	DSU d;
	d.init(n);
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if(i == j)
				continue;
			if(p[i][j] == 3)
				return 0;
			if(p[i][j])
			{
				d.unites(i, j);
			}
		}
	}
	map<int, vector<int>> mp;
	for(int i=0;i<n;i++)
	{
		mp[d.finds(i)].push_back(i);
	}
	vector<vector<int>> ans(n, vector<int>(n, 0));
	for(auto a:mp)
	{
		int st = -1;
		for(auto b:a.second)
		{
			if(st == -1)
				st = b;
			else
			{
				ans[st][b] = 1;
				ans[b][st] = 1;
				st = b;
			}
		}
	}
	build(ans);
	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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	10 ms	1108 KB	Output is correct
7	Correct	155 ms	22020 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	10 ms	1108 KB	Output is correct
7	Correct	155 ms	22020 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	157 ms	24004 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	256 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	0 ms	212 KB	Output is correct
2	Incorrect	0 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	10 ms	1108 KB	Output is correct
7	Correct	155 ms	22020 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	157 ms	24004 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	10 ms	1108 KB	Output is correct
7	Correct	155 ms	22020 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	157 ms	24004 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-