oj.uz

Submission #1049844

# Submission time Handle Problem Language Result Execution time Memory
1049844 2024-08-09T05:44:34 Z aykhn Connecting Supertrees (IOI20_supertrees) C++17
46 / 100
 109 ms 24280 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

struct DSU
{
	vector<int> e;
	void init(int n)
	{
		e.assign(n, -1);
	}
	int get(int x)
	{
		if (e[x] < 0) return x;
		return e[x] = get(e[x]);
	}
	int unite(int x, int y)
	{
		x = get(x), y = get(y);
		if (x == y) return 0;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y];
		e[y] = x;
		return 1;
	}
};

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n, vector<int> (n, 0));
	DSU dsu;
	dsu.init(n);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (p[i][j] == 3) return 0;
			if (p[i][j] == 1 && dsu.unite(i, j)) ans[i][j] = ans[j][i] = 1;
		}
	}
	vector<int> comp[n];
	for (int i = 0; i < n; i++) comp[dsu.get(i)].push_back(i);
	DSU d1;
	d1.init(n);
	for (int i = 0; i < n; i++)
	{
		if (i != dsu.get(i)) continue;
		for (int &j : comp[i])
		{
			for (int k = 0; k < n; k++)
			{
				if ((p[j][k] == 2) != (p[i][k] == 2)) return 0;
			}
		}
		for (int j = 0; j < n; j++)
		{
			if (p[i][j] == 2) d1.unite(i, dsu.get(j));
		}
	}
	vector<int> con[n];
	for (int i = 0; i < n; i++) con[d1.get(i)].push_back(i);
	for (int i = 0; i < n; i++)
	{
		if (con[i].size() <= 1) continue;
		if (con[i].size() == 2) return 0;
		int prev = con[i].back();
		for (int &j : con[i]) 
		{
			ans[prev][j] = ans[j][prev] = 1;
			prev = j;
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 100 ms 24152 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 100 ms 24152 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1368 KB Output is correct
13 Correct 97 ms 24076 KB Output is correct
14 Incorrect 1 ms 344 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 97 ms 24240 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 103 ms 24068 KB Output is correct
14 Incorrect 0 ms 592 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 37 ms 6308 KB Output is correct
5 Correct 105 ms 24052 KB Output is correct
6 Correct 97 ms 24068 KB Output is correct
7 Correct 100 ms 24188 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 25 ms 6220 KB Output is correct
10 Correct 97 ms 24148 KB Output is correct
11 Correct 97 ms 24072 KB Output is correct
12 Correct 109 ms 24280 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 24 ms 6272 KB Output is correct
17 Correct 102 ms 24148 KB Output is correct
18 Correct 94 ms 24204 KB Output is correct
19 Correct 93 ms 24076 KB Output is correct
20 Correct 103 ms 24148 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 100 ms 24152 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1368 KB Output is correct
13 Correct 97 ms 24076 KB Output is correct
14 Incorrect 1 ms 344 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1372 KB Output is correct
7 Correct 100 ms 24152 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 1368 KB Output is correct
13 Correct 97 ms 24076 KB Output is correct
14 Incorrect 1 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -