제출 #394315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
394315		snasibov05	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1094 ms	14396 KiB

supertrees

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

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int>(n));
	vector<int> cmp_n(n, -1);
	vector<vector<int>> cmp;

	int k = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (p[i][j] == 1){
                cmp_n[i] = cmp_n[j];
                cmp[cmp_n[i]].push_back(i);
            }
        }
        if (cmp_n[i] == -1) cmp_n[i] = k++, cmp.push_back({i});
    }

    for (int i = 0; i < cmp.size(); ++i) {
        for (int j = 0; j < cmp[i].size(); ++j) {
            for (int l = 0; l < cmp[i].size(); ++l) {
                if (p[cmp[i][j]][cmp[i][l]] == 0) return 0;
                if (j == 0 && l != 0) answer[cmp[i][j]][cmp[i][l]] = answer[cmp[i][l]][cmp[i][j]] = 1;
            }
        }
    }



	build(answer);
	return 1;
}

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 0; i < cmp.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
supertrees.cpp:24:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int j = 0; j < cmp[i].size(); ++j) {
      |                         ~~^~~~~~~~~~~~~~~
supertrees.cpp:25:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |             for (int l = 0; l < cmp[i].size(); ++l) {
      |                             ~~^~~~~~~~~~~~~~~

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