제출 #888212

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

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;
bool vs[nx];

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int> (n, 0));
	for (int i=0; i<n; i++)
    {
        if (vs[i]) continue;
        queue<int> q;
        vector<int> d;
        q.push(i); vs[i]=1;
        while (!q.empty())
        {
            auto u=q.front(); 
            q.pop();
            d.push_back(u);
            for (int v=0; v<n; v++) if (p[u][v]==2&&!vs[v]) vs[v]=1, q.push(v);
        }
        for (auto u:d) for (auto v:d) if (p[u][v]==0) return 0;
        if (d.size()==2) return 0;
        if (d.size()<=1) continue;
        for (int j=0; j<(int)d.size()-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
        answer[d[0]][d[(int)d.size()-1]]=answer[d[d[(int)d.size()-1]]][d[0]]=1;
    }
	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