답안 #303171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303171 2020-09-20T00:09:35 Z tutis 식물 비교 (IOI20_plants) C++17
32 / 100
4000 ms 660700 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 = 0; i < n; i++)
		B[i].insert(i);
	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);
		}
	}
}

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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 8 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 70 ms 12512 KB Output is correct
7 Correct 88 ms 12792 KB Output is correct
8 Correct 115 ms 15224 KB Output is correct
9 Correct 113 ms 15224 KB Output is correct
10 Correct 114 ms 15224 KB Output is correct
11 Correct 124 ms 15224 KB Output is correct
12 Correct 118 ms 15224 KB Output is correct
13 Correct 117 ms 15224 KB Output is correct
14 Correct 114 ms 15212 KB Output is correct
# 결과 실행 시간 메모리 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 7 ms 9728 KB Output is correct
5 Correct 7 ms 9732 KB Output is correct
6 Correct 12 ms 9856 KB Output is correct
7 Correct 98 ms 13304 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 15 ms 9856 KB Output is correct
10 Correct 98 ms 13304 KB Output is correct
11 Correct 92 ms 13176 KB Output is correct
12 Correct 93 ms 13304 KB Output is correct
13 Correct 95 ms 13304 KB Output is correct
# 결과 실행 시간 메모리 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 7 ms 9728 KB Output is correct
5 Correct 7 ms 9732 KB Output is correct
6 Correct 12 ms 9856 KB Output is correct
7 Correct 98 ms 13304 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 15 ms 9856 KB Output is correct
10 Correct 98 ms 13304 KB Output is correct
11 Correct 92 ms 13176 KB Output is correct
12 Correct 93 ms 13304 KB Output is correct
13 Correct 95 ms 13304 KB Output is correct
14 Correct 183 ms 15272 KB Output is correct
15 Correct 1650 ms 39660 KB Output is correct
16 Correct 183 ms 15356 KB Output is correct
17 Correct 1622 ms 39528 KB Output is correct
18 Correct 1075 ms 39560 KB Output is correct
19 Correct 1065 ms 39544 KB Output is correct
20 Correct 1334 ms 39416 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 1581 ms 125688 KB Output is correct
4 Execution timed out 4107 ms 660700 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 8 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Incorrect 8 ms 9728 KB Output isn't correct
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 8 ms 9728 KB Output is correct
4 Incorrect 7 ms 9728 KB Output isn't correct
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 8 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 70 ms 12512 KB Output is correct
7 Correct 88 ms 12792 KB Output is correct
8 Correct 115 ms 15224 KB Output is correct
9 Correct 113 ms 15224 KB Output is correct
10 Correct 114 ms 15224 KB Output is correct
11 Correct 124 ms 15224 KB Output is correct
12 Correct 118 ms 15224 KB Output is correct
13 Correct 117 ms 15224 KB Output is correct
14 Correct 114 ms 15212 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 7 ms 9728 KB Output is correct
19 Correct 7 ms 9732 KB Output is correct
20 Correct 12 ms 9856 KB Output is correct
21 Correct 98 ms 13304 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 15 ms 9856 KB Output is correct
24 Correct 98 ms 13304 KB Output is correct
25 Correct 92 ms 13176 KB Output is correct
26 Correct 93 ms 13304 KB Output is correct
27 Correct 95 ms 13304 KB Output is correct
28 Correct 183 ms 15272 KB Output is correct
29 Correct 1650 ms 39660 KB Output is correct
30 Correct 183 ms 15356 KB Output is correct
31 Correct 1622 ms 39528 KB Output is correct
32 Correct 1075 ms 39560 KB Output is correct
33 Correct 1065 ms 39544 KB Output is correct
34 Correct 1334 ms 39416 KB Output is correct
35 Correct 7 ms 9728 KB Output is correct
36 Correct 7 ms 9728 KB Output is correct
37 Correct 1581 ms 125688 KB Output is correct
38 Execution timed out 4107 ms 660700 KB Time limit exceeded
39 Halted 0 ms 0 KB -