oj.uz

답안 #952796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952796 2024-03-24T20:12:23 Z emad234 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 546 ms 73032 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 1e6 + 5;
using namespace std;

int dsu[mxN];
int find(int x) { return dsu[x] == x ? x : dsu[x] = find(dsu[x]); }
void merge(int a, int b) { dsu[find(b)] = find(a); }
int construct(std::vector<std::vector<int>> p)
{
	vector<vector<int>> b;
	int n = p.size(), m = p.size();
	b.resize(n);
	for (int i = 0; i < n; i++)
		dsu[i] = i;
	for (int i = 0; i < n; i++)
		b[i].resize(m);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (i == j)
				continue;
			if (p[i][j] == 1)
			{
				if (find(i) != find(j))
				{
					merge(i, j);
					b[i][j] = 1;
					b[j][i] = 1;
				}
			}
		}
	}
	vector<vector<int>> ty;
	vector<set<int>> v, v1;
	v.resize(n);
	v1.resize(n);
	ty.resize(n);
	for (int i = 0; i < n; i++)
	{
		ty[i].resize(n);
		for (int j = 0; j < m; j++)
		{
			ty[i][j] = -1;
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (i == j)
				continue;
			if (find(i) == find(j))
			{
				if (p[i][j] != 1)
					return 0;
			}
			else
			{
				if (ty[find(i)][find(j)] != -1 && p[i][j] != ty[find(i)][find(j)])
					return 0;
				if (p[i][j] == 2)
				{
					v[find(i)].insert(find(j));
					v[find(j)].insert(find(i));
				}
				if (p[i][j] == 3)
				{
					v1[find(i)].insert(find(j));
					v1[find(j)].insert(find(i));
				}
				ty[find(i)][find(j)] = p[i][j];
			}
		}
	}
	vector<bool> vis(n);
	for (int i = 0; i < n; i++)
	{
		vector<bool> fnd(n);
		int prv = -1;
		if (vis[i])
			continue;
		if (v[i].size() == 1)
			return 0;
		v[i].insert(i);
		for (auto x : v[i])
		{
			fnd[x] = 1;
			for (auto y : v[x])
			{
				fnd[y] = 1;
			}
		}
		for (auto x : v[i])
		{
			for (int j = 0; j < n; j++)
			{
				if (x == j)
					continue;
				if (fnd[j] && p[x][j] != 2)
					return 0;
			}
			vis[x] = 1;
			if (prv != -1)
			{
				b[x][prv] = 1;
				b[prv][x] = 1;
			}
			prv = x;
		}
		if (v[i].size() > 2)
		{
			b[*v[i].begin()][*v[i].rbegin()] = 1;
			b[*v[i].rbegin()][*v[i].begin()] = 1;
		}
	}
	for (int i = 0; i < n; i++)
		vis[i] = 0;
	for (int i = 0; i < n; i++)
	{
		if(v[i].size() && v1[i].size()) return 0;
		vector<bool> fnd(n);
		int prv = -1;
		if (vis[i])
			continue;
		if (v1[i].size() == 2 || v1[i].size() == 1)
			return 0;
		v1[i].insert(i);
		for (auto x : v1[i])
		{
			fnd[x] = 1;
			for (auto y : v1[x])
			{
				fnd[y] = 1;
			}
		}
		int bg = *v1[i].begin();
		auto ed1 = v1[i].begin();
		ed1++;
		ed1++;
		int ed = *ed1;
		for (auto x : v1[i])
		{
			for (int j = 0; j < n; j++)
			{
				if (x == j)
					continue;
				if ((fnd[j] && p[x][j] != 3) || (!fnd[j] && p[x][j] == 3))
					return 0;
			}
			vis[x] = 1;
			if (prv != -1)
			{
				b[x][prv] = 1;
				b[prv][x] = 1;
			}
			prv = x;
		}
		if (v1[i].size() > 3)
		{
			b[*v1[i].begin()][*v1[i].rbegin()] = 1;
			b[*v1[i].rbegin()][*v1[i].begin()] = 1;
			b[bg][ed] = 1;
			b[ed][bg] = 1;
		}
	}
	build(b);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 26196 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 26196 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1624 KB Output is correct
13 Correct 156 ms 26244 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 85 ms 16168 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6884 KB Output is correct
21 Correct 164 ms 26132 KB Output is correct
22 Correct 168 ms 26352 KB Output is correct
23 Correct 170 ms 26192 KB Output is correct
24 Correct 159 ms 26184 KB Output is correct
25 Correct 63 ms 16208 KB Output is correct
26 Correct 64 ms 16208 KB Output is correct
27 Correct 168 ms 26192 KB Output is correct
28 Correct 156 ms 26312 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 163 ms 26148 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 12 ms 3164 KB Output is correct
13 Correct 483 ms 73032 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 258 ms 39760 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 43 ms 7264 KB Output is correct
22 Correct 203 ms 31072 KB Output is correct
23 Correct 158 ms 26452 KB Output is correct
24 Correct 309 ms 49712 KB Output is correct
25 Correct 68 ms 16164 KB Output is correct
26 Correct 83 ms 20820 KB Output is correct
27 Correct 182 ms 26452 KB Output is correct
28 Correct 289 ms 49684 KB Output is correct
29 Correct 69 ms 16408 KB Output is correct

