oj.uz

답안 #367327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
367327 2021-02-16T21:41:29 Z MilosMilutinovic 슈퍼트리 잇기 (IOI20_supertrees) C++14
40 / 100
 296 ms 32364 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define pb push_back
const int N=1050;
vector<int> E[N];
vector<vector<int>> p;
vector<int> par(N);
vector<vector<int>> ans(N,vector<int>(N,0));
void AddEdge(int u,int v){E[u].pb(v);E[v].pb(u);}
vector<int> Euler;
bool was[N];
void DFS1(int u){
	was[u]=true,Euler.pb(u);
	for(int v:E[u])if(!was[v]&&p[u][v]==1)DFS1(v);
}
void DFS2(int u){
	was[u]=true,Euler.pb(u);
	for(int v:E[u])if(!was[v]&&p[u][v]==2)DFS2(v);
}
int construct(vector<vector<int>> P){
	p=P;int n=(int)P.size();
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(p[i][j]==3)return 0;
	ans.resize(n);
	for(int i=0;i<n;i++)ans[i].resize(n);
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)ans[i][j]=0;
	for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]>0)AddEdge(i,j);
	bool one=false,two=false;
	for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]==1)one=true;
	for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(p[i][j]==2)two=true;
	if(!one&&!two){build(ans);return 1;}
	if(one&&!two){
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS1(i);
				if((int)Euler.size()==1){Euler.clear();continue;}
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
				for(int i=1;i<(int)Euler.size();i++){
					int x=Euler[i],y=Euler[i-1];
					ans[x][y]=ans[y][x]=1;
				}
				Euler.clear();
			}
		}
		build(ans);
		return 1;
	}
	if(!one&&two){
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS2(i);
				if((int)Euler.size()==1){Euler.clear();continue;}
				if((int)Euler.size()==2)return 0;
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
				for(int i=1;i<(int)Euler.size();i++){
					int x=Euler[i],y=Euler[i-1];
					ans[x][y]=ans[y][x]=1;
				}
				if(Euler.size()>2){
					int x=Euler[0],y=Euler.back();
					ans[x][y]=ans[y][x]=1;
				}
				Euler.clear();
			}
		}
		build(ans);
		return 1;
	}
	if(one&&two){
		vector<int> root;
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS1(i);
				if((int)Euler.size()==1){par[i]=i;Euler.clear();continue;}
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]!=1)return 0;
				for(int x:Euler)par[x]=Euler[0];
				for(int i=1;i<(int)Euler.size();i++){
					int x=Euler[i],y=Euler[i-1];
					ans[x][y]=ans[y][x]=1;
				}
				Euler.clear();
			}
		}
		for(int i=0;i<n;i++)was[i]=false;
		for(int i=0;i<n;i++){
			if(!was[i]){
				DFS2(i);
				if((int)Euler.size()==1){Euler.clear();continue;}
				if((int)Euler.size()==2)return 0;
				for(int x:Euler)for(int y:Euler)if(x!=y&&p[x][y]==0)return 0;
				for(int i=1;i<(int)Euler.size();i++){
					int x=Euler[i],y=Euler[i-1];
					ans[x][y]=ans[y][x]=1;
				}
				if((int)Euler.size()>2){
					int x=Euler[0],y=Euler.back();
					ans[x][y]=ans[y][x]=1;
				}
				Euler.clear();
			}
		}
		build(ans);
		return 1;
	}
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:105:1: warning: control reaches end of non-void function [-Wreturn-type]
  105 | }
      | ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4844 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5356 KB Output is correct
7 Correct 253 ms 32364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4844 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5356 KB Output is correct
7 Correct 253 ms 32364 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 253 ms 28284 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 119 ms 21228 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 68 ms 8684 KB Output is correct
21 Correct 255 ms 28908 KB Output is correct
22 Correct 261 ms 28396 KB Output is correct
23 Correct 278 ms 30316 KB Output is correct
24 Correct 257 ms 28316 KB Output is correct
25 Correct 119 ms 18796 KB Output is correct
26 Correct 108 ms 18540 KB Output is correct
27 Correct 263 ms 31340 KB Output is correct
28 Correct 265 ms 28396 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 4 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 3 ms 4716 KB Output is correct
8 Correct 15 ms 5356 KB Output is correct
9 Correct 251 ms 28268 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 253 ms 32364 KB Output is correct
14 Correct 3 ms 4736 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 120 ms 21228 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 4 ms 4716 KB Output is correct
21 Correct 64 ms 8684 KB Output is correct
22 Correct 296 ms 28780 KB Output is correct
23 Correct 254 ms 28268 KB Output is correct
24 Correct 262 ms 31340 KB Output is correct
25 Correct 110 ms 18540 KB Output is correct
26 Correct 119 ms 18796 KB Output is correct
27 Correct 254 ms 28268 KB Output is correct
28 Correct 261 ms 30316 KB Output is correct
29 Correct 108 ms 18540 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 66 ms 8684 KB Output is correct
5 Correct 259 ms 28716 KB Output is correct
6 Correct 252 ms 28268 KB Output is correct
7 Correct 285 ms 30316 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 68 ms 8724 KB Output is correct
10 Correct 273 ms 28780 KB Output is correct
11 Correct 252 ms 28268 KB Output is correct
12 Correct 261 ms 31340 KB Output is correct
13 Correct 3 ms 4716 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Incorrect 3 ms 4716 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4844 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5356 KB Output is correct
7 Correct 253 ms 32364 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 253 ms 28284 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 119 ms 21228 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 68 ms 8684 KB Output is correct
21 Correct 255 ms 28908 KB Output is correct
22 Correct 261 ms 28396 KB Output is correct
23 Correct 278 ms 30316 KB Output is correct
24 Correct 257 ms 28316 KB Output is correct
25 Correct 119 ms 18796 KB Output is correct
26 Correct 108 ms 18540 KB Output is correct
27 Correct 263 ms 31340 KB Output is correct
28 Correct 265 ms 28396 KB Output is correct
29 Correct 3 ms 4716 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 4 ms 4716 KB Output is correct
32 Correct 3 ms 4716 KB Output is correct
33 Correct 3 ms 4716 KB Output is correct
34 Correct 3 ms 4716 KB Output is correct
35 Correct 3 ms 4716 KB Output is correct
36 Correct 15 ms 5356 KB Output is correct
37 Correct 251 ms 28268 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4716 KB Output is correct
40 Correct 13 ms 5356 KB Output is correct
41 Correct 253 ms 32364 KB Output is correct
42 Correct 3 ms 4736 KB Output is correct
43 Correct 3 ms 4716 KB Output is correct
44 Correct 8 ms 5228 KB Output is correct
45 Correct 120 ms 21228 KB Output is correct
46 Correct 3 ms 4716 KB Output is correct
47 Correct 3 ms 4716 KB Output is correct
48 Correct 4 ms 4716 KB Output is correct
49 Correct 64 ms 8684 KB Output is correct
50 Correct 296 ms 28780 KB Output is correct
51 Correct 254 ms 28268 KB Output is correct
52 Correct 262 ms 31340 KB Output is correct
53 Correct 110 ms 18540 KB Output is correct
54 Correct 119 ms 18796 KB Output is correct
55 Correct 254 ms 28268 KB Output is correct
56 Correct 261 ms 30316 KB Output is correct
57 Correct 108 ms 18540 KB Output is correct
58 Correct 3 ms 4716 KB Output is correct
59 Correct 3 ms 4716 KB Output is correct
60 Correct 8 ms 5228 KB Output is correct
61 Correct 122 ms 22892 KB Output is correct
62 Correct 3 ms 4716 KB Output is correct
63 Correct 3 ms 4844 KB Output is correct
64 Correct 3 ms 4716 KB Output is correct
65 Incorrect 65 ms 8684 KB Too many ways to get from 1 to 256, should be 2 found no less than 3
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4844 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 13 ms 5356 KB Output is correct
7 Correct 253 ms 32364 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 3 ms 4716 KB Output is correct
11 Correct 3 ms 4716 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 253 ms 28284 KB Output is correct
14 Correct 3 ms 4716 KB Output is correct
15 Correct 3 ms 4716 KB Output is correct
16 Correct 8 ms 5228 KB Output is correct
17 Correct 119 ms 21228 KB Output is correct
18 Correct 3 ms 4716 KB Output is correct
19 Correct 3 ms 4716 KB Output is correct
20 Correct 68 ms 8684 KB Output is correct
21 Correct 255 ms 28908 KB Output is correct
22 Correct 261 ms 28396 KB Output is correct
23 Correct 278 ms 30316 KB Output is correct
24 Correct 257 ms 28316 KB Output is correct
25 Correct 119 ms 18796 KB Output is correct
26 Correct 108 ms 18540 KB Output is correct
27 Correct 263 ms 31340 KB Output is correct
28 Correct 265 ms 28396 KB Output is correct
29 Correct 3 ms 4716 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 4 ms 4716 KB Output is correct
32 Correct 3 ms 4716 KB Output is correct
33 Correct 3 ms 4716 KB Output is correct
34 Correct 3 ms 4716 KB Output is correct
35 Correct 3 ms 4716 KB Output is correct
36 Correct 15 ms 5356 KB Output is correct
37 Correct 251 ms 28268 KB Output is correct
38 Correct 3 ms 4716 KB Output is correct
39 Correct 3 ms 4716 KB Output is correct
40 Correct 13 ms 5356 KB Output is correct
41 Correct 253 ms 32364 KB Output is correct
42 Correct 3 ms 4736 KB Output is correct
43 Correct 3 ms 4716 KB Output is correct
44 Correct 8 ms 5228 KB Output is correct
45 Correct 120 ms 21228 KB Output is correct
46 Correct 3 ms 4716 KB Output is correct
47 Correct 3 ms 4716 KB Output is correct
48 Correct 4 ms 4716 KB Output is correct
49 Correct 64 ms 8684 KB Output is correct
50 Correct 296 ms 28780 KB Output is correct
51 Correct 254 ms 28268 KB Output is correct
52 Correct 262 ms 31340 KB Output is correct
53 Correct 110 ms 18540 KB Output is correct
54 Correct 119 ms 18796 KB Output is correct
55 Correct 254 ms 28268 KB Output is correct
56 Correct 261 ms 30316 KB Output is correct
57 Correct 108 ms 18540 KB Output is correct
58 Correct 4 ms 4716 KB Output is correct
59 Correct 3 ms 4716 KB Output is correct
60 Correct 3 ms 4716 KB Output is correct
61 Correct 66 ms 8684 KB Output is correct
62 Correct 259 ms 28716 KB Output is correct
63 Correct 252 ms 28268 KB Output is correct
64 Correct 285 ms 30316 KB Output is correct
65 Correct 3 ms 4716 KB Output is correct
66 Correct 68 ms 8724 KB Output is correct
67 Correct 273 ms 28780 KB Output is correct
68 Correct 252 ms 28268 KB Output is correct
69 Correct 261 ms 31340 KB Output is correct
70 Correct 3 ms 4716 KB Output is correct
71 Correct 3 ms 4716 KB Output is correct
72 Incorrect 3 ms 4716 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -