oj.uz

답안 #927619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927619 2024-02-15T07:26:57 Z MrDeboo 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 194 ms 31380 KB 
#include "bits/stdc++.h"
#include "supertrees.h"
using namespace std;
vector<int>vct[1000][2];
vector<vector<int>>ans;
vector<vector<int>>P;
int slv(vector<int>v){
	for(auto &i:v){
		for(auto &w:v){
			if(!P[i][w])return 0;
		}
	}
	vector<int>V;
	vector<bool>vis(P.size());
	for(int i=0;i<v.size();i++){
		if(vis[i])continue;
		int I=i;
		for(int w=0;w<v.size();w++){
			if(P[v[i]][v[w]]==1&&!vis[w]&&i!=w){
				bool bl=1;
				for(int j=0;j<v.size();j++){
					if(j==i||j==w)continue;
					if(P[v[j]][v[i]]!=P[v[j]][v[w]])bl=0;
				}
				if(bl){
					vis[w]=1;
					ans[v[I]][v[w]]=1;
					ans[v[w]][v[I]]=1;
					I=w;
				}
			}
		}
		V.push_back(i);
		vis[i]=1;
	}
	v=V;
	for(int i=0;i<v.size();i++){
		for(int w=i+1;w<v.size();w++){
			if(P[v[i]][v[w]]!=2)return 0;
		}
	}
	if(v.size()>1){
		if(v.size()==2)return 0;
		for(int i=0;i<v.size();i++){
			ans[v[i]][v[(i+1)%v.size()]]=1;
			ans[v[(i+1)%v.size()]][v[i]]=1;
		}
	}
	return 1;
}
int construct(std::vector<std::vector<int>> p){
	for(auto &i:p){
		for(auto &w:i){
			if(w>2)return 0;
		}
	}
	for(auto &i:p)P.push_back(i);
	int n=p.size();
	for(int i=0;i<n;i++){
		for(int w=0;w<n;w++){
			if(i==w)continue;
			if(p[i][w])vct[i][p[i][w]-1].push_back(w);
		}
	}
	for(int i=0;i<n;i++){
		vector<int>v(n);
		ans.push_back(v);
	}
	vector<bool>vis(n);
	for(int i=0;i<n;i++){
		for(int w=0;w<n;w++){
			if(vis[i]||vis[w]||i==w)continue;
			if(p[i][w]){
				deque<int>dq={i};
				vis[i]=1;
				vector<int>vc;
				while(dq.size()){
					int a=dq.front();
					vc.push_back(a);
					dq.pop_front();
					for(auto &j:vct[a][1]){
						if(!vis[j]){
							vis[j]=1;
							dq.push_back(j);
						}
					}
					for(auto &j:vct[a][0]){
						if(!vis[j]){
							vis[j]=1;
							dq.push_back(j);
						}
					}
				}
				if(!slv(vc))return 0;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int slv(std::vector<int>)':
supertrees.cpp:15:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(int i=0;i<v.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp:18:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   for(int w=0;w<v.size();w++){
      |               ~^~~~~~~~~
supertrees.cpp:21:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int j=0;j<v.size();j++){
      |                 ~^~~~~~~~~
supertrees.cpp:37:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i=0;i<v.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |   for(int w=i+1;w<v.size();w++){
      |                 ~^~~~~~~~~
supertrees.cpp:44:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for(int i=0;i<v.size();i++){
      |               ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1720 KB Output is correct
7 Correct 162 ms 30008 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1720 KB Output is correct
7 Correct 162 ms 30008 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1516 KB Output is correct
13 Correct 152 ms 26124 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 78 ms 18516 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 6996 KB Output is correct
21 Correct 157 ms 26600 KB Output is correct
22 Correct 155 ms 26192 KB Output is correct
23 Correct 160 ms 28152 KB Output is correct
24 Correct 152 ms 26180 KB Output is correct
25 Correct 67 ms 16724 KB Output is correct
26 Correct 74 ms 16196 KB Output is correct
27 Correct 163 ms 29008 KB Output is correct
28 Correct 152 ms 26192 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1372 KB Output is correct
9 Correct 153 ms 27408 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 548 KB Output is correct
12 Correct 7 ms 1628 KB Output is correct
13 Correct 160 ms 31380 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 484 KB Output is correct
16 Correct 4 ms 1368 KB Output is correct
17 Correct 75 ms 19992 KB Output is correct
18 Correct 1 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 Incorrect 17 ms 4996 KB Answer gives possible 0 while actual possible 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 42 ms 6848 KB Output is correct
5 Correct 155 ms 26636 KB Output is correct
6 Correct 194 ms 26168 KB Output is correct
7 Correct 163 ms 28500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 20 ms 4432 KB Answer gives possible 0 while actual possible 1
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1720 KB Output is correct
7 Correct 162 ms 30008 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1516 KB Output is correct
13 Correct 152 ms 26124 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 78 ms 18516 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 6996 KB Output is correct
21 Correct 157 ms 26600 KB Output is correct
22 Correct 155 ms 26192 KB Output is correct
23 Correct 160 ms 28152 KB Output is correct
24 Correct 152 ms 26180 KB Output is correct
25 Correct 67 ms 16724 KB Output is correct
26 Correct 74 ms 16196 KB Output is correct
27 Correct 163 ms 29008 KB Output is correct
28 Correct 152 ms 26192 KB Output is correct
29 Correct 1 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 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 153 ms 27408 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 548 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 160 ms 31380 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 484 KB Output is correct
44 Correct 4 ms 1368 KB Output is correct
45 Correct 75 ms 19992 KB Output is correct
46 Correct 1 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 Incorrect 17 ms 4996 KB Answer gives possible 0 while actual possible 1
50 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1720 KB Output is correct
7 Correct 162 ms 30008 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1516 KB Output is correct
13 Correct 152 ms 26124 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 78 ms 18516 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 42 ms 6996 KB Output is correct
21 Correct 157 ms 26600 KB Output is correct
22 Correct 155 ms 26192 KB Output is correct
23 Correct 160 ms 28152 KB Output is correct
24 Correct 152 ms 26180 KB Output is correct
25 Correct 67 ms 16724 KB Output is correct
26 Correct 74 ms 16196 KB Output is correct
27 Correct 163 ms 29008 KB Output is correct
28 Correct 152 ms 26192 KB Output is correct
29 Correct 1 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 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1372 KB Output is correct
37 Correct 153 ms 27408 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 548 KB Output is correct
40 Correct 7 ms 1628 KB Output is correct
41 Correct 160 ms 31380 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 484 KB Output is correct
44 Correct 4 ms 1368 KB Output is correct
45 Correct 75 ms 19992 KB Output is correct
46 Correct 1 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 Incorrect 17 ms 4996 KB Answer gives possible 0 while actual possible 1
50 Halted 0 ms 0 KB -