oj.uz

답안 #952778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952778 2024-03-24T19:12:05 Z emad234 슈퍼트리 잇기 (IOI20_supertrees) C++17
56 / 100
 460 ms 73036 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));
					v[find(j)].insert(find(i));
				}
				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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 150 ms 26196 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 150 ms 26196 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1444 KB Output is correct
13 Correct 160 ms 26228 KB Output is correct
14 Correct 0 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 73 ms 16148 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 47 ms 6948 KB Output is correct
21 Correct 158 ms 26148 KB Output is correct
22 Correct 152 ms 26192 KB Output is correct
23 Correct 164 ms 26096 KB Output is correct
24 Correct 168 ms 26128 KB Output is correct
25 Correct 66 ms 16208 KB Output is correct
26 Correct 60 ms 16156 KB Output is correct
27 Correct 183 ms 26192 KB Output is correct
28 Correct 150 ms 26128 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 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 348 KB Output is correct
8 Correct 7 ms 1444 KB Output is correct
9 Correct 147 ms 26128 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 14 ms 3316 KB Output is correct
13 Correct 460 ms 73036 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 1880 KB Output is correct
17 Correct 237 ms 39760 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 40 ms 7212 KB Output is correct
22 Correct 193 ms 30640 KB Output is correct
23 Correct 153 ms 26372 KB Output is correct
24 Correct 291 ms 49660 KB Output is correct
25 Correct 70 ms 16412 KB Output is correct
26 Incorrect 179 ms 30756 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 39 ms 6816 KB Output is correct
5 Correct 158 ms 26192 KB Output is correct
6 Correct 153 ms 26008 KB Output is correct
7 Correct 164 ms 26192 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 39 ms 7248 KB Output is correct
10 Correct 183 ms 30804 KB Output is correct
11 Correct 156 ms 26196 KB Output is correct
12 Correct 300 ms 49492 KB Output is correct
13 Correct 1 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 39 ms 6996 KB Output is correct
17 Correct 178 ms 30804 KB Output is correct
18 Correct 170 ms 27988 KB Output is correct
19 Correct 157 ms 26968 KB Output is correct
20 Correct 151 ms 26196 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 150 ms 26196 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1444 KB Output is correct
13 Correct 160 ms 26228 KB Output is correct
14 Correct 0 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 73 ms 16148 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 47 ms 6948 KB Output is correct
21 Correct 158 ms 26148 KB Output is correct
22 Correct 152 ms 26192 KB Output is correct
23 Correct 164 ms 26096 KB Output is correct
24 Correct 168 ms 26128 KB Output is correct
25 Correct 66 ms 16208 KB Output is correct
26 Correct 60 ms 16156 KB Output is correct
27 Correct 183 ms 26192 KB Output is correct
28 Correct 150 ms 26128 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 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 1444 KB Output is correct
37 Correct 147 ms 26128 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 14 ms 3316 KB Output is correct
41 Correct 460 ms 73036 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 1880 KB Output is correct
45 Correct 237 ms 39760 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 40 ms 7212 KB Output is correct
50 Correct 193 ms 30640 KB Output is correct
51 Correct 153 ms 26372 KB Output is correct
52 Correct 291 ms 49660 KB Output is correct
53 Correct 70 ms 16412 KB Output is correct
54 Incorrect 179 ms 30756 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 150 ms 26196 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1444 KB Output is correct
13 Correct 160 ms 26228 KB Output is correct
14 Correct 0 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 73 ms 16148 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 47 ms 6948 KB Output is correct
21 Correct 158 ms 26148 KB Output is correct
22 Correct 152 ms 26192 KB Output is correct
23 Correct 164 ms 26096 KB Output is correct
24 Correct 168 ms 26128 KB Output is correct
25 Correct 66 ms 16208 KB Output is correct
26 Correct 60 ms 16156 KB Output is correct
27 Correct 183 ms 26192 KB Output is correct
28 Correct 150 ms 26128 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 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 1444 KB Output is correct
37 Correct 147 ms 26128 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 14 ms 3316 KB Output is correct
41 Correct 460 ms 73036 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 1880 KB Output is correct
45 Correct 237 ms 39760 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 40 ms 7212 KB Output is correct
50 Correct 193 ms 30640 KB Output is correct
51 Correct 153 ms 26372 KB Output is correct
52 Correct 291 ms 49660 KB Output is correct
53 Correct 70 ms 16412 KB Output is correct
54 Incorrect 179 ms 30756 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -