제출 #777800

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

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
struct DSU
{
	/* data */
	int n;
	vector<int> par, sz;
	void init(int _n)
	{
		n = _n;
		par.resize(n + 1, -1);
		sz.resize(n + 1, 0);
	}
	int finds(int a)
	{
		if (par[a] == -1)
			return a;
		return par[a] = finds(par[a]);
	}
	void unites(int a, int b)
	{
		int x = finds(a);
		int y = finds(b);
		if (x != y)
		{
			if (sz[x] < sz[y])
				swap(x, y);
			par[y] = x;
			sz[x] += sz[y];
		}
	}
};
int construct(std::vector<std::vector<int>> p)
{
	int n = p.size();
	DSU d;
	d.init(n);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (i == j)
				continue;
			if (p[i][j] == 3)
				return 0;
			if (p[i][j])
			{
				d.unites(i, j);
			}
		}
	}
	map<int, vector<int>> mp;
	for (int i = 0; i < n; i++)
	{
		mp[d.finds(i)].push_back(i);
		for (int j = 0; j < n; j++)
		{
			if (i == j)
				continue;
			if (p[i][j] == 0)
				if (d.finds(i) == d.finds(j))
					return 0;
		}
	}
	vector<vector<int>> ans(n, vector<int>(n, 0));
	for (auto a : mp)
	{
		if (a.second.size() == 1)
			continue;
		int csz = a.second.size();
		vector<int> vis(csz, 0), cyc;
		for (int i = 0; i < csz; i++)
		{
			int st = -1;
			int ii = a.second[i];
			if (vis[ii])
				continue;
			cyc.push_back(ii);
			vis[ii] = 1;
			st = ii;

			for (int j = 0; j < csz; j++)
			{
				if (vis[j])
					continue;
				if (p[ii][j] == 1)
					ans[st][j] = 1, ans[j][st] = 1, st = j;
			}
		}
		if(cyc.size() == 2)
			return 0;
		int st = cyc[0];
		for(int i=1;i<cyc.size();i++)
		{
			ans[st][cyc[i]] = 1;
			ans[cyc[i]][st] = 1;
			st = cyc[i];
		}
	}
	build(ans);
	return 1;
}

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:95:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |   for(int i=1;i<cyc.size();i++)
      |               ~^~~~~~~~~~~

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