Submission #777717

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
777717	2023-07-09T13:44:54 Z	Minindu206	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	175 ms	24108 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);
		for(int j=0;j<n;j++)
		{
			if(i == j)
				continue;
			if(p[i][j] == 0)
				if(d.finds(i) == d.finds(j))
					return 0;
		}		
	}
	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	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	175 ms	23176 KB	Output is correct

Subtask #2

10.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	300 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	175 ms	23176 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	1236 KB	Output is correct
13	Correct	158 ms	24052 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	696 KB	Output is correct
17	Correct	70 ms	10112 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	38 ms	6264 KB	Output is correct
21	Correct	164 ms	23924 KB	Output is correct
22	Correct	164 ms	24052 KB	Output is correct
23	Correct	154 ms	23936 KB	Output is correct
24	Correct	149 ms	24108 KB	Output is correct
25	Correct	69 ms	10060 KB	Output is correct
26	Correct	59 ms	10108 KB	Output is correct
27	Correct	154 ms	23988 KB	Output is correct
28	Correct	151 ms	24060 KB	Output is correct

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	1 ms	212 KB	Output is correct
4	Incorrect	1 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	300 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	175 ms	23176 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	1236 KB	Output is correct
13	Correct	158 ms	24052 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	696 KB	Output is correct
17	Correct	70 ms	10112 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	38 ms	6264 KB	Output is correct
21	Correct	164 ms	23924 KB	Output is correct
22	Correct	164 ms	24052 KB	Output is correct
23	Correct	154 ms	23936 KB	Output is correct
24	Correct	149 ms	24108 KB	Output is correct
25	Correct	69 ms	10060 KB	Output is correct
26	Correct	59 ms	10108 KB	Output is correct
27	Correct	154 ms	23988 KB	Output is correct
28	Correct	151 ms	24060 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
33	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	300 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	7 ms	1236 KB	Output is correct
7	Correct	175 ms	23176 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	1236 KB	Output is correct
13	Correct	158 ms	24052 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	3 ms	696 KB	Output is correct
17	Correct	70 ms	10112 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	38 ms	6264 KB	Output is correct
21	Correct	164 ms	23924 KB	Output is correct
22	Correct	164 ms	24052 KB	Output is correct
23	Correct	154 ms	23936 KB	Output is correct
24	Correct	149 ms	24108 KB	Output is correct
25	Correct	69 ms	10060 KB	Output is correct
26	Correct	59 ms	10108 KB	Output is correct
27	Correct	154 ms	23988 KB	Output is correct
28	Correct	151 ms	24060 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-