oj.uz

답안 #779170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779170 2023-07-11T08:39:09 Z Elias 슈퍼트리 잇기 (IOI20_supertrees) C++17
19 / 100
 185 ms 22204 KB 
#ifndef _DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
int construct(std::vector<std::vector<int>> p);
void build(std::vector<std::vector<int>> b);
#endif

#ifndef _DEBUG
#include <supertrees.h>
#endif

int construct(std::vector<std::vector<int>> p)
{
	int n = p.size();
	std::vector<std::vector<int>> answer(n, vector<int>(n));

	vector<int> all(n);
	for (int i = 0; i < n; i++)
		all[i] = i;

	auto split = [&](vector<int> a, int splitter)
	{
		int n = a.size();

		vector<set<int>> components;
		map<int, int> componentId;
		for (int i = 0; i < n; i++)
		{
			components.push_back({a[i]});
			componentId[a[i]] = i;
		}

		auto merge = [&](int a, int b)
		{
			a = componentId[a];
			b = componentId[b];

			assert(components[a].size() && components[b].size());

			if (a == b)
				return;

			if (components[a].size() < components[b].size())
				swap(a, b);

			for (auto x : components[b])
			{
				components[a].insert(x);
				componentId[x] = a;
			}

			components[b].clear();
		};

		for (int i = 0; i < n; i++)
			for (int j = i + 1; j < n; j++)
			{
				if (p[i][j] != splitter)
					merge(a[i], a[j]);
			}

		for (int i = 0; i < n; i++)
			for (int j = i + 1; j < n; j++)
			{
				if (p[a[i]][a[j]] == splitter && componentId[a[i]] == componentId[a[j]])
					return vector<set<int>>{};
			}

		components.erase(remove_if(components.begin(), components.end(), [](const set<int> &x)
								   { return x.size() == 0; }),
						 components.end());

		return components;
	};

	auto components = split(all, 0);

	if (components.size() == 0)
		return 0;

	for (auto component : components)
	{
		if (component.size() == 0)
			continue;

		vector<int> all_in_comp(component.begin(), component.end());

		auto sub_components = vector<set<int>>();//split(all_in_comp, 2);

		for (int x : component)
			sub_components.push_back({x});

		if (sub_components.size() == 0 || sub_components.size() == 2)
			return 0;

		int prev_root = -1;
		int first_root = -1;
		for (auto sub_component : sub_components)
		{
			if (sub_component.size() == 0)
				continue;

			int prev = -1;
			for (auto x : sub_component)
			{
				if (prev != -1)
					answer[x][prev] = answer[prev][x] = 1;
				prev = x;
			}
			int x = *sub_component.begin();
			if (prev_root != -1)
				answer[x][prev_root] = answer[prev_root][x] = 1;
			else
				first_root = x;
			prev_root = x;
		}
		if (first_root != -1 && first_root != prev_root)
			answer[first_root][prev_root] = answer[prev_root][first_root] = 1;
	}

	build(answer);
	return 1;
}

#ifdef _DEBUG

#include <vector>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <string>

static int n;
static std::vector<std::vector<int>> p;
static std::vector<std::vector<int>> b;
static bool called = false;

static void check(bool cond, std::string message)
{
	if (!cond)
	{
		printf("%s\n", message.c_str());
		fclose(stdout);
		exit(0);
	}
}

void build(std::vector<std::vector<int>> _b)
{
	check(!called, "build is called more than once");
	called = true;
	check((int)_b.size() == n, "Invalid number of rows in b");
	for (int i = 0; i < n; i++)
	{
		check((int)_b[i].size() == n, "Invalid number of columns in b");
	}
	b = _b;
}

int main()
{
	assert(scanf("%d", &n) == 1);

	p.resize(n);
	for (int i = 0; i < n; i++)
	{
		p[i].resize(n);
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			assert(scanf("%d", &p[i][j]) == 1);
		}
	}
	fclose(stdin);

	int possible = construct(p);

	check(possible == 0 || possible == 1, "Invalid return value of construct");
	if (possible == 1)
	{
		check(called, "construct returned 1 without calling build");
	}
	else
	{
		check(!called, "construct called build but returned 0");
	}

	printf("%d\n", possible);
	if (possible == 1)
	{
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				if (j)
				{
					printf(" ");
				}
				printf("%d", b[i][j]);
			}
			printf("\n");
		}
	}
	fclose(stdout);
}

#endif

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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
19.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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1204 KB Output is correct
9 Correct 171 ms 22080 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 177 ms 22104 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 81 ms 12284 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 43 ms 5744 KB Output is correct
22 Correct 172 ms 22164 KB Output is correct
23 Correct 168 ms 22160 KB Output is correct
24 Correct 179 ms 22204 KB Output is correct
25 Correct 86 ms 12164 KB Output is correct
26 Correct 65 ms 12288 KB Output is correct
27 Correct 172 ms 22140 KB Output is correct
28 Correct 185 ms 22136 KB Output is correct
29 Correct 85 ms 12260 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 -