제출 #302729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
302729		nadidadit	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	1 ms	256 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; 
int n;
vector<vector<int>> b;
 
int construct(vector<std::vector<int>> p) {
	n = p.size();
	b.resize(n);
	for(int i = 0; i < n; ++i)	b[i].resize(n);
	int adit[n];
    	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			b[i][j]=0;
			adit[i]=0;
		}
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if(p[i][j]!=p[j][i])
			{
				return 0;
			}
		}
	}
	int count=0,past;
	for(int i=0;i<n;i++)
	{
		vector<int>check;
		if(adit[i]==0)
		{
		for(int j=0;j<n;j++)
		{
			if(p[i][j]==1)
			{
				if(adit[j]==1)
				{
					return 0;
				}
				check.push_back(j);
			}
		}
			if(check.size()>1)
			{
				for(int i=0;i<check.size()-1;i++)
				{
					b[check[i]][check[i+1]]=1;
					adit[check[i]]=1;
					b[check[i+1]][check[i]]=1;
				}
				adit[check[check.size()-1]]=1;
				for(int i=0;i<check.size();i++)
				{
					for(int j=0;j<check.size();j++)
					{
						p[check[i]][check[j]]=0;
						p[check[j]][check[i]]=0;
					}
				}
			}
			check.clear();
	}
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if(i!=j && p[i][j]==1)
			{
				return 0;
			}
		}
	}
	return 0;
	build(b);
	return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:50:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i=0;i<check.size()-1;i++)
      |                 ~^~~~~~~~~~~~~~~
supertrees.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i=0;i<check.size();i++)
      |                 ~^~~~~~~~~~~~~
supertrees.cpp:59:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |      for(int j=0;j<check.size();j++)
      |                  ~^~~~~~~~~~~~~
supertrees.cpp:31:6: warning: unused variable 'count' [-Wunused-variable]
   31 |  int count=0,past;
      |      ^~~~~
supertrees.cpp:31:14: warning: unused variable 'past' [-Wunused-variable]
   31 |  int count=0,past;
      |              ^~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4