oj.uz

답안 #240638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240638 2020-06-20T10:41:02 Z faremy 건물 4 (JOI20_building4) C++14
100 / 100
 498 ms 71944 KB 
#include <iostream>
#include <algorithm>
#include <vector>


const int MAXN = 1e6 + 2;
const int INFTY = 2e9;

int plan[2][MAXN];
int color[MAXN];

struct Ans {
	Ans() : size(-INFTY), pos(-1), prev(-1) {}
	Ans(int s, int p, int pr) : size(s), pos(p), prev(pr) {};

	int size, pos, prev;
	bool operator >(const Ans &other) const
	{
		return (size > other.size);
	}
} lis[2][MAXN];


std::vector<int> findlis(int size)
{
	std::fill_n((Ans *)lis, 2 * MAXN, Ans());
	lis[0][0] = Ans(0, 0, -1);

	for (int iPos = 1; iPos <= size; iPos++)
	{
		Ans b0 = lis[0][iPos - 1];
		Ans b1 = lis[1][iPos - 1];

		if (plan[0][iPos - 1] <= plan[1][iPos] && b0 > lis[1][iPos])
			lis[1][iPos] = b0;
		if (plan[1][iPos - 1] <= plan[1][iPos] && b1 > lis[1][iPos])
			lis[1][iPos] = b1;

		b0.size++; b1.size++;
		b0.prev = b0.pos;
		b1.prev = b1.pos;
		b0.pos = b1.pos = iPos;

		if (plan[0][iPos - 1] <= plan[0][iPos] && b0 > lis[0][iPos])
			lis[0][iPos] = b0;
		if (plan[1][iPos - 1] <= plan[0][iPos] && b1 > lis[0][iPos])
			lis[0][iPos] = b1;
	}

	std::vector<int> seq;
	int pos = size;

	while (pos != -1)
	{
		seq.emplace_back(pos);
		pos = lis[0][pos].prev;
	}

	if (seq.back() != 0)
		return {};
	std::vector<int> choice;

	pos = 0;
	while (seq.size() > 1)
	{
		choice.emplace_back(0);
		seq.pop_back();

		for (pos++; pos < seq.back(); pos++)
			choice.emplace_back(1);
	}

	choice.emplace_back(0);
	return choice;
}

int cnt0(std::vector<int> vec)
{
	int c = 0;
	for (int i : vec)
		c += (i == 0);
	return c - 2;
}

int main()
{
	std::ios::sync_with_stdio(false);
	std::cout.tie(nullptr);
	std::cin.tie(nullptr);

	int half; std::cin >> half;
	int build = half * 2;

	for (int iPlan = 0; iPlan < 2; iPlan++)
	{
		plan[iPlan][build + 1] = INFTY;
		for (int iBuild = 1; iBuild <= build; iBuild++)
			std::cin >> plan[iPlan][iBuild];
	}

	std::vector<int> choiceA = findlis(build + 1);
	for (int iBuild = 1; iBuild <= build; iBuild++)
		std::swap(plan[0][iBuild], plan[1][iBuild]);
	std::vector<int> choiceB = findlis(build + 1);

	if (choiceA.empty() || choiceB.empty())
	{
		std::cout << "-1\n";
		return 0;
	}

	for (int &choose : choiceB)
		choose ^= 1;
	choiceB[0] = choiceB[build + 1] = 0;

	int maxA = cnt0(choiceA);
	int minA = cnt0(choiceB);

	if (maxA < half || minA > half)
	{
		std::cout << "-1\n";
		return 0;
	}

	std::vector<int> eq;
	for (int iPos = 0; iPos < build + 2; iPos++)
		if (choiceA[iPos] == choiceB[iPos])
			eq.emplace_back(iPos);

	for (int iSpl = 0; maxA > half; iSpl++)
	{
		int chg = 0;
		for (int iPos = eq[iSpl] + 1; iPos < eq[iSpl + 1]; iPos++)
			chg += choiceA[iPos] - choiceB[iPos];
	
		if (maxA + chg >= half)
		{
			maxA += chg;
			for (int iPos = eq[iSpl] + 1; iPos < eq[iSpl + 1]; iPos++)
				choiceA[iPos] ^= 1;
			continue;
		}

		for (int iPos = eq[iSpl] + 1; iPos < eq[iSpl + 1]; iPos++)
			color[iPos] = (plan[choiceA[iPos]][iPos] < plan[choiceB[iPos]][iPos]);
		for (int iPos = eq[iSpl] + 1; iPos < eq[iSpl + 1] && maxA > half; iPos++)
			if (color[iPos] == 1)
			{
				maxA += choiceA[iPos] - choiceB[iPos];
				choiceA[iPos] ^= 1;
			}

		for (int iPos = eq[iSpl + 1] - 1; iPos > eq[iSpl] && maxA > half; iPos--)
			if (color[iPos] == 0)
			{
				maxA += choiceA[iPos] - choiceB[iPos];
				choiceA[iPos] ^= 1;
			}
	}

	for (int iPos = 1; iPos <= build; iPos++)
		std::cout << (char)('A' + choiceA[iPos]);
	std::cout << '\n';

	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23808 KB Output is correct
2 Correct 24 ms 23808 KB Output is correct
3 Correct 24 ms 23808 KB Output is correct
4 Correct 26 ms 23808 KB Output is correct
5 Correct 25 ms 23936 KB Output is correct
6 Correct 25 ms 24064 KB Output is correct
7 Correct 27 ms 24064 KB Output is correct
8 Correct 26 ms 24056 KB Output is correct
9 Correct 25 ms 24064 KB Output is correct
10 Correct 26 ms 24064 KB Output is correct
11 Correct 28 ms 24064 KB Output is correct
12 Correct 26 ms 24056 KB Output is correct
13 Correct 26 ms 24064 KB Output is correct
14 Correct 27 ms 24064 KB Output is correct
15 Correct 25 ms 24064 KB Output is correct
16 Correct 29 ms 24064 KB Output is correct
17 Correct 25 ms 24064 KB Output is correct
18 Correct 26 ms 24064 KB Output is correct
19 Correct 25 ms 24064 KB Output is correct
20 Correct 24 ms 23936 KB Output is correct
21 Correct 24 ms 23936 KB Output is correct
22 Correct 25 ms 23936 KB Output is correct
23 Correct 24 ms 23936 KB Output is correct
24 Correct 26 ms 24064 KB Output is correct
25 Correct 25 ms 23936 KB Output is correct
26 Correct 25 ms 23936 KB Output is correct
27 Correct 24 ms 23936 KB Output is correct
28 Correct 25 ms 23936 KB Output is correct
29 Correct 27 ms 23936 KB Output is correct
30 Correct 24 ms 23936 KB Output is correct
31 Correct 25 ms 23936 KB Output is correct
32 Correct 24 ms 23936 KB Output is correct
33 Correct 25 ms 23936 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23808 KB Output is correct
2 Correct 24 ms 23808 KB Output is correct
3 Correct 24 ms 23808 KB Output is correct
4 Correct 26 ms 23808 KB Output is correct
5 Correct 25 ms 23936 KB Output is correct
6 Correct 25 ms 24064 KB Output is correct
7 Correct 27 ms 24064 KB Output is correct
8 Correct 26 ms 24056 KB Output is correct
9 Correct 25 ms 24064 KB Output is correct
10 Correct 26 ms 24064 KB Output is correct
11 Correct 28 ms 24064 KB Output is correct
12 Correct 26 ms 24056 KB Output is correct
13 Correct 26 ms 24064 KB Output is correct
14 Correct 27 ms 24064 KB Output is correct
15 Correct 25 ms 24064 KB Output is correct
16 Correct 29 ms 24064 KB Output is correct
17 Correct 25 ms 24064 KB Output is correct
18 Correct 26 ms 24064 KB Output is correct
19 Correct 25 ms 24064 KB Output is correct
20 Correct 24 ms 23936 KB Output is correct
21 Correct 24 ms 23936 KB Output is correct
22 Correct 25 ms 23936 KB Output is correct
23 Correct 24 ms 23936 KB Output is correct
24 Correct 26 ms 24064 KB Output is correct
25 Correct 25 ms 23936 KB Output is correct
26 Correct 25 ms 23936 KB Output is correct
27 Correct 24 ms 23936 KB Output is correct
28 Correct 25 ms 23936 KB Output is correct
29 Correct 27 ms 23936 KB Output is correct
30 Correct 24 ms 23936 KB Output is correct
31 Correct 25 ms 23936 KB Output is correct
32 Correct 24 ms 23936 KB Output is correct
33 Correct 25 ms 23936 KB Output is correct
34 Correct 337 ms 31664 KB Output is correct
35 Correct 388 ms 64880 KB Output is correct
36 Correct 377 ms 64360 KB Output is correct
37 Correct 393 ms 65084 KB Output is correct
38 Correct 355 ms 65196 KB Output is correct
39 Correct 368 ms 61744 KB Output is correct
40 Correct 396 ms 65816 KB Output is correct
41 Correct 363 ms 69068 KB Output is correct
42 Correct 387 ms 66512 KB Output is correct
43 Correct 411 ms 67900 KB Output is correct
44 Correct 413 ms 67836 KB Output is correct
45 Correct 428 ms 67896 KB Output is correct
46 Correct 395 ms 71696 KB Output is correct
47 Correct 386 ms 64060 KB Output is correct
48 Correct 400 ms 63920 KB Output is correct
49 Correct 498 ms 66916 KB Output is correct
50 Correct 416 ms 67048 KB Output is correct
51 Correct 406 ms 67132 KB Output is correct
52 Correct 279 ms 56116 KB Output is correct
53 Correct 281 ms 56116 KB Output is correct
54 Correct 250 ms 56252 KB Output is correct
55 Correct 249 ms 55996 KB Output is correct
56 Correct 394 ms 71944 KB Output is correct
57 Correct 361 ms 61964 KB Output is correct
58 Correct 358 ms 62224 KB Output is correct
59 Correct 364 ms 66956 KB Output is correct
60 Correct 338 ms 62680 KB Output is correct
61 Correct 351 ms 64836 KB Output is correct
62 Correct 339 ms 64260 KB Output is correct
63 Correct 347 ms 64600 KB Output is correct
64 Correct 329 ms 63420 KB Output is correct
65 Correct 356 ms 64644 KB Output is correct