oj.uz

답안 #434593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434593 2021-06-21T12:36:00 Z pere_gil 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 284 ms 22084 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;
 
int p[1005];
 
void init(int n){
	for(int i=0;i<n;i++) p[i]=i;
}
 
int find_set(int n){
	return (p[n]==n) ? n : p[n]=find_set(p[n]);
}
 
bool same_set(int a, int b){
	return find_set(a)==find_set(b);
}
 
void union_set(int a, int b){
	if(!same_set(a,b)) p[find_set(a)]=find_set(b);
}
 
void form_group(vector<int> &g, vector<vector<int> > &v, bool is_2){
	if(g.size()==1) return;
	if(!is_2){
		for(int i=1;i<g.size();i++)
			v[g[i]][g[i-1]]=v[g[i-1]][g[i]]=1;
		return;
	}
 
	for(int i=0;i<g.size();i++){
		int j=(i+1)%g.size();
		v[g[i]][g[j]]=v[g[j]][g[i]]=1;
	}
}
 
int construct(vector<vector<int> > v){
	int n=v.size();
	init(n);
	
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(v[i][j]) union_set(i,j);
 
	vector<vector<int> > g(n);
	for(int i=0;i<n;i++)
		g[find_set(i)].push_back(i);
 
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(same_set(i,j) && v[i][j]==0) return 0;
 
	bool is_2=false;
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		    if(v[i][j]==2) is_2=true;
	
	for(int i=0;i<n;i++)
		if(g[i].size()==2 && is_2) return 0;
	
	vector<vector<int> > ans(n,vector<int> (n,0));
	for(int i=0;i<n;i++)
		form_group(g[i],ans,is_2);
	build(ans);
	
	return 1;
}

Compilation message

supertrees.cpp: In function 'void form_group(std::vector<int>&, std::vector<std::vector<int> >&, bool)':
supertrees.cpp:26:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for(int i=1;i<g.size();i++)
      |               ~^~~~~~~~~
supertrees.cpp:31:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 232 ms 22016 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 232 ms 22016 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1100 KB Output is correct
13 Correct 224 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 124 ms 8176 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 60 ms 5772 KB Output is correct
21 Correct 230 ms 22020 KB Output is correct
22 Correct 256 ms 22012 KB Output is correct
23 Correct 245 ms 22064 KB Output is correct
24 Correct 284 ms 22020 KB Output is correct
25 Correct 100 ms 8176 KB Output is correct
26 Correct 91 ms 8200 KB Output is correct
27 Correct 262 ms 22032 KB Output is correct
28 Correct 237 ms 22040 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 12 ms 1100 KB Output is correct
9 Correct 239 ms 22012 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 258 ms 22036 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 584 KB Output is correct
17 Correct 108 ms 8192 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 58 ms 5700 KB Output is correct
22 Correct 234 ms 22024 KB Output is correct
23 Correct 228 ms 21988 KB Output is correct
24 Correct 244 ms 22024 KB Output is correct
25 Correct 95 ms 8132 KB Output is correct
26 Correct 92 ms 8188 KB Output is correct
27 Correct 228 ms 22012 KB Output is correct
28 Correct 241 ms 22072 KB Output is correct
29 Correct 91 ms 8132 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 72 ms 5760 KB Output is correct
5 Correct 233 ms 22032 KB Output is correct
6 Correct 271 ms 22020 KB Output is correct
7 Correct 238 ms 22032 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 58 ms 5684 KB Output is correct
10 Correct 230 ms 22080 KB Output is correct
11 Correct 236 ms 21956 KB Output is correct
12 Correct 283 ms 22024 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Incorrect 0 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 232 ms 22016 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1100 KB Output is correct
13 Correct 224 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 124 ms 8176 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 60 ms 5772 KB Output is correct
21 Correct 230 ms 22020 KB Output is correct
22 Correct 256 ms 22012 KB Output is correct
23 Correct 245 ms 22064 KB Output is correct
24 Correct 284 ms 22020 KB Output is correct
25 Correct 100 ms 8176 KB Output is correct
26 Correct 91 ms 8200 KB Output is correct
27 Correct 262 ms 22032 KB Output is correct
28 Correct 237 ms 22040 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 12 ms 1100 KB Output is correct
37 Correct 239 ms 22012 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 258 ms 22036 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 584 KB Output is correct
45 Correct 108 ms 8192 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 58 ms 5700 KB Output is correct
50 Correct 234 ms 22024 KB Output is correct
51 Correct 228 ms 21988 KB Output is correct
52 Correct 244 ms 22024 KB Output is correct
53 Correct 95 ms 8132 KB Output is correct
54 Correct 92 ms 8188 KB Output is correct
55 Correct 228 ms 22012 KB Output is correct
56 Correct 241 ms 22072 KB Output is correct
57 Correct 91 ms 8132 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 5 ms 588 KB Output is correct
61 Correct 102 ms 8160 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Incorrect 0 ms 204 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 1100 KB Output is correct
7 Correct 232 ms 22016 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1100 KB Output is correct
13 Correct 224 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 124 ms 8176 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 60 ms 5772 KB Output is correct
21 Correct 230 ms 22020 KB Output is correct
22 Correct 256 ms 22012 KB Output is correct
23 Correct 245 ms 22064 KB Output is correct
24 Correct 284 ms 22020 KB Output is correct
25 Correct 100 ms 8176 KB Output is correct
26 Correct 91 ms 8200 KB Output is correct
27 Correct 262 ms 22032 KB Output is correct
28 Correct 237 ms 22040 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 12 ms 1100 KB Output is correct
37 Correct 239 ms 22012 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 258 ms 22036 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 584 KB Output is correct
45 Correct 108 ms 8192 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 58 ms 5700 KB Output is correct
50 Correct 234 ms 22024 KB Output is correct
51 Correct 228 ms 21988 KB Output is correct
52 Correct 244 ms 22024 KB Output is correct
53 Correct 95 ms 8132 KB Output is correct
54 Correct 92 ms 8188 KB Output is correct
55 Correct 228 ms 22012 KB Output is correct
56 Correct 241 ms 22072 KB Output is correct
57 Correct 91 ms 8132 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 72 ms 5760 KB Output is correct
62 Correct 233 ms 22032 KB Output is correct
63 Correct 271 ms 22020 KB Output is correct
64 Correct 238 ms 22032 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 58 ms 5684 KB Output is correct
67 Correct 230 ms 22080 KB Output is correct
68 Correct 236 ms 21956 KB Output is correct
69 Correct 283 ms 22024 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Incorrect 0 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -