oj.uz

Submission #146302

# Submission time Handle Problem Language Result Execution time Memory
146302 2019-08-23T11:28:46 Z jwvg0425 Split the Attractions (IOI19_split) C++17
40 / 100
 183 ms 22780 KB 
#include "split.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

vector<int> edge[100005];
vector<int> treeEdge[100005];
bool visited[100005];
int cent;
int val[100005];
int csize[100005];
int treeNum[100005];
int parent[100005];
int treeSize[100005];
int compSize[100005];
bool usingTree[100005];
int usingSize;

void span(int root)
{
	visited[root] = true;

	for (auto& e : edge[root])
	{
		if (visited[e])
			continue;

		treeEdge[root].push_back(e);
		treeEdge[e].push_back(root);

		span(e);
	}
}

int findCent(int root, int n)
{
	csize[root] = 1;

	bool isCent = true;

	for (auto& e : treeEdge[root])
	{
		if (e == parent[root])
			continue;

		parent[e] = root;
		int c = findCent(e, n);

		if (c != -1)
			return c;

		csize[root] += csize[e];

		isCent = isCent && (csize[e] <= n / 2);
	}

	if (isCent && n - csize[root] <= n / 2)
		return root;

	return -1;
}

void numbering(int root, int k)
{
	treeNum[root] = k;

	for (auto& e : treeEdge[root])
	{
		if (treeNum[e] != 0 || e == cent)
			continue;

		numbering(e, k);
	}
}

int comp(int root)
{
	int res = 0;
	if (!usingTree[treeNum[root]])
	{
		res += treeSize[treeNum[root]];
		usingTree[treeNum[root]] = true;
	}
	visited[root] = true;

	for (auto& e : edge[root])
	{
		if (visited[e] || e == cent)
			continue;

		res += comp(e);
	}

	return res;
}

void findTree(int root, int sz)
{
	if (usingSize >= sz)
		return;

	if (!usingTree[treeNum[root]])
	{
		usingSize += treeSize[treeNum[root]];
		usingTree[treeNum[root]] = true;
	}
	visited[root] = true;

	for (auto& e : edge[root])
	{
		if (visited[e] || e == cent)
			continue;

		findTree(e, sz);
	}
}

void mark(int root, int v, int& sz)
{
	if (sz == 0)
		return;

	val[root] = v;
	sz--;

	for (auto& e : edge[root])
	{
		if (val[e] != 0 || !usingTree[treeNum[e]])
			continue;

		mark(e, v, sz);
	}
}

void mark2(int root, int v, int& sz)
{
	if (sz == 0)
		return;

	val[root] = v;
	sz--;

	for (auto& e : edge[root])
	{
		if (val[e] != 0)
			continue;

		mark2(e, v, sz);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
	vector<ii> v = { { a, 1 }, { b, 2 }, { c, 3 } };

	for (int i = 0; i < p.size(); i++)
	{
		edge[p[i]].push_back(q[i]);
		edge[q[i]].push_back(p[i]);
	}

	span(0);

	sort(all(v));

	cent = findCent(0, n);

	// centroid 제외한 그래프에서 a이상의 크기인 트리가 있는지 확인, 있으면 go
	int tr = 1;
	for (auto& e : edge[cent])
	{
		numbering(e, tr);
		tr++;
	}

	for (int i = 0; i < n; i++)
		treeSize[treeNum[i]]++;

	for (int i = 1; i < tr; i++)
	{
		if (treeSize[i] < v[0].xx)
			continue;

		int e = -1;

		for (auto& ei : edge[cent])
		{
			if (treeNum[ei] == i)
				e = ei;
		}

		//이 경우, 얘 하나만 써도 OK
		usingTree[i] = true;
		mark(e, v[0].yy, v[0].xx);
		mark2(cent, v[1].yy, v[1].xx);

		assert(v[1].xx == 0);

		for (int j = 0; j < n; j++)
			if (val[j] == 0)
				val[j] = v[2].yy;

		vector<int> result(n);
		for (int j = 0; j < n; j++)
			result[j] = val[j];

		return result;
	}

	memset(visited, false, sizeof(visited));
	for (auto& e : edge[cent])
	{
		int c = comp(e);

		if (c < v[0].xx)
			continue;

		// 합해서 a이상 되는 트리 확인 후, 그 트리에 속하는 원소들만 이용해서 a개수 만든다
		memset(visited, false, sizeof(visited));
		memset(usingTree, false, sizeof(usingTree));
		findTree(e, v[0].xx);

		mark(e, v[0].yy, v[0].xx);
		mark2(cent, v[1].yy, v[1].xx);

		for (int i = 0; i < n; i++)
			if (val[i] == 0)
				val[i] = v[2].yy;

		break;
	}

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

	return result;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:178:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < p.size(); i++)
                  ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 156 ms 22620 KB ok, correct split
8 Correct 149 ms 20088 KB ok, correct split
9 Correct 152 ms 19320 KB ok, correct split
10 Correct 172 ms 22732 KB ok, correct split
11 Correct 155 ms 22780 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB ok, correct split
2 Correct 6 ms 4984 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 156 ms 19576 KB ok, correct split
5 Correct 122 ms 15096 KB ok, correct split
6 Correct 143 ms 22740 KB ok, correct split
7 Correct 148 ms 19960 KB ok, correct split
8 Correct 183 ms 16888 KB ok, correct split
9 Correct 146 ms 14968 KB ok, correct split
10 Correct 95 ms 16112 KB ok, correct split
11 Correct 103 ms 16112 KB ok, correct split
12 Correct 95 ms 16084 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB ok, correct split
2 Correct 139 ms 15080 KB ok, correct split
3 Correct 46 ms 9080 KB ok, correct split
4 Correct 6 ms 4984 KB ok, correct split
5 Correct 152 ms 17556 KB ok, correct split
6 Correct 149 ms 17400 KB ok, correct split
7 Correct 150 ms 17144 KB ok, correct split
8 Correct 142 ms 18476 KB ok, correct split
9 Correct 145 ms 16860 KB ok, correct split
10 Correct 39 ms 8312 KB ok, no valid answer
11 Correct 57 ms 9976 KB ok, no valid answer
12 Correct 109 ms 15480 KB ok, no valid answer
13 Correct 132 ms 14840 KB ok, no valid answer
14 Correct 105 ms 15836 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB ok, correct split
2 Correct 7 ms 5112 KB ok, no valid answer
3 Correct 22 ms 4984 KB ok, correct split
4 Correct 7 ms 4984 KB ok, correct split
5 Correct 12 ms 5368 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 6 ms 4984 KB ok, correct split
8 Correct 6 ms 4984 KB ok, correct split
9 Correct 9 ms 5368 KB ok, correct split
10 Correct 9 ms 5368 KB ok, correct split
11 Correct 6 ms 5112 KB ok, correct split
12 Incorrect 9 ms 5368 KB invalid split: #1=405, #2=1196, #3=800
13 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 6 ms 5112 KB ok, correct split
3 Correct 6 ms 5112 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 6 ms 5112 KB ok, correct split
7 Correct 156 ms 22620 KB ok, correct split
8 Correct 149 ms 20088 KB ok, correct split
9 Correct 152 ms 19320 KB ok, correct split
10 Correct 172 ms 22732 KB ok, correct split
11 Correct 155 ms 22780 KB ok, correct split
12 Correct 6 ms 4984 KB ok, correct split
13 Correct 6 ms 4984 KB ok, correct split
14 Correct 6 ms 5112 KB ok, correct split
15 Correct 156 ms 19576 KB ok, correct split
16 Correct 122 ms 15096 KB ok, correct split
17 Correct 143 ms 22740 KB ok, correct split
18 Correct 148 ms 19960 KB ok, correct split
19 Correct 183 ms 16888 KB ok, correct split
20 Correct 146 ms 14968 KB ok, correct split
21 Correct 95 ms 16112 KB ok, correct split
22 Correct 103 ms 16112 KB ok, correct split
23 Correct 95 ms 16084 KB ok, correct split
24 Correct 6 ms 4984 KB ok, correct split
25 Correct 139 ms 15080 KB ok, correct split
26 Correct 46 ms 9080 KB ok, correct split
27 Correct 6 ms 4984 KB ok, correct split
28 Correct 152 ms 17556 KB ok, correct split
29 Correct 149 ms 17400 KB ok, correct split
30 Correct 150 ms 17144 KB ok, correct split
31 Correct 142 ms 18476 KB ok, correct split
32 Correct 145 ms 16860 KB ok, correct split
33 Correct 39 ms 8312 KB ok, no valid answer
34 Correct 57 ms 9976 KB ok, no valid answer
35 Correct 109 ms 15480 KB ok, no valid answer
36 Correct 132 ms 14840 KB ok, no valid answer
37 Correct 105 ms 15836 KB ok, no valid answer
38 Correct 6 ms 4984 KB ok, correct split
39 Correct 7 ms 5112 KB ok, no valid answer
40 Correct 22 ms 4984 KB ok, correct split
41 Correct 7 ms 4984 KB ok, correct split
42 Correct 12 ms 5368 KB ok, correct split
43 Correct 6 ms 5112 KB ok, correct split
44 Correct 6 ms 4984 KB ok, correct split
45 Correct 6 ms 4984 KB ok, correct split
46 Correct 9 ms 5368 KB ok, correct split
47 Correct 9 ms 5368 KB ok, correct split
48 Correct 6 ms 5112 KB ok, correct split
49 Incorrect 9 ms 5368 KB invalid split: #1=405, #2=1196, #3=800
50 Halted 0 ms 0 KB -