oj.uz

답안 #1049864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049864 2024-08-09T05:49:52 Z aykhn 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 145 ms 24400 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;
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (dsu.get(i) == dsu.get(j) && p[i][j] == 0) return 0;
		}
	}
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1180 KB Output is correct
7 Correct 98 ms 22128 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1180 KB Output is correct
7 Correct 98 ms 22128 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1300 KB Output is correct
13 Correct 99 ms 22280 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 52 ms 14000 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 24 ms 6408 KB Output is correct
21 Correct 97 ms 24148 KB Output is correct
22 Correct 97 ms 24076 KB Output is correct
23 Correct 107 ms 24148 KB Output is correct
24 Correct 96 ms 24188 KB Output is correct
25 Correct 50 ms 14164 KB Output is correct
26 Correct 43 ms 14084 KB Output is correct
27 Correct 103 ms 24108 KB Output is correct
28 Correct 103 ms 24400 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 4 ms 1368 KB Output is correct
9 Correct 95 ms 23436 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1184 KB Output is correct
13 Correct 104 ms 23844 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 26 ms 6220 KB Output is correct
5 Correct 101 ms 23892 KB Output is correct
6 Correct 123 ms 23968 KB Output is correct
7 Correct 103 ms 24044 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 25 ms 6220 KB Output is correct
10 Correct 109 ms 23928 KB Output is correct
11 Correct 97 ms 23852 KB Output is correct
12 Correct 116 ms 24144 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 432 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 47 ms 6396 KB Output is correct
17 Correct 145 ms 24072 KB Output is correct
18 Correct 99 ms 24144 KB Output is correct
19 Correct 97 ms 24148 KB Output is correct
20 Correct 98 ms 24144 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1180 KB Output is correct
7 Correct 98 ms 22128 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1300 KB Output is correct
13 Correct 99 ms 22280 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 52 ms 14000 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 24 ms 6408 KB Output is correct
21 Correct 97 ms 24148 KB Output is correct
22 Correct 97 ms 24076 KB Output is correct
23 Correct 107 ms 24148 KB Output is correct
24 Correct 96 ms 24188 KB Output is correct
25 Correct 50 ms 14164 KB Output is correct
26 Correct 43 ms 14084 KB Output is correct
27 Correct 103 ms 24108 KB Output is correct
28 Correct 103 ms 24400 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 4 ms 1368 KB Output is correct
37 Correct 95 ms 23436 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 8 ms 1184 KB Output is correct
41 Correct 104 ms 23844 KB Output is correct
42 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1180 KB Output is correct
7 Correct 98 ms 22128 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 5 ms 1300 KB Output is correct
13 Correct 99 ms 22280 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 856 KB Output is correct
17 Correct 52 ms 14000 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 24 ms 6408 KB Output is correct
21 Correct 97 ms 24148 KB Output is correct
22 Correct 97 ms 24076 KB Output is correct
23 Correct 107 ms 24148 KB Output is correct
24 Correct 96 ms 24188 KB Output is correct
25 Correct 50 ms 14164 KB Output is correct
26 Correct 43 ms 14084 KB Output is correct
27 Correct 103 ms 24108 KB Output is correct
28 Correct 103 ms 24400 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 4 ms 1368 KB Output is correct
37 Correct 95 ms 23436 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 8 ms 1184 KB Output is correct
41 Correct 104 ms 23844 KB Output is correct
42 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -