oj.uz

답안 #497130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497130 2021-12-22T13:44:30 Z Hanksburger 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 208 ms 24060 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > grp, ans;
bool visited[1005];
vector<int> tmp;
queue<int> Q;
int construct(vector<vector<int> > P)
{
	int N=P.size();
	bool subtask1=1, subtask2=1;
	for (int i=0; i<N; i++)
	{
		for (int j=0; j<N; j++)
		{
			if (P[i][j]==0 || P[i][j]==2 || P[i][j]==3)
				subtask1=0;
			if (P[i][j]==2 || P[i][j]==3)
				subtask2=0;
		}
	}
	if (subtask1)
	{
		tmp.push_back(0);
		for (int i=1; i<N; i++)
			tmp.push_back(1);
		ans.push_back(tmp);
		for (int i=1; i<N; i++)
		{
			tmp.clear();
			tmp.push_back(1);
			for (int j=1; j<N; j++)
				tmp.push_back(0);
			ans.push_back(tmp);
		}
	}
	else
	{
		for (int i=0; i<N; i++)
		{
			if (visited[i])
				continue;
			tmp.clear();
			tmp.push_back(i);
			Q.push(i);
			visited[i]=1;
			while (!Q.empty())
			{
				int u=Q.front();
				Q.pop();
				for (int j=0; j<N; j++)
				{
					if (P[u][j] && !visited[j])
					{
						tmp.push_back(j);
						Q.push(j);
						visited[j]=1;
					}
				}
			}
			grp.push_back(tmp);
		}
		for (int i=0; i<grp.size(); i++)
		{
			for (int j=0; j<grp[i].size(); j++)
			{
				int u=grp[i][j];
				for (int k=j+1; k<grp[i].size(); k++)
					if (!P[u][grp[i][k]])
						return 0;
			}
		}
		for (int i=0; i<N; i++)
		{
			tmp.clear();
			for (int j=0; j<N; j++)
				tmp.push_back(0);
			ans.push_back(tmp);
		}
		for (int i=0; i<grp.size(); i++)
		{
			for (int j=1; j<grp[i].size(); j++)
			{
				int u=grp[i][j-1], v=grp[i][j];
				ans[u][v]=ans[v][u]=1;
			}
		}
	}
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:63:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for (int i=0; i<grp.size(); i++)
      |                 ~^~~~~~~~~~~
supertrees.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |    for (int j=0; j<grp[i].size(); j++)
      |                  ~^~~~~~~~~~~~~~
supertrees.cpp:68:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for (int k=j+1; k<grp[i].size(); k++)
      |                     ~^~~~~~~~~~~~~~
supertrees.cpp:80:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |   for (int i=0; i<grp.size(); i++)
      |                 ~^~~~~~~~~~~
supertrees.cpp:82:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    for (int j=1; j<grp[i].size(); j++)
      |                  ~^~~~~~~~~~~~~~
supertrees.cpp:11:19: warning: variable 'subtask2' set but not used [-Wunused-but-set-variable]
   11 |  bool subtask1=1, subtask2=1;
      |                   ^~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 292 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 174 ms 22552 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 292 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 174 ms 22552 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 292 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 193 ms 24060 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 668 KB Output is correct
17 Correct 84 ms 10132 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 6252 KB Output is correct
21 Correct 176 ms 24004 KB Output is correct
22 Correct 200 ms 23932 KB Output is correct
23 Correct 187 ms 23932 KB Output is correct
24 Correct 208 ms 23972 KB Output is correct
25 Correct 76 ms 10216 KB Output is correct
26 Correct 72 ms 10116 KB Output is correct
27 Correct 194 ms 23920 KB Output is correct
28 Correct 183 ms 23960 KB Output is correct

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

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 292 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 292 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 174 ms 22552 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 292 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 193 ms 24060 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 668 KB Output is correct
17 Correct 84 ms 10132 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 6252 KB Output is correct
21 Correct 176 ms 24004 KB Output is correct
22 Correct 200 ms 23932 KB Output is correct
23 Correct 187 ms 23932 KB Output is correct
24 Correct 208 ms 23972 KB Output is correct
25 Correct 76 ms 10216 KB Output is correct
26 Correct 72 ms 10116 KB Output is correct
27 Correct 194 ms 23920 KB Output is correct
28 Correct 183 ms 23960 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 292 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 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 0 ms 292 KB Output is correct
6 Correct 7 ms 1200 KB Output is correct
7 Correct 174 ms 22552 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 292 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 193 ms 24060 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 668 KB Output is correct
17 Correct 84 ms 10132 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 6252 KB Output is correct
21 Correct 176 ms 24004 KB Output is correct
22 Correct 200 ms 23932 KB Output is correct
23 Correct 187 ms 23932 KB Output is correct
24 Correct 208 ms 23972 KB Output is correct
25 Correct 76 ms 10216 KB Output is correct
26 Correct 72 ms 10116 KB Output is correct
27 Correct 194 ms 23920 KB Output is correct
28 Correct 183 ms 23960 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 292 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -