oj.uz

답안 #827236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
827236 2023-08-16T10:03:27 Z tomruk 슈퍼트리 잇기 (IOI20_supertrees) C++17
96 / 100
 199 ms 28024 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n,(vector<int>(n,0)));
	vector<vector<int>> myp(n,vector<int>(n,0));
	vector<bool> used(n,0);
	vector<int> col(n,0);
	set<int> cur;
	function<void(int)> dfs = [&](int v)->void{
		used[v] = 1;
		cur.insert(v);
		for(int i = 0;i<n;i++){
			if(!used[i] && p[v][i] == 1){
				col[i] = col[v];
				dfs(i);
				answer[v][i] = 1;
				answer[i][v] = 1;
			}
		}
	};
	for(int i = 0;i<n;i++){
		if(used[i])continue;
		int now = i;
		vector<int> tmp;
		int num = -1;
		set<int> s;
		for(int j = 0;j<n;j++){
			if(p[now][j] >= 2){
				if(num == -1)
					num = p[now][j];
				if(num != p[now][j])
					return 0;
				s.insert(j);
			}
		}
		while(s.size()){
			tmp.push_back(now);
			vector<int> del;
			for(auto u:s){
				if(p[now][u] != num){
					del.push_back(u);
				}
			}
			for(auto u:del)
				s.erase(u);
			if(s.empty())
				break;
			now = *s.begin();
		}
		if(tmp.empty())
			continue;
		if(tmp.size() < 3){
			return 0;
		}
		for(int j = 0;j<tmp.size();j++){
			answer[tmp[j]][tmp[(j + 1)%tmp.size()]] = 1;
			answer[tmp[(j + 1)%tmp.size()]][tmp[j]] = 1;
		}
		if(num == 3){
			if(tmp.size() < 4)
				return 0;
			answer[tmp[0]][tmp[2]] = 1;
			answer[tmp[2]][tmp[0]] = 1;
		}
		cur.clear();
		for(auto u:tmp){
			col[u] = u;
			dfs(u);
		}
		for(auto u:cur){
			for(int j = 0;j<n;j++){
				if(p[u][j] == 0 && cur.count(j))
					return 0;
				if(p[u][j] == 1 && (!cur.count(j) || col[j] != col[u]))
					return 0;
				if(p[u][j] > 1 && (p[u][j] != num || !cur.count(j)))
					return 0;
				if(p[u][j] > 1 && col[u] == col[j])
					return 0;
			}
		}
		for(auto u:cur){
			for(auto c:cur){
				myp[u][c] = num;
				if(col[u] == col[c])
					myp[u][c] = 1;
			}
		}
	}
	for(int i = 0;i<n;i++){
		if(!used[i]){
			cur.clear();
			col[i] = i;
			dfs(i);
			for(auto u:cur){
				for(int j = 0;j<n;j++){
					if(p[u][j] == 0 && cur.count(j))
						return 0;
					if(p[u][j] == 1 && (!cur.count(j) || col[j] != col[u]))
						return 0;
					if(p[u][j] > 1)
						return 0;
				}
			}
			for(auto u:cur){
				for(auto c:cur){
					myp[u][c] = 1;
				}
			}
		}
	}
	if(myp != p)
		return 0;
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   for(int j = 0;j<tmp.size();j++){
      |                 ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1336 KB Output is correct
7 Correct 180 ms 28004 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1336 KB Output is correct
7 Correct 180 ms 28004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 149 ms 27868 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 68 ms 18032 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 7156 KB Output is correct
21 Correct 159 ms 27892 KB Output is correct
22 Correct 150 ms 27876 KB Output is correct
23 Correct 180 ms 27996 KB Output is correct
24 Correct 149 ms 27856 KB Output is correct
25 Correct 71 ms 17996 KB Output is correct
26 Correct 61 ms 18036 KB Output is correct
27 Correct 181 ms 27896 KB Output is correct
28 Correct 153 ms 27872 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 248 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1328 KB Output is correct
9 Correct 156 ms 27880 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1380 KB Output is correct
13 Correct 187 ms 27952 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 4 ms 980 KB Output is correct
17 Correct 81 ms 18032 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 0 ms 304 KB Output is correct
21 Correct 41 ms 7156 KB Output is correct
22 Correct 172 ms 27940 KB Output is correct
23 Correct 159 ms 27936 KB Output is correct
24 Correct 182 ms 27856 KB Output is correct
25 Correct 78 ms 18032 KB Output is correct
26 Correct 70 ms 18032 KB Output is correct
27 Correct 159 ms 27900 KB Output is correct
28 Correct 183 ms 27888 KB Output is correct
29 Correct 63 ms 18040 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 42 ms 7200 KB Output is correct
5 Correct 170 ms 27912 KB Output is correct
6 Correct 165 ms 27904 KB Output is correct
7 Correct 186 ms 27952 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 40 ms 7228 KB Output is correct
10 Correct 175 ms 28024 KB Output is correct
11 Correct 163 ms 27916 KB Output is correct
12 Correct 188 ms 27900 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 0 ms 296 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 42 ms 7224 KB Output is correct
17 Correct 178 ms 27896 KB Output is correct
18 Correct 168 ms 27900 KB Output is correct
19 Correct 167 ms 27884 KB Output is correct
20 Correct 154 ms 27836 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1336 KB Output is correct
7 Correct 180 ms 28004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 149 ms 27868 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 68 ms 18032 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 7156 KB Output is correct
21 Correct 159 ms 27892 KB Output is correct
22 Correct 150 ms 27876 KB Output is correct
23 Correct 180 ms 27996 KB Output is correct
24 Correct 149 ms 27856 KB Output is correct
25 Correct 71 ms 17996 KB Output is correct
26 Correct 61 ms 18036 KB Output is correct
27 Correct 181 ms 27896 KB Output is correct
28 Correct 153 ms 27872 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 248 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 296 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1328 KB Output is correct
37 Correct 156 ms 27880 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1380 KB Output is correct
41 Correct 187 ms 27952 KB Output is correct
42 Correct 0 ms 300 KB Output is correct
43 Correct 1 ms 300 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 81 ms 18032 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 0 ms 304 KB Output is correct
49 Correct 41 ms 7156 KB Output is correct
50 Correct 172 ms 27940 KB Output is correct
51 Correct 159 ms 27936 KB Output is correct
52 Correct 182 ms 27856 KB Output is correct
53 Correct 78 ms 18032 KB Output is correct
54 Correct 70 ms 18032 KB Output is correct
55 Correct 159 ms 27900 KB Output is correct
56 Correct 183 ms 27888 KB Output is correct
57 Correct 63 ms 18040 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 3 ms 1052 KB Output is correct
61 Correct 67 ms 18036 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 41 ms 7244 KB Output is correct
66 Correct 86 ms 18032 KB Output is correct
67 Correct 68 ms 18040 KB Output is correct
68 Correct 84 ms 18036 KB Output is correct
69 Correct 76 ms 18052 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1336 KB Output is correct
7 Correct 180 ms 28004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 1364 KB Output is correct
13 Correct 149 ms 27868 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 68 ms 18032 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 38 ms 7156 KB Output is correct
21 Correct 159 ms 27892 KB Output is correct
22 Correct 150 ms 27876 KB Output is correct
23 Correct 180 ms 27996 KB Output is correct
24 Correct 149 ms 27856 KB Output is correct
25 Correct 71 ms 17996 KB Output is correct
26 Correct 61 ms 18036 KB Output is correct
27 Correct 181 ms 27896 KB Output is correct
28 Correct 153 ms 27872 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 248 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 296 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1328 KB Output is correct
37 Correct 156 ms 27880 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1380 KB Output is correct
41 Correct 187 ms 27952 KB Output is correct
42 Correct 0 ms 300 KB Output is correct
43 Correct 1 ms 300 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 81 ms 18032 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 0 ms 304 KB Output is correct
49 Correct 41 ms 7156 KB Output is correct
50 Correct 172 ms 27940 KB Output is correct
51 Correct 159 ms 27936 KB Output is correct
52 Correct 182 ms 27856 KB Output is correct
53 Correct 78 ms 18032 KB Output is correct
54 Correct 70 ms 18032 KB Output is correct
55 Correct 159 ms 27900 KB Output is correct
56 Correct 183 ms 27888 KB Output is correct
57 Correct 63 ms 18040 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 296 KB Output is correct
61 Correct 42 ms 7200 KB Output is correct
62 Correct 170 ms 27912 KB Output is correct
63 Correct 165 ms 27904 KB Output is correct
64 Correct 186 ms 27952 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 40 ms 7228 KB Output is correct
67 Correct 175 ms 28024 KB Output is correct
68 Correct 163 ms 27916 KB Output is correct
69 Correct 188 ms 27900 KB Output is correct
70 Correct 1 ms 300 KB Output is correct
71 Correct 0 ms 296 KB Output is correct
72 Correct 0 ms 300 KB Output is correct
73 Correct 42 ms 7224 KB Output is correct
74 Correct 178 ms 27896 KB Output is correct
75 Correct 168 ms 27900 KB Output is correct
76 Correct 167 ms 27884 KB Output is correct
77 Correct 154 ms 27836 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 3 ms 1052 KB Output is correct
81 Correct 67 ms 18036 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 41 ms 7244 KB Output is correct
86 Correct 86 ms 18032 KB Output is correct
87 Correct 68 ms 18040 KB Output is correct
88 Correct 84 ms 18036 KB Output is correct
89 Correct 76 ms 18052 KB Output is correct
90 Correct 1 ms 308 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 4 ms 980 KB Output is correct
93 Correct 65 ms 18048 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 17 ms 4728 KB Output is correct
98 Correct 66 ms 18032 KB Output is correct
99 Correct 93 ms 18048 KB Output is correct
100 Correct 77 ms 17916 KB Output is correct
101 Correct 79 ms 17920 KB Output is correct
102 Incorrect 199 ms 27904 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -