제출 #807388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807388		nemethm	Connecting Supertrees (IOI20_supertrees)	C++17	40 / 100	150 ms	27952 KiB

supertrees

#include "supertrees.h"
#include <vector>

using namespace std;

int cmp[1010] = {0};

int subtask3(std::vector<std::vector<int>> p){
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	int id = 0;
	vector<vector<int>> elek;
	for(int i = 0; i < n; ++i){
		bool uj = false;
		if(cmp[i] == 0){
			++id;
			cmp[i] = id;
			uj = true;
			elek.push_back({i});
		}
		for(int j = 0; j < n; ++j){
			if(j == i) continue;
			if(p[i][j] == 2){
				if(cmp[j] != cmp[i] && !uj){
					return 0;
				}
				else if(uj){
					cmp[j] = cmp[i];
					elek.back().push_back(j);
				}
			}
			else{
				if(cmp[j] == cmp[i]){
					return 0;
				}
			}
		}
	}
	for(auto& v : elek){
		if(v.size() == 2){
			return 0;
		}
		if(v.size() > 2){
			for(int i = 0; i < v.size(); ++i){
				answer[v[i]][v[(i + 1) % v.size()]] = answer[v[(i + 1) % v.size()]][v[i]] = 1;
			}
		}
	}
	build(answer);
	return 1;
}

int subtask12(std::vector<std::vector<int>> p){
		int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	int id = 0;
	vector<vector<pair<int,int>>> elek;
	for(int i = 0; i < n; ++i){
		bool uj = false;
		if(cmp[i] == 0){
			++id;
			cmp[i] = id;
			uj = true;
			elek.push_back({});
		}
		for(int j = 0; j < n; ++j){
			if(j == i) continue;
			if(p[i][j] == 1){
				if(cmp[j] != cmp[i] && !uj){
					return 0;
				}
				else if(uj){
					cmp[j] = cmp[i];
					elek.back().push_back({j, i});
				}
			}
			else{
				if(cmp[j] == cmp[i]){
					return 0;
				}
			}
		}
	}
	for(auto& v : elek){
		for(auto i : v){
			answer[i.first][i.second] = answer[i.second][i.first] = 1;
		}
	}
	build(answer);
	return 1;
}

int construct(std::vector<std::vector<int>> p) {
	for(int i = 0; i < p.size(); ++i){
		for(int j = 0; j < p.size(); ++j){
			if(p[i][j] == 2){
				return subtask3(p);
			}
		}
	}
	return subtask12(p);
	return 1;
}

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

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

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