제출 #329566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
329566		pggp	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	256 ms	24300 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

vector< vector < int > > comp;
int comp_id[1005];

//void build(vector< vector < int > > p){
//	}

int construct(vector< vector < int > > p){
	int n = p.size();
	for (int i = 0; i < n; ++i)
	{
		bool added = false;
		// sprawdzamy do której składowej należy i
		for(int j = 0; j < comp.size(); j++){
			if(p[i][comp[j][0]] != 0){
				comp[j].push_back(i);
				comp_id[i] = j;
				added = true;
				break;
			}
		}
		if(!added){
			vector < int > v;
			v.push_back(i);
			comp_id[i] = comp.size();
			comp.push_back(v);
		}
	}


	vector < vector < int > > b;
	b.resize(n);
	for (int i = 0; i < n; ++i)
	{
		b[i].resize(n);
		for (int j = 0; j < n; ++j)
		{
			b[i][j] = 0;
		}
	}

	for(int	i = 0; i < comp.size(); i++){
		for (int j = 1; j < comp[i].size(); ++j)
		{
			b[comp[i][j]][comp[i][j - 1]] = 1;
			b[comp[i][j - 1]][comp[i][j]] = 1;
		}
	}
	build(b);
	return 1;
}

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

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

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