oj.uz

답안 #1078734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078734 2024-08-28T05:23:47 Z Muhammad_Aneeq 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 153 ms 24148 KB 
#include <vector>
#include <iostream>
using namespace std;
int const MAXN=1000;
bool ed[MAXN][MAXN]={};
bool vis[MAXN]={};
bool in[MAXN]={};
vector<int>ans,cur;
bool check(int u)
{
	for (auto i:cur)
	{
		if (ed[i][u]==0)
			return 0;
	}
	return 1;
}
void dfs(int u,int p=-1)
{
	cur.push_back(u);
	vis[u]=1;
	in[u]=1;
	for (int i=0;i<MAXN;i++)
	{
		if (u==i)
			continue;
		if (!vis[i]&&ed[u][i]&&check(i))
			dfs(i,u);
		if (i!=p&&ed[i][u]&&in[i])
			ans=cur;
	}
	in[u]=0;
	cur.pop_back();
}
void build(vector<vector<int>> b);
int construct(vector<vector<int>> p)
{
	int n=p.size();
	bool subt1=1,subt2=1,subt3=1,subt4=1;
	for (int i=0;i<n;i++)
	{
		for (int j=i+1;j<n;j++)
		{
			if (p[i][j]!=1)
				subt1=0;
			if (p[i][j]>1)
				subt2=0;
			if (p[i][j]==1)
				subt3=0;
			if (p[i][j]>2)
				subt4=0;
		}
	}
	if (subt1)
	{
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=1;i<n;i++)
			b[0][i]=b[i][0]=1;
		build(b);
		return 1;
	}
	if (subt2)
	{
		bool vis[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!vis[i])
			{
				vis[i]=1;
				head[i]=i;
				for (int j=0;j<n;j++)
				{
					if (vis[j])
						continue;
					if (p[i][j])
					{
						vis[j]=1;
						b[i][j]=b[j][i]=1;
						head[j]=i;
					}
				}
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=0;j<n;j++)
			{
				if (p[i][j]&&head[i]!=head[j])
					return 0;
				if (p[i][j]==0&&head[i]==head[j])
					return 0;
			}
		}
		build(b);
		return 1;
	}
	if (subt3)
	{
		bool vis[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!vis[i])
			{
				vector<int>z;
				for (int j=0;j<n;j++)
				{
					if (p[i][j])
						z.push_back(j);
				}
				if (z.size()==1)
				{
					head[i]=i;
					continue;
				}
				if (z.size()==2)
					return 0;
				for (int j=0;j<z.size();j++)
				{
					vis[z[j]]=1;
					head[z[j]]=i;
					b[z[j]][z[(j+1)%z.size()]]=b[z[(j+1)%z.size()]][z[j]]=1;
				}
			}
		}
		for (int i=0;i<n;i++)
		{
			for (int j=i+1;j<n;j++)
			{
				if (p[i][j]&&head[i]!=head[j])
					return 0;
				if (p[i][j]==0&&head[i]==head[j])
					return 0;
			}
		}
		build(b);
		return 1;
	}
	if (subt4)
	{
		for (int i=0;i<n;i++)
			for (int j=i+1;j<n;j++)
				if (p[i][j]==2)
					ed[i][j]=ed[j][i]=1;
		bool seen[n]={};
		int head[n]={};
		vector<vector<int>>b(n,vector<int>(n));
		for (int i=0;i<n;i++)
		{
			if (!seen[i])
			{
				seen[i]=1;
				head[i]=i;
				for (int j=0;j<n;j++)
				{
					if (seen[j])
						continue;
					if (p[i][j])
					{
						seen[j]=1;
						b[i][j]=b[j][i]=1;
						head[j]=i;
					}
				}
			}
		}
		bool done[n]={};
		for (int i=0;i<n;i++)
		{
			if (!done[i])
			{
				ans={},cur={};
				dfs(i);
				for (auto j:ans)
					done[j]=1;
				if (ans.size()>1)
				{
					for (int j=0;j<ans.size();j++)
					{
						head[ans[j]]=i;
						b[ans[j]][ans[(j+1)%ans.size()]]=b[ans[(j+1)%ans.size()]][ans[j]]=1;
					}
				}
			}
		}
		build(b);
		return 1;
	}
	return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1336 KB Output is correct
13 Correct 143 ms 23964 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 14080 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6284 KB Output is correct
21 Correct 118 ms 23892 KB Output is correct
22 Correct 128 ms 24068 KB Output is correct
23 Correct 123 ms 24144 KB Output is correct
24 Correct 130 ms 23936 KB Output is correct
25 Correct 52 ms 14164 KB Output is correct
26 Correct 55 ms 14164 KB Output is correct
27 Correct 125 ms 24148 KB Output is correct
28 Correct 115 ms 23952 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1196 KB Output is correct
9 Correct 132 ms 23956 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 125 ms 24080 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 61 ms 14160 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 31 ms 6236 KB Output is correct
22 Correct 122 ms 24052 KB Output is correct
23 Correct 124 ms 24076 KB Output is correct
24 Correct 144 ms 23984 KB Output is correct
25 Correct 54 ms 14160 KB Output is correct
26 Correct 52 ms 14160 KB Output is correct
27 Correct 112 ms 24064 KB Output is correct
28 Correct 124 ms 24144 KB Output is correct
29 Correct 53 ms 14160 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 30 ms 6248 KB Output is correct
5 Correct 119 ms 24036 KB Output is correct
6 Correct 131 ms 24144 KB Output is correct
7 Correct 143 ms 24060 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 31 ms 6272 KB Output is correct
10 Correct 126 ms 24064 KB Output is correct
11 Correct 112 ms 23988 KB Output is correct
12 Correct 153 ms 23980 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Incorrect 1 ms 348 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1336 KB Output is correct
13 Correct 143 ms 23964 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 14080 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6284 KB Output is correct
21 Correct 118 ms 23892 KB Output is correct
22 Correct 128 ms 24068 KB Output is correct
23 Correct 123 ms 24144 KB Output is correct
24 Correct 130 ms 23936 KB Output is correct
25 Correct 52 ms 14164 KB Output is correct
26 Correct 55 ms 14164 KB Output is correct
27 Correct 125 ms 24148 KB Output is correct
28 Correct 115 ms 23952 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1196 KB Output is correct
37 Correct 132 ms 23956 KB Output is correct
38 Correct 1 ms 440 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 125 ms 24080 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 61 ms 14160 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6236 KB Output is correct
50 Correct 122 ms 24052 KB Output is correct
51 Correct 124 ms 24076 KB Output is correct
52 Correct 144 ms 23984 KB Output is correct
53 Correct 54 ms 14160 KB Output is correct
54 Correct 52 ms 14160 KB Output is correct
55 Correct 112 ms 24064 KB Output is correct
56 Correct 124 ms 24144 KB Output is correct
57 Correct 53 ms 14160 KB Output is correct
58 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
59 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 116 ms 23892 KB Output is correct
8 Correct 1 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 1 ms 348 KB Output is correct
12 Correct 6 ms 1336 KB Output is correct
13 Correct 143 ms 23964 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 72 ms 14080 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 31 ms 6284 KB Output is correct
21 Correct 118 ms 23892 KB Output is correct
22 Correct 128 ms 24068 KB Output is correct
23 Correct 123 ms 24144 KB Output is correct
24 Correct 130 ms 23936 KB Output is correct
25 Correct 52 ms 14164 KB Output is correct
26 Correct 55 ms 14164 KB Output is correct
27 Correct 125 ms 24148 KB Output is correct
28 Correct 115 ms 23952 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1196 KB Output is correct
37 Correct 132 ms 23956 KB Output is correct
38 Correct 1 ms 440 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 125 ms 24080 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 61 ms 14160 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6236 KB Output is correct
50 Correct 122 ms 24052 KB Output is correct
51 Correct 124 ms 24076 KB Output is correct
52 Correct 144 ms 23984 KB Output is correct
53 Correct 54 ms 14160 KB Output is correct
54 Correct 52 ms 14160 KB Output is correct
55 Correct 112 ms 24064 KB Output is correct
56 Correct 124 ms 24144 KB Output is correct
57 Correct 53 ms 14160 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 30 ms 6248 KB Output is correct
62 Correct 119 ms 24036 KB Output is correct
63 Correct 131 ms 24144 KB Output is correct
64 Correct 143 ms 24060 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 31 ms 6272 KB Output is correct
67 Correct 126 ms 24064 KB Output is correct
68 Correct 112 ms 23988 KB Output is correct
69 Correct 153 ms 23980 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Incorrect 1 ms 348 KB Too many ways to get from 0 to 3, should be 2 found no less than 3
72 Halted 0 ms 0 KB -