oj.uz

Submission #303178

# Submission time Handle Problem Language Result Execution time Memory
303178 2020-09-20T00:20:41 Z tutis Comparing Plants (IOI20_plants) C++17
32 / 100
 1700 ms 39544 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;
	set<int>G;
	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);
		G.insert(i);
		auto ita = G.find(i);
		auto itb = G.find(i);
		int cnt = 1;
		if ((int)B[i].size() < (int)G.size())
		{
			while (true)
			{
				auto x = itb;
				auto y = ita;
				if (x == (--G.end()))
					x = G.begin();
				else
					x++;
				if (y == G.begin())
					y = --G.end();
				else
					y--;
				if (B[i].count(*x))
				{
					itb = x;
					cnt++;
				}
				else if (B[i].count(*y))
				{
					ita = y;
					cnt++;
				}
				else
					break;
			}
			assert((int)B[i].size() == cnt);
		}
	}
}

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

# Verdict Execution time Memory 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 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 71 ms 12536 KB Output is correct
7 Correct 89 ms 12792 KB Output is correct
8 Correct 123 ms 15224 KB Output is correct
9 Correct 118 ms 15224 KB Output is correct
10 Correct 117 ms 15224 KB Output is correct
11 Correct 118 ms 15224 KB Output is correct
12 Correct 122 ms 15224 KB Output is correct
13 Correct 111 ms 15480 KB Output is correct
14 Correct 118 ms 15228 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory 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 12 ms 9856 KB Output is correct
7 Correct 99 ms 13304 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 12 ms 9856 KB Output is correct
10 Correct 98 ms 13236 KB Output is correct
11 Correct 96 ms 13176 KB Output is correct
12 Correct 94 ms 13340 KB Output is correct
13 Correct 97 ms 13304 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory 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 12 ms 9856 KB Output is correct
7 Correct 99 ms 13304 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 12 ms 9856 KB Output is correct
10 Correct 98 ms 13236 KB Output is correct
11 Correct 96 ms 13176 KB Output is correct
12 Correct 94 ms 13340 KB Output is correct
13 Correct 97 ms 13304 KB Output is correct
14 Correct 189 ms 15372 KB Output is correct
15 Correct 1700 ms 39544 KB Output is correct
16 Correct 200 ms 15352 KB Output is correct
17 Correct 1654 ms 39416 KB Output is correct
18 Correct 1092 ms 39544 KB Output is correct
19 Correct 1073 ms 39544 KB Output is correct
20 Correct 1329 ms 39416 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Runtime error 86 ms 28664 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 7 ms 9760 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 7 ms 9728 KB Output is correct
5 Runtime error 20 ms 19456 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory 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 Runtime error 23 ms 19840 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory 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 7 ms 9728 KB Output is correct
5 Correct 7 ms 9728 KB Output is correct
6 Correct 71 ms 12536 KB Output is correct
7 Correct 89 ms 12792 KB Output is correct
8 Correct 123 ms 15224 KB Output is correct
9 Correct 118 ms 15224 KB Output is correct
10 Correct 117 ms 15224 KB Output is correct
11 Correct 118 ms 15224 KB Output is correct
12 Correct 122 ms 15224 KB Output is correct
13 Correct 111 ms 15480 KB Output is correct
14 Correct 118 ms 15228 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 8 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 9728 KB Output is correct
20 Correct 12 ms 9856 KB Output is correct
21 Correct 99 ms 13304 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 12 ms 9856 KB Output is correct
24 Correct 98 ms 13236 KB Output is correct
25 Correct 96 ms 13176 KB Output is correct
26 Correct 94 ms 13340 KB Output is correct
27 Correct 97 ms 13304 KB Output is correct
28 Correct 189 ms 15372 KB Output is correct
29 Correct 1700 ms 39544 KB Output is correct
30 Correct 200 ms 15352 KB Output is correct
31 Correct 1654 ms 39416 KB Output is correct
32 Correct 1092 ms 39544 KB Output is correct
33 Correct 1073 ms 39544 KB Output is correct
34 Correct 1329 ms 39416 KB Output is correct
35 Correct 6 ms 9728 KB Output is correct
36 Correct 7 ms 9728 KB Output is correct
37 Runtime error 86 ms 28664 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -