oj.uz

답안 #1005208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005208 2024-06-22T08:52:56 Z thinknoexit 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 124 ms 22296 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1010;
int p[N], p2[N];
int fr(int i) {
	return p[i] == i ? i : p[i] = fr(p[i]);
}
int fr2(int i) {
	return p2[i] == i ? i : p2[i] = fr2(p2[i]);
}
int construct(vector<vector<int>> B) {
	int n = B.size();
	vector<vector<int>> ans(n, vector<int>(n, 0));
	// Calculate for p[i][j] = 1
	iota(p, p + n, 0);
	for (int i = 0;i < n;i++) {
		for (int j = i + 1;j < n;j++) {
			if (B[i][j] == 1) {
				p[fr(i)] = fr(j);
			}
		}
	}
	vector<vector<int>> g(n);
	for (int i = 0;i < n;i++) {
		g[fr(i)].push_back(i);
	}
	vector<int> node;
	for (int G = 0;G < n;G++) {
		if (g[G].empty()) continue;
		node.push_back(G);
		auto& v = g[G];
		int m = v.size();
		int cnt = 0;
		for (int i = 0;i < m;i++) {
			for (int j = i + 1;j < m;j++) {
				if (B[v[i]][v[j]] != 1) return 0;
			}
		}
		for (int i = 1;i < m;i++) {
			ans[v[0]][v[i]] = ans[v[i]][v[0]] = 1;
		}
	}
	iota(p2, p2 + n, 0);
	int k = node.size();
	for (int i = 0;i < k;i++) {
		for (int j = i + 1;j < k;j++) {
			if (B[node[i]][node[j]] == 2) {
				p2[fr2(node[i])] = fr2(node[j]);
			}
		}
	}
	vector<vector<int>> g2(n);
	for (int i = 0;i < k;i++) {
		g2[fr2(node[i])].push_back(node[i]);
	}
	for (int G = 0;G < n;G++) {
		if (g2[G].empty() || (int)g2[G].size() == 1) continue;
		if ((int)g2[G].size() == 2) return 0;
		auto& v = g2[G];
		int m = v.size();
		int cnt = 0;
		for (int i = 0;i < m;i++) {
			for (int j = i + 1;j < m;j++) {
				if (B[v[i]][v[j]] != 2) return 0;
			}
		}
		for (int i = 0;i < m;i++) {
			ans[v[(i + 1) % m]][v[i]] = ans[v[i]][v[(i + 1) % m]] = 1;
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:35:7: warning: unused variable 'cnt' [-Wunused-variable]
   35 |   int cnt = 0;
      |       ^~~
supertrees.cpp:63:7: warning: unused variable 'cnt' [-Wunused-variable]
   63 |   int cnt = 0;
      |       ^~~

Subtask #1
11.0 / 11.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 5 ms 1116 KB Output is correct
7 Correct 112 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.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 5 ms 1116 KB Output is correct
7 Correct 112 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 109 ms 22296 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 856 KB Output is correct
17 Correct 57 ms 12116 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5796 KB Output is correct
21 Correct 110 ms 22048 KB Output is correct
22 Correct 108 ms 22096 KB Output is correct
23 Correct 116 ms 22096 KB Output is correct
24 Correct 110 ms 22296 KB Output is correct
25 Correct 52 ms 12112 KB Output is correct
26 Correct 48 ms 12116 KB Output is correct
27 Correct 115 ms 22044 KB Output is correct
28 Correct 109 ms 22188 KB Output is correct

Subtask #3
19.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 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 5 ms 1116 KB Output is correct
9 Correct 113 ms 22140 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 107 ms 22048 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 65 ms 12300 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 28 ms 5924 KB Output is correct
22 Correct 101 ms 22096 KB Output is correct
23 Correct 109 ms 22096 KB Output is correct
24 Correct 116 ms 22096 KB Output is correct
25 Correct 52 ms 12368 KB Output is correct
26 Correct 49 ms 12112 KB Output is correct
27 Correct 115 ms 22280 KB Output is correct
28 Correct 124 ms 22040 KB Output is correct
29 Correct 51 ms 12312 KB Output is correct

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 0 ms 348 KB Output is correct
4 Correct 33 ms 5924 KB Output is correct
5 Correct 114 ms 22164 KB Output is correct
6 Correct 109 ms 22100 KB Output is correct
7 Correct 124 ms 22096 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 27 ms 5816 KB Output is correct
10 Correct 112 ms 22284 KB Output is correct
11 Correct 118 ms 22100 KB Output is correct
12 Correct 119 ms 22096 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 28 ms 5800 KB Output is correct
17 Correct 111 ms 22084 KB Output is correct
18 Correct 105 ms 22100 KB Output is correct
19 Correct 112 ms 22096 KB Output is correct
20 Correct 101 ms 22284 KB Output is correct

Subtask #5
21.0 / 21.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 5 ms 1116 KB Output is correct
7 Correct 112 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 109 ms 22296 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 856 KB Output is correct
17 Correct 57 ms 12116 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5796 KB Output is correct
21 Correct 110 ms 22048 KB Output is correct
22 Correct 108 ms 22096 KB Output is correct
23 Correct 116 ms 22096 KB Output is correct
24 Correct 110 ms 22296 KB Output is correct
25 Correct 52 ms 12112 KB Output is correct
26 Correct 48 ms 12116 KB Output is correct
27 Correct 115 ms 22044 KB Output is correct
28 Correct 109 ms 22188 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 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 5 ms 1116 KB Output is correct
37 Correct 113 ms 22140 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1116 KB Output is correct
41 Correct 107 ms 22048 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 65 ms 12300 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 28 ms 5924 KB Output is correct
50 Correct 101 ms 22096 KB Output is correct
51 Correct 109 ms 22096 KB Output is correct
52 Correct 116 ms 22096 KB Output is correct
53 Correct 52 ms 12368 KB Output is correct
54 Correct 49 ms 12112 KB Output is correct
55 Correct 115 ms 22280 KB Output is correct
56 Correct 124 ms 22040 KB Output is correct
57 Correct 51 ms 12312 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 860 KB Output is correct
61 Correct 64 ms 12300 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 26 ms 5940 KB Output is correct
66 Correct 49 ms 14164 KB Output is correct
67 Correct 46 ms 14164 KB Output is correct
68 Correct 46 ms 14228 KB Output is correct
69 Correct 43 ms 14160 KB Output is correct

Subtask #6
0 / 4.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 5 ms 1116 KB Output is correct
7 Correct 112 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 109 ms 22296 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 856 KB Output is correct
17 Correct 57 ms 12116 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 5796 KB Output is correct
21 Correct 110 ms 22048 KB Output is correct
22 Correct 108 ms 22096 KB Output is correct
23 Correct 116 ms 22096 KB Output is correct
24 Correct 110 ms 22296 KB Output is correct
25 Correct 52 ms 12112 KB Output is correct
26 Correct 48 ms 12116 KB Output is correct
27 Correct 115 ms 22044 KB Output is correct
28 Correct 109 ms 22188 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 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 5 ms 1116 KB Output is correct
37 Correct 113 ms 22140 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1116 KB Output is correct
41 Correct 107 ms 22048 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 65 ms 12300 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 28 ms 5924 KB Output is correct
50 Correct 101 ms 22096 KB Output is correct
51 Correct 109 ms 22096 KB Output is correct
52 Correct 116 ms 22096 KB Output is correct
53 Correct 52 ms 12368 KB Output is correct
54 Correct 49 ms 12112 KB Output is correct
55 Correct 115 ms 22280 KB Output is correct
56 Correct 124 ms 22040 KB Output is correct
57 Correct 51 ms 12312 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 33 ms 5924 KB Output is correct
62 Correct 114 ms 22164 KB Output is correct
63 Correct 109 ms 22100 KB Output is correct
64 Correct 124 ms 22096 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 27 ms 5816 KB Output is correct
67 Correct 112 ms 22284 KB Output is correct
68 Correct 118 ms 22100 KB Output is correct
69 Correct 119 ms 22096 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 28 ms 5800 KB Output is correct
74 Correct 111 ms 22084 KB Output is correct
75 Correct 105 ms 22100 KB Output is correct
76 Correct 112 ms 22096 KB Output is correct
77 Correct 101 ms 22284 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 2 ms 860 KB Output is correct
81 Correct 64 ms 12300 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 26 ms 5940 KB Output is correct
86 Correct 49 ms 14164 KB Output is correct
87 Correct 46 ms 14164 KB Output is correct
88 Correct 46 ms 14228 KB Output is correct
89 Correct 43 ms 14160 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 53 ms 14164 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
96 Halted 0 ms 0 KB -