oj.uz

답안 #756331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756331 2023-06-11T14:03:44 Z Trumling 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 221 ms 25996 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

vector<bool>vis(1000,0);
vector<bool>vis2(1000,0);

vector<vector<int>>g;
vector<vector<int>>ans;
ll nn;

bool dfs1(int start,int beg)
{
	vis[start]=1;
	for(int i=0;i<nn;i++)
		if(g[start][i]!=g[beg][i] && i!=start && i!=beg)
			return 0;

	for(int i=0;i<nn;i++)
		if(!vis[i] && g[start][i]==1)
		{
			ans[i][start]=1;
			ans[start][i]=1;
			return dfs1(i,beg);
		}

	vis[beg]=0;

	return 1;
}

bool dfs2(int start,int beg)
{
	vis[start]=1;
	if(start!=beg)
	for(int i=0;i<nn;i++)
	{
		if(g[start][i]==g[beg][i])
		continue;

		if(g[start][i]==1 && g[beg][i]==1)
		return 0;

		if(g[start][i]==2 && g[beg][i]==0 || g[start][i]==0 && g[beg][i]==2)
		return 0;

		if(g[start][i]==1 && g[beg][i]==0 || g[start][i]==0 && g[beg][i]==1)
		return 0;
	}

	ll count=0;
	for(int i=0;i<nn;i++)
		if(g[start][i]==2 && !vis[i])
		count++;

	if(count==1)
	return 0;

	for(int i=0;i<nn;i++)
		if(!vis[i] && g[start][i]==2)
		{
			ans[i][start]=1;
			ans[start][i]=1;

			return dfs2(i,beg);
		}
	ans[start][beg]=1;
	ans[beg][start]=1;
	return 1;
}

int construct(vector<vector<int>> pr) 
{
	nn=pr.size();
	g=pr;

	ans.assign(nn,vector<int>(nn,0));

	for(int i=0;i<nn;i++)
	{
		bool now=dfs1(i,i);
		if(!now)
		return 0;
	}

	for(int i=0;i<nn;i++)
	{
		if(vis[i])
		continue;

		bool now=dfs2(i,i);
		if(!now)
		return 0;
	}

	for(int i=0;i<nn;i++)
	ans[i][i]=0;

	build(ans);
	return 1;

}

Compilation message

supertrees.cpp: In function 'bool dfs2(int, int)':
supertrees.cpp:53:21: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   53 |   if(g[start][i]==2 && g[beg][i]==0 || g[start][i]==0 && g[beg][i]==2)
supertrees.cpp:56:21: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   56 |   if(g[start][i]==1 && g[beg][i]==0 || g[start][i]==0 && g[beg][i]==1)

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1312 KB Output is correct
7 Correct 180 ms 25876 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1312 KB Output is correct
7 Correct 180 ms 25876 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1236 KB Output is correct
13 Correct 173 ms 25988 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 77 ms 16020 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 48 ms 6664 KB Output is correct
21 Correct 179 ms 25872 KB Output is correct
22 Correct 169 ms 25952 KB Output is correct
23 Correct 221 ms 25940 KB Output is correct
24 Correct 171 ms 25948 KB Output is correct
25 Correct 79 ms 16088 KB Output is correct
26 Correct 75 ms 16076 KB Output is correct
27 Correct 180 ms 25996 KB Output is correct
28 Correct 179 ms 25880 KB Output is correct

Subtask #3
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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1312 KB Output is correct
7 Correct 180 ms 25876 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1236 KB Output is correct
13 Correct 173 ms 25988 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 77 ms 16020 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 48 ms 6664 KB Output is correct
21 Correct 179 ms 25872 KB Output is correct
22 Correct 169 ms 25952 KB Output is correct
23 Correct 221 ms 25940 KB Output is correct
24 Correct 171 ms 25948 KB Output is correct
25 Correct 79 ms 16088 KB Output is correct
26 Correct 75 ms 16076 KB Output is correct
27 Correct 180 ms 25996 KB Output is correct
28 Correct 179 ms 25880 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1312 KB Output is correct
7 Correct 180 ms 25876 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1236 KB Output is correct
13 Correct 173 ms 25988 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 77 ms 16020 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 48 ms 6664 KB Output is correct
21 Correct 179 ms 25872 KB Output is correct
22 Correct 169 ms 25952 KB Output is correct
23 Correct 221 ms 25940 KB Output is correct
24 Correct 171 ms 25948 KB Output is correct
25 Correct 79 ms 16088 KB Output is correct
26 Correct 75 ms 16076 KB Output is correct
27 Correct 180 ms 25996 KB Output is correct
28 Correct 179 ms 25880 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -