oj.uz

답안 #952773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952773 2024-03-24T19:05:38 Z emad234 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 280 ms 73040 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;
	v.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[i][find(j)] != -1 && p[i][j] != ty[i][find(j)])
					return 0;
				if (p[i][j] == 2)
					v[find(i)].insert(find(j));
				ty[i][find(j)] = p[i][j];
			}
		}
	}
	vector<bool> vis(n);
	for (int i = 0; i < n; i++)
	{
		int prv = -1;
		if (vis[i])
			continue;
		if (v[i].size() == 1)
			return 0;
		v[i].insert(i);
		for(auto x : v[i]){
			for(int j = 0;j < n;j++){
				if(x == j) continue;
				if(v[i].find(j) != v[i].end() && p[x][j] != 2) return 0;
			}
		}
		for (auto x : v[i])
		{
			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;
		}
	}
	build(b);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 157 ms 26196 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 157 ms 26196 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 7 ms 1460 KB Output is correct
13 Correct 154 ms 26196 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 16164 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 7200 KB Output is correct
21 Correct 162 ms 26192 KB Output is correct
22 Correct 159 ms 26132 KB Output is correct
23 Correct 164 ms 26196 KB Output is correct
24 Correct 156 ms 26196 KB Output is correct
25 Correct 64 ms 16104 KB Output is correct
26 Correct 61 ms 16212 KB Output is correct
27 Correct 164 ms 26196 KB Output is correct
28 Correct 156 ms 26032 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 159 ms 26444 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 10 ms 3160 KB Output is correct
13 Correct 280 ms 73040 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 5 ms 1884 KB Output is correct
17 Correct 126 ms 39504 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 41 ms 7116 KB Output is correct
22 Correct 174 ms 30756 KB Output is correct
23 Correct 156 ms 26196 KB Output is correct
24 Correct 234 ms 49664 KB Output is correct
25 Correct 66 ms 16164 KB Output is correct
26 Incorrect 176 ms 30736 KB Answer gives possible 1 while actual possible 0
27 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 40 ms 6816 KB Output is correct
5 Correct 175 ms 26144 KB Output is correct
6 Correct 168 ms 26144 KB Output is correct
7 Correct 165 ms 26192 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 41 ms 7240 KB Output is correct
10 Correct 173 ms 30800 KB Output is correct
11 Correct 154 ms 26192 KB Output is correct
12 Correct 229 ms 50004 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 42 ms 7064 KB Output is correct
17 Correct 173 ms 30804 KB Output is correct
18 Correct 170 ms 27988 KB Output is correct
19 Correct 163 ms 26964 KB Output is correct
20 Correct 158 ms 26136 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 157 ms 26196 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 7 ms 1460 KB Output is correct
13 Correct 154 ms 26196 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 16164 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 7200 KB Output is correct
21 Correct 162 ms 26192 KB Output is correct
22 Correct 159 ms 26132 KB Output is correct
23 Correct 164 ms 26196 KB Output is correct
24 Correct 156 ms 26196 KB Output is correct
25 Correct 64 ms 16104 KB Output is correct
26 Correct 61 ms 16212 KB Output is correct
27 Correct 164 ms 26196 KB Output is correct
28 Correct 156 ms 26032 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 159 ms 26444 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 10 ms 3160 KB Output is correct
41 Correct 280 ms 73040 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 5 ms 1884 KB Output is correct
45 Correct 126 ms 39504 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 7116 KB Output is correct
50 Correct 174 ms 30756 KB Output is correct
51 Correct 156 ms 26196 KB Output is correct
52 Correct 234 ms 49664 KB Output is correct
53 Correct 66 ms 16164 KB Output is correct
54 Incorrect 176 ms 30736 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 157 ms 26196 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 7 ms 1460 KB Output is correct
13 Correct 154 ms 26196 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 16164 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 7200 KB Output is correct
21 Correct 162 ms 26192 KB Output is correct
22 Correct 159 ms 26132 KB Output is correct
23 Correct 164 ms 26196 KB Output is correct
24 Correct 156 ms 26196 KB Output is correct
25 Correct 64 ms 16104 KB Output is correct
26 Correct 61 ms 16212 KB Output is correct
27 Correct 164 ms 26196 KB Output is correct
28 Correct 156 ms 26032 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 159 ms 26444 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 10 ms 3160 KB Output is correct
41 Correct 280 ms 73040 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 5 ms 1884 KB Output is correct
45 Correct 126 ms 39504 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 41 ms 7116 KB Output is correct
50 Correct 174 ms 30756 KB Output is correct
51 Correct 156 ms 26196 KB Output is correct
52 Correct 234 ms 49664 KB Output is correct
53 Correct 66 ms 16164 KB Output is correct
54 Incorrect 176 ms 30736 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -