oj.uz

Submission #146248

# Submission time Handle Problem Language Result Execution time Memory
146248 2019-08-23T06:05:55 Z jwvg0425 Split the Attractions (IOI19_split) C++17
40 / 100
 267 ms 22776 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 treeSize[100005];
int treeNum[100005];
int parent[100005];

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

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

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

		dfs(e);
	}
}

int findCent(int root, int n)
{
	treeSize[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;

		treeSize[root] += treeSize[e];

		isCent = isCent && (treeSize[e] < (n + 1) / 2);
	}

	if (isCent && treeSize[root] >= (n + 1) / 2)
		return root;

	return -1;
}

void numbering(int root, int k)
{
	treeNum[root] = k;
	for (auto& e : edge[root])
	{
		if (treeNum[e] != 0)
			continue;

		numbering(e, k);
	}
}

int comp(int root)
{
	// cent 방향 안 가면서 크기 계산, 트리 번호도 붙여준다
	int res = 1;
	visited[root] = true;

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

		res += comp(e);
	}

	return res;
}

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

	val[root] = v;
	c--;

	// 같은 트리 우선으로 순회
	for (auto& e : edge[root])
	{
		if (val[e] != 0 || treeNum[v] != treeNum[root])
			continue;

		mark(e, v, c);
	}

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

		mark(e, v, c);
	}
}

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]);
	}

	dfs(0);

	sort(all(v));

	cent = findCent(0, n);

	// centroid 제외한 그래프에서 a이상의 크기인 트리가 있는지 확인, 있으면 go
	memset(visited, false, sizeof(visited));

	int tr = 1;
	for (auto& e : edge[cent])
	{
		numbering(e, tr);
		tr++;
	}

	for (auto& e : edge[cent])
	{
		int sz = comp(e);

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

		val[cent] = v[1].yy;
		mark(e, v[0].yy, v[0].xx);
		mark(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:140: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 5084 KB ok, correct split
2 Correct 6 ms 5116 KB ok, correct split
3 Correct 6 ms 5116 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 7 ms 5112 KB ok, correct split
7 Correct 181 ms 22480 KB ok, correct split
8 Correct 164 ms 20152 KB ok, correct split
9 Correct 162 ms 19452 KB ok, correct split
10 Correct 164 ms 22776 KB ok, correct split
11 Correct 189 ms 22648 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 7 ms 5160 KB ok, correct split
3 Correct 6 ms 5084 KB ok, correct split
4 Correct 267 ms 19560 KB ok, correct split
5 Correct 139 ms 15096 KB ok, correct split
6 Correct 167 ms 22648 KB ok, correct split
7 Correct 172 ms 19960 KB ok, correct split
8 Correct 206 ms 17032 KB ok, correct split
9 Correct 153 ms 14940 KB ok, correct split
10 Correct 100 ms 15728 KB ok, correct split
11 Correct 103 ms 15728 KB ok, correct split
12 Correct 101 ms 15768 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 5112 KB ok, correct split
2 Correct 148 ms 15156 KB ok, correct split
3 Correct 47 ms 9080 KB ok, correct split
4 Correct 7 ms 5112 KB ok, correct split
5 Correct 173 ms 17656 KB ok, correct split
6 Correct 168 ms 17272 KB ok, correct split
7 Correct 177 ms 17212 KB ok, correct split
8 Correct 167 ms 18424 KB ok, correct split
9 Correct 173 ms 17272 KB ok, correct split
10 Correct 41 ms 8312 KB ok, no valid answer
11 Correct 60 ms 9948 KB ok, no valid answer
12 Correct 121 ms 15092 KB ok, no valid answer
13 Correct 145 ms 14748 KB ok, no valid answer
14 Correct 104 ms 15344 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB ok, correct split
2 Correct 8 ms 5116 KB ok, no valid answer
3 Correct 7 ms 5164 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 Incorrect 7 ms 5112 KB invalid split: #1=4, #2=2, #3=6
8 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5084 KB ok, correct split
2 Correct 6 ms 5116 KB ok, correct split
3 Correct 6 ms 5116 KB ok, correct split
4 Correct 6 ms 5112 KB ok, correct split
5 Correct 6 ms 5112 KB ok, correct split
6 Correct 7 ms 5112 KB ok, correct split
7 Correct 181 ms 22480 KB ok, correct split
8 Correct 164 ms 20152 KB ok, correct split
9 Correct 162 ms 19452 KB ok, correct split
10 Correct 164 ms 22776 KB ok, correct split
11 Correct 189 ms 22648 KB ok, correct split
12 Correct 6 ms 5112 KB ok, correct split
13 Correct 7 ms 5160 KB ok, correct split
14 Correct 6 ms 5084 KB ok, correct split
15 Correct 267 ms 19560 KB ok, correct split
16 Correct 139 ms 15096 KB ok, correct split
17 Correct 167 ms 22648 KB ok, correct split
18 Correct 172 ms 19960 KB ok, correct split
19 Correct 206 ms 17032 KB ok, correct split
20 Correct 153 ms 14940 KB ok, correct split
21 Correct 100 ms 15728 KB ok, correct split
22 Correct 103 ms 15728 KB ok, correct split
23 Correct 101 ms 15768 KB ok, correct split
24 Correct 17 ms 5112 KB ok, correct split
25 Correct 148 ms 15156 KB ok, correct split
26 Correct 47 ms 9080 KB ok, correct split
27 Correct 7 ms 5112 KB ok, correct split
28 Correct 173 ms 17656 KB ok, correct split
29 Correct 168 ms 17272 KB ok, correct split
30 Correct 177 ms 17212 KB ok, correct split
31 Correct 167 ms 18424 KB ok, correct split
32 Correct 173 ms 17272 KB ok, correct split
33 Correct 41 ms 8312 KB ok, no valid answer
34 Correct 60 ms 9948 KB ok, no valid answer
35 Correct 121 ms 15092 KB ok, no valid answer
36 Correct 145 ms 14748 KB ok, no valid answer
37 Correct 104 ms 15344 KB ok, no valid answer
38 Correct 6 ms 5112 KB ok, correct split
39 Correct 8 ms 5116 KB ok, no valid answer
40 Correct 7 ms 5164 KB ok, correct split
41 Correct 6 ms 5112 KB ok, correct split
42 Correct 6 ms 5112 KB ok, correct split
43 Correct 6 ms 5112 KB ok, correct split
44 Incorrect 7 ms 5112 KB invalid split: #1=4, #2=2, #3=6
45 Halted 0 ms 0 KB -