Subtask #4
35.0 / 35.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 41 ms 6936 KB Output is correct
5 Correct 162 ms 26196 KB Output is correct
6 Correct 168 ms 26492 KB Output is correct
7 Correct 174 ms 26148 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 41 ms 7312 KB Output is correct
10 Correct 177 ms 30748 KB Output is correct
11 Correct 168 ms 26388 KB Output is correct
12 Correct 302 ms 49504 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 40 ms 7080 KB Output is correct
17 Correct 193 ms 30892 KB Output is correct
18 Correct 180 ms 28236 KB Output is correct
19 Correct 174 ms 27140 KB Output is correct
20 Correct 154 ms 26192 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 26196 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1624 KB Output is correct
13 Correct 156 ms 26244 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 85 ms 16168 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6884 KB Output is correct
21 Correct 164 ms 26132 KB Output is correct
22 Correct 168 ms 26352 KB Output is correct
23 Correct 170 ms 26192 KB Output is correct
24 Correct 159 ms 26184 KB Output is correct
25 Correct 63 ms 16208 KB Output is correct
26 Correct 64 ms 16208 KB Output is correct
27 Correct 168 ms 26192 KB Output is correct
28 Correct 156 ms 26312 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 163 ms 26148 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 12 ms 3164 KB Output is correct
41 Correct 483 ms 73032 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 6 ms 1884 KB Output is correct
45 Correct 258 ms 39760 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 43 ms 7264 KB Output is correct
50 Correct 203 ms 31072 KB Output is correct
51 Correct 158 ms 26452 KB Output is correct
52 Correct 309 ms 49712 KB Output is correct
53 Correct 68 ms 16164 KB Output is correct
54 Correct 83 ms 20820 KB Output is correct
55 Correct 182 ms 26452 KB Output is correct
56 Correct 289 ms 49684 KB Output is correct
57 Correct 69 ms 16408 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 1112 KB Output is correct
61 Correct 71 ms 16160 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 40 ms 6996 KB Output is correct
66 Correct 63 ms 16148 KB Output is correct
67 Correct 64 ms 16160 KB Output is correct
68 Correct 63 ms 16160 KB Output is correct
69 Correct 68 ms 16176 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 26196 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 8 ms 1624 KB Output is correct
13 Correct 156 ms 26244 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 85 ms 16168 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 6884 KB Output is correct
21 Correct 164 ms 26132 KB Output is correct
22 Correct 168 ms 26352 KB Output is correct
23 Correct 170 ms 26192 KB Output is correct
24 Correct 159 ms 26184 KB Output is correct
25 Correct 63 ms 16208 KB Output is correct
26 Correct 64 ms 16208 KB Output is correct
27 Correct 168 ms 26192 KB Output is correct
28 Correct 156 ms 26312 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 163 ms 26148 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 12 ms 3164 KB Output is correct
41 Correct 483 ms 73032 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 6 ms 1884 KB Output is correct
45 Correct 258 ms 39760 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 43 ms 7264 KB Output is correct
50 Correct 203 ms 31072 KB Output is correct
51 Correct 158 ms 26452 KB Output is correct
52 Correct 309 ms 49712 KB Output is correct
53 Correct 68 ms 16164 KB Output is correct
54 Correct 83 ms 20820 KB Output is correct
55 Correct 182 ms 26452 KB Output is correct
56 Correct 289 ms 49684 KB Output is correct
57 Correct 69 ms 16408 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 41 ms 6936 KB Output is correct
62 Correct 162 ms 26196 KB Output is correct
63 Correct 168 ms 26492 KB Output is correct
64 Correct 174 ms 26148 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 41 ms 7312 KB Output is correct
67 Correct 177 ms 30748 KB Output is correct
68 Correct 168 ms 26388 KB Output is correct
69 Correct 302 ms 49504 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 40 ms 7080 KB Output is correct
74 Correct 193 ms 30892 KB Output is correct
75 Correct 180 ms 28236 KB Output is correct
76 Correct 174 ms 27140 KB Output is correct
77 Correct 154 ms 26192 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 3 ms 1112 KB Output is correct
81 Correct 71 ms 16160 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 40 ms 6996 KB Output is correct
86 Correct 63 ms 16148 KB Output is correct
87 Correct 64 ms 16160 KB Output is correct
88 Correct 63 ms 16160 KB Output is correct
89 Correct 68 ms 16176 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 1116 KB Output is correct
93 Correct 69 ms 16148 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 18 ms 4440 KB Output is correct
98 Correct 87 ms 20756 KB Output is correct
99 Correct 67 ms 16660 KB Output is correct
100 Correct 72 ms 16208 KB Output is correct
101 Correct 68 ms 16400 KB Output is correct
102 Correct 354 ms 63248 KB Output is correct
103 Correct 546 ms 65364 KB Output is correct
104 Correct 86 ms 18256 KB Output is correct
105 Correct 249 ms 41792 KB Output is correct