제출 #591119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
591119		APROHACK	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1081 ms	212 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>
#define ll long long
#define ff first
#define ss second
using namespace std;

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);
		answer.push_back(row);
	}
	ll cuenta = 0;
	int unos[n];
	for(int i = 0 ; i <n ; i ++){
		cuenta=0;
		for(int j = 0 ; j < n ; i++){
			if(i!=j && p[i][j]==1)cuenta++;
		}
		unos[i]=cuenta;
	}
	/// uno los que solo tienen un camino
	vector<int>recorridos;
	recorridos.resize(n);
	int pp = 0;
	for(int cur = 0 ; cur < n ; cur++){
		if(!unos[cur])continue;
		pp = 0;
		for(int j = 0 ; j < n ; j ++){
			if(cur!=j && p[cur][j]==1){
				recorridos[pp]=j;
				pp++;
			}
		}
		for(int i = 0 ; i < pp ; i++){
			//tengo que unir los de recorridos por una linea
		}
	}
	build(answer);
	return 1;
}

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