제출 #348373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348373		Chaska	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	1031 ms	30188 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
vector<int> g[1005],s;
bool vs[1005],y;
int pp[1005][1005];
void dfs(int u)
{
    s.pb(u);
    vs[u] = true;
    for (int v : g[u]) if (!vs[v]) dfs(v);
}
void gg(int in,int u)
{
    if (pp[in][u]==0) y = false;
    vs[u] = true;
    for (int v : g[u]) if (!vs[v]) gg(in,v);
}
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);
	}
    for (int i=0;i<n;i++) for (int j=0;j<n;j++) if (i!=j) if (p[i][j]==1) g[i].pb(j);
    for (int i=0;i<n;i++) for (int j=0;j<n;j++) pp[i][j] = p[i][j];
    for (int i=0;i<n;i++) if (!vs[i]) {
        s.clear();
        dfs(i);
        int ss = s.size();
        for (int j=0;j<ss-1;j++) {
            answer[s[j]][s[j+1]] = 1;
            answer[s[j+1]][s[j]] = 1;
        }
    }
    y = true;
    for (int i=0;i<n;i++) {
        for (int j=0;j<n;j++) vs[j] = false;
        gg(i,i);
    }
	if (y) build(answer);
	if (y) return 1;
    else return 0;
}

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