oj.uz

답안 #777806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777806 2023-07-09T16:29:29 Z Minindu206 슈퍼트리 잇기 (IOI20_supertrees) C++14
0 / 100
 1 ms 212 KB 
#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[i])
				continue;
			cyc.push_back(ii);
			vis[ii] = 1;
			st = ii;
 
			for (int j = 0; j < csz; j++)
			{
				int jj = a.second[j];
				if (vis[j])
					continue;
				if (p[ii][jj] == 1)
					ans[st][jj] = 1, ans[jj][st] = 1, st = jj;
			}
		}
		if(cyc.size() == 2)
			return 0;
		int st = cyc[0];
		for(int i=1;i<(int)cyc.size();i++)
		{
			ans[st][cyc[i]] = 1;
			ans[cyc[i]][st] = 1;
			st = cyc[i];
		}
	}
	build(ans);
	return 1;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 0 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -