oj.uz

Submission #777718

# Submission time Handle Problem Language Result Execution time Memory
777718 2023-07-09T13:48:02 Z Minindu206 Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 170 ms 24076 KB 
#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;
		if(a.second.size() == 1)
			continue;
		for(auto b:a.second)
		{
			if(st == -1)
				st = b;
			else
			{
				ans[st][b] = 1;
				ans[b][st] = 1;
				st = b;
			}
		}
		int x1 = a.second[0], x2 = a.second[1];
		if(p[x1][x2] == 2)
		{
			if(a.second.size() == 2)
				return 0;
			ans[x1][st] = 1;
			ans[st][x1] = 1; 
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 6 ms 1108 KB Output is correct
7 Correct 156 ms 22012 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 6 ms 1108 KB Output is correct
7 Correct 156 ms 22012 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 156 ms 22148 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 596 KB Output is correct
17 Correct 68 ms 8068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 5760 KB Output is correct
21 Correct 159 ms 21968 KB Output is correct
22 Correct 156 ms 22096 KB Output is correct
23 Correct 158 ms 21964 KB Output is correct
24 Correct 153 ms 22164 KB Output is correct
25 Correct 58 ms 8080 KB Output is correct
26 Correct 61 ms 8068 KB Output is correct
27 Correct 162 ms 22024 KB Output is correct
28 Correct 158 ms 22156 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1260 KB Output is correct
9 Correct 152 ms 24076 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 153 ms 23996 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 69 ms 10060 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 39 ms 6220 KB Output is correct
22 Correct 160 ms 23940 KB Output is correct
23 Correct 153 ms 23928 KB Output is correct
24 Correct 157 ms 23920 KB Output is correct
25 Correct 61 ms 14080 KB Output is correct
26 Correct 60 ms 10060 KB Output is correct
27 Correct 155 ms 23928 KB Output is correct
28 Correct 170 ms 23940 KB Output is correct
29 Correct 62 ms 14084 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 39 ms 6260 KB Output is correct
5 Correct 166 ms 24004 KB Output is correct
6 Correct 153 ms 24012 KB Output is correct
7 Correct 166 ms 24012 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 38 ms 6228 KB Output is correct
10 Correct 167 ms 23968 KB Output is correct
11 Correct 156 ms 24060 KB Output is correct
12 Correct 158 ms 23936 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 212 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 6 ms 1108 KB Output is correct
7 Correct 156 ms 22012 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 156 ms 22148 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 596 KB Output is correct
17 Correct 68 ms 8068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 5760 KB Output is correct
21 Correct 159 ms 21968 KB Output is correct
22 Correct 156 ms 22096 KB Output is correct
23 Correct 158 ms 21964 KB Output is correct
24 Correct 153 ms 22164 KB Output is correct
25 Correct 58 ms 8080 KB Output is correct
26 Correct 61 ms 8068 KB Output is correct
27 Correct 162 ms 22024 KB Output is correct
28 Correct 158 ms 22156 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1260 KB Output is correct
37 Correct 152 ms 24076 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1236 KB Output is correct
41 Correct 153 ms 23996 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 69 ms 10060 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 39 ms 6220 KB Output is correct
50 Correct 160 ms 23940 KB Output is correct
51 Correct 153 ms 23928 KB Output is correct
52 Correct 157 ms 23920 KB Output is correct
53 Correct 61 ms 14080 KB Output is correct
54 Correct 60 ms 10060 KB Output is correct
55 Correct 155 ms 23928 KB Output is correct
56 Correct 170 ms 23940 KB Output is correct
57 Correct 62 ms 14084 KB Output is correct
58 Correct 1 ms 300 KB Output is correct
59 Correct 1 ms 300 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 72 ms 10140 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 224 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Incorrect 38 ms 6220 KB Too many ways to get from 1 to 269, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 6 ms 1108 KB Output is correct
7 Correct 156 ms 22012 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 156 ms 22148 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 596 KB Output is correct
17 Correct 68 ms 8068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 39 ms 5760 KB Output is correct
21 Correct 159 ms 21968 KB Output is correct
22 Correct 156 ms 22096 KB Output is correct
23 Correct 158 ms 21964 KB Output is correct
24 Correct 153 ms 22164 KB Output is correct
25 Correct 58 ms 8080 KB Output is correct
26 Correct 61 ms 8068 KB Output is correct
27 Correct 162 ms 22024 KB Output is correct
28 Correct 158 ms 22156 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1260 KB Output is correct
37 Correct 152 ms 24076 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1236 KB Output is correct
41 Correct 153 ms 23996 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 69 ms 10060 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 39 ms 6220 KB Output is correct
50 Correct 160 ms 23940 KB Output is correct
51 Correct 153 ms 23928 KB Output is correct
52 Correct 157 ms 23920 KB Output is correct
53 Correct 61 ms 14080 KB Output is correct
54 Correct 60 ms 10060 KB Output is correct
55 Correct 155 ms 23928 KB Output is correct
56 Correct 170 ms 23940 KB Output is correct
57 Correct 62 ms 14084 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 300 KB Output is correct
61 Correct 39 ms 6260 KB Output is correct
62 Correct 166 ms 24004 KB Output is correct
63 Correct 153 ms 24012 KB Output is correct
64 Correct 166 ms 24012 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 38 ms 6228 KB Output is correct
67 Correct 167 ms 23968 KB Output is correct
68 Correct 156 ms 24060 KB Output is correct
69 Correct 158 ms 23936 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Incorrect 1 ms 212 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -