답안 #301582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301582	2020-09-18T04:59:49 Z	Bill_00	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1 ms	896 KB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int u[1001]={0};
int construct(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);
		for(int j=0;j<n;j++){
			row[j]=0;
		}
		answer.push_back(row);
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(p[i][j]==3){
				return 0;
			}
		}
	}
	int o=0;
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			if(u[i]!=u[j] && p[i][j]!=0){
				return 0;
			}
		}
		if(u[i]==0){
			o++;
			u[i]=o;
		} 
		for(int j=i;j<n;j++){
			if(p[i][j]!=0){
				u[j]=u[i];
			}
		}
	}
	vector<int>v[10001];
	for(int i=0;i<n;i++){
		v[u[i]].push_back(i);
	}
	for(int i=1;i<=o;i++){
		vector<int>group;
		vector<int>core;
		for(int j=0;j<v[i].size();j++){
			int flag=0;
			for(int k=0;k<v[i].size();k++){
				if(j==k) continue;
				if(p[v[i][j]][v[i][k]]==1){
					flag++;
				}
			}
			if(flag){
				group.push_back(v[i][j]);
			}
			else core.push_back(v[i][j]);
		}
		for(int j=0;j<group.size();j++){
			for(int k=0;k<group.size();k++){
				if(p[group[j]][group[k]]==2) return 0;
			}
		}
		core.push_back(group[0]);
		for(int j=0;j<group.size()-1;j++){
			answer[group[j]][group[j+1]]=1;
			answer[group[j+1]][group[j]]=1;
		}
		for(int j=0;j<core.size();j++){
			answer[core[j]][core[(j+1)%(core.size())]]=1;
			answer[core[(j+1)%(core.size())]][core[j]]=1;		
		}
	}
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:48:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int j=0;j<v[i].size();j++){
      |               ~^~~~~~~~~~~~
supertrees.cpp:50:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |    for(int k=0;k<v[i].size();k++){
      |                ~^~~~~~~~~~~~
supertrees.cpp:61:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   for(int j=0;j<group.size();j++){
      |               ~^~~~~~~~~~~~~
supertrees.cpp:62:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    for(int k=0;k<group.size();k++){
      |                ~^~~~~~~~~~~~~
supertrees.cpp:67:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |   for(int j=0;j<group.size()-1;j++){
      |               ~^~~~~~~~~~~~~~~
supertrees.cpp:71:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |   for(int j=0;j<core.size();j++){
      |               ~^~~~~~~~~~~~

Subtask #1

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	896 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	896 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	896 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	896 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	896 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	896 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-