oj.uz

답안 #303173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303173 2020-09-20T00:11:24 Z tutis 식물 비교 (IOI20_plants) C++17
32 / 100
 1595 ms 39548 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>k0, k1;
int K, n;
vector<int>A;
struct ST
{
	int l, r;
	pair<int, int> mn;
	pair<int, int> mn1;
	int del = 0;
	int del1 = 0;
	ST *left, *right;
	ST(int l, int r, vector<int>&a): l(l), r(r)
	{
		if (l < r)
		{
			left = new ST(l, (l + r) / 2, a);
			right = new ST((l + r) / 2 + 1, r, a);
			mn = min(left->mn, right->mn);
		}
		else
			mn = {a[l], l};
		mn1 = mn;
	}
	void fix()
	{
		if (l == r)
		{
			mn.first += del;
			del = 0;
		}
		else
		{
			mn.first += del;
			left->del += del;
			right->del += del;
			del = 0;
		}
	}
	void fix1()
	{
		if (l == r)
		{
			mn1.first += del1;
			del1 = 0;
		}
		else
		{
			mn1.first += del1;
			left->del1 += del1;
			right->del1 += del1;
			del1 = 0;
		}
	}
	void add(int x, int y, int w)
	{
		if (x <= l && r <= y)
		{
			del += w;
			return fix();
		}
		fix();
		if (r < x || y < l)
			return;
		left->add(x, y, w);
		right->add(x, y, w);
		mn = min(left->mn, right->mn);
	}
	void add1(int x, int y, int w)
	{
		if (x <= l && r <= y)
		{
			del1 += w;
			return fix1();
		}
		fix1();
		if (r < x || y < l)
			return;
		left->add1(x, y, w);
		right->add1(x, y, w);
		mn1 = min(left->mn1, right->mn1);
	}
};
set<int>B[200000];
int id[200000];
void init(int k, vector<int> r)
{
	K = k;
	n = r.size();
	if (k == 2)
	{
		k0 = k1 = vector<int>(n, 0);
		for (int t = 0; t < 2; t++)
			for (int i = n - 1; i >= 0; i--)
			{
				if (r[i] == 0)
					k0[i] = 1 + k0[(i + 1) % n];
				else
					k1[i] = 1 + k1[(i + 1) % n];
			}
		return;
	}
	if (2 * k > n)
	{
		ST medis(0, n - 1, r);
		auto add = [&](int x, int y, int w)
		{
			while (y >= n)
			{
				x -= n;
				y -= n;
			}
			while (x < 0)
			{
				x += n;
				y += n;
			}
			if (y < n)
			{
				medis.add(x, y, w);
			}
			else
			{
				medis.add(x, n - 1, w);
				medis.add(0, y - n, w);
			}
		};
		auto add1 = [&](int x, int y, int w)
		{
			while (y >= n)
			{
				x -= n;
				y -= n;
			}
			while (x < 0)
			{
				x += n;
				y += n;
			}
			if (y < n)
			{
				medis.add1(x, y, w);
			}
			else
			{
				medis.add1(x, n - 1, w);
				medis.add1(0, y - n, w);
			}
		};
		while (medis.mn1.first == 0)
		{
			int i = medis.mn1.second;
			add(i + 1, i + (k - 1), 1);
			add1(i, i, 1);
		}
		A = vector<int>(n, -1);
		for (int tt = 0; tt < n; tt++)
		{
			while (medis.mn1.first == 0)
			{
				int i = medis.mn1.second;
				add(i + 1, i + (k - 1), 1);
				add1(i, i, 1);
			}
			int i = medis.mn.second;
			add(i + 1, i + (k - 1), -1);
			add(i - (k - 1), i - 1, -1);
			add1(i - (k - 1), i - 1, -1);
			A[i] = tt;
			add(i, i, n + 10000);
			add1(i, i, n + 10000);
			r[i] = n + 100;
		}
		return;
	}
	ST medis(0, n - 1, r);
	auto add = [&](int x, int y, int w)
	{
		while (y >= n)
		{
			x -= n;
			y -= n;
		}
		while (x < 0)
		{
			x += n;
			y += n;
		}
		if (y < n)
		{
			medis.add(x, y, w);
		}
		else
		{
			medis.add(x, n - 1, w);
			medis.add(0, y - n, w);
		}
	};
	auto add1 = [&](int x, int y, int w)
	{
		while (y >= n)
		{
			x -= n;
			y -= n;
		}
		while (x < 0)
		{
			x += n;
			y += n;
		}
		if (y < n)
		{
			medis.add1(x, y, w);
		}
		else
		{
			medis.add1(x, n - 1, w);
			medis.add1(0, y - n, w);
		}
	};
	while (medis.mn1.first == 0)
	{
		int i = medis.mn1.second;
		add(i + 1, i + (k - 1), 1);
		add1(i, i, 1);
	}
	vector<int>K;
	for (int tt = 0; tt < n; tt++)
	{
		while (medis.mn1.first == 0)
		{
			int i = medis.mn1.second;
			add(i + 1, i + (k - 1), 1);
			add1(i, i, 1);
		}
		int i = medis.mn.second;
		add(i + 1, i + (k - 1), -1);
		add(i - (k - 1), i - 1, -1);
		add1(i - (k - 1), i - 1, -1);
		add(i, i, n + 10000);
		add1(i, i, n + 10000);
		K.push_back(i);
		r[i] = n + 100;
	}
	reverse(K.begin(), K.end());
	int timer = 0;
	for (int i : K)
	{
		id[i] = timer++;
		for (int j = i - (k - 1); j <= i + (k - 1); j++)
		{
			int jj = j;
			if (jj < 0)
				jj += n;
			if (jj >= n)
				jj -= n;
			if (jj != i)
				for (int k : B[jj])
					B[i].insert(k);
		}
		B[i].insert(i);
	}
}

int compare_plants(int x, int y)
{
	assert(x < y);
	if (K == 2)
	{
		if (k0[x] >= y - x)
			return 1;
		if (k1[x] >= y - x)
			return -1;
		if (k0[y] >= n - y + x)
			return -1;
		if (k1[y] >= n - y + x)
			return 1;
		return 0;
	}
	if (!A.empty())
	{
		if (A[x] < A[y])
			return 1;
		else
			return -1;
	}
	if (id[x] > id[y] && B[x].count(y))
		return -1;
	if (id[x] < id[y] && B[y].count(x))
		return 1;
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 6 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 67 ms 12512 KB Output is correct
7 Correct 87 ms 12920 KB Output is correct
8 Correct 109 ms 15224 KB Output is correct
9 Correct 112 ms 15224 KB Output is correct
10 Correct 108 ms 15224 KB Output is correct
11 Correct 114 ms 15352 KB Output is correct
12 Correct 108 ms 15224 KB Output is correct
13 Correct 104 ms 15224 KB Output is correct
14 Correct 105 ms 15228 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 12 ms 9856 KB Output is correct
7 Correct 93 ms 13304 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 11 ms 9856 KB Output is correct
10 Correct 97 ms 13432 KB Output is correct
11 Correct 94 ms 13316 KB Output is correct
12 Correct 95 ms 13304 KB Output is correct
13 Correct 97 ms 13308 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 12 ms 9856 KB Output is correct
7 Correct 93 ms 13304 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 11 ms 9856 KB Output is correct
10 Correct 97 ms 13432 KB Output is correct
11 Correct 94 ms 13316 KB Output is correct
12 Correct 95 ms 13304 KB Output is correct
13 Correct 97 ms 13308 KB Output is correct
14 Correct 186 ms 15372 KB Output is correct
15 Correct 1595 ms 39544 KB Output is correct
16 Correct 176 ms 15352 KB Output is correct
17 Correct 1586 ms 39544 KB Output is correct
18 Correct 1063 ms 39544 KB Output is correct
19 Correct 1056 ms 39548 KB Output is correct
20 Correct 1345 ms 39544 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Incorrect 7 ms 9728 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Incorrect 7 ms 9728 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9652 KB Output is correct
3 Correct 7 ms 9760 KB Output is correct
4 Incorrect 7 ms 9728 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 6 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 6 ms 9728 KB Output is correct
6 Correct 67 ms 12512 KB Output is correct
7 Correct 87 ms 12920 KB Output is correct
8 Correct 109 ms 15224 KB Output is correct
9 Correct 112 ms 15224 KB Output is correct
10 Correct 108 ms 15224 KB Output is correct
11 Correct 114 ms 15352 KB Output is correct
12 Correct 108 ms 15224 KB Output is correct
13 Correct 104 ms 15224 KB Output is correct
14 Correct 105 ms 15228 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 7 ms 9728 KB Output is correct
17 Correct 7 ms 9728 KB Output is correct
18 Correct 6 ms 9728 KB Output is correct
19 Correct 7 ms 9728 KB Output is correct
20 Correct 12 ms 9856 KB Output is correct
21 Correct 93 ms 13304 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 11 ms 9856 KB Output is correct
24 Correct 97 ms 13432 KB Output is correct
25 Correct 94 ms 13316 KB Output is correct
26 Correct 95 ms 13304 KB Output is correct
27 Correct 97 ms 13308 KB Output is correct
28 Correct 186 ms 15372 KB Output is correct
29 Correct 1595 ms 39544 KB Output is correct
30 Correct 176 ms 15352 KB Output is correct
31 Correct 1586 ms 39544 KB Output is correct
32 Correct 1063 ms 39544 KB Output is correct
33 Correct 1056 ms 39548 KB Output is correct
34 Correct 1345 ms 39544 KB Output is correct
35 Correct 7 ms 9728 KB Output is correct
36 Incorrect 7 ms 9728 KB Output isn't correct
37 Halted 0 ms 0 KB -