oj.uz

Submission #96624

# Submission time Handle Problem Language Result Execution time Memory
96624 2019-02-10T13:29:50 Z diamond_duke Seats (IOI18_seats) C++11
100 / 100
 2844 ms 119636 KB 
#include "seats.h"
#include <algorithm>
#include <utility>
constexpr int dx[] = { -1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int seg[4000005], cnt[4000005], lazy[4000005], n, m;
std::vector<std::pair<int, int> > pos;
std::vector<std::vector<int> > arr;
inline bool in_grid(int x, int y) { return x >= 0 && x < n && y >= 0 && y < m; }
inline void paint(int u, int x) { seg[u] += x; lazy[u] += x; }
void build(int u, int l, int r)
{
	cnt[u] = r - l + 1;
	if (l == r)
		return;
	int mid = l + r >> 1;
	build(u << 1, l, mid);
	build(u << 1 | 1, mid + 1, r);
}
void modify(int u, int l, int r, int L, int R, int x)
{
	if (L > R)
		return;
	if (L <= l && r <= R)
	{
		paint(u, x);
		return;
	}
	if (lazy[u])
	{
		paint(u << 1, lazy[u]);
		paint(u << 1 | 1, lazy[u]);
		lazy[u] = 0;
	}
	int mid = l + r >> 1;
	if (L <= mid)
		modify(u << 1, l, mid, L, R, x);
	if (mid < R)
		modify(u << 1 | 1, mid + 1, r, L, R, x);
	seg[u] = std::min(seg[u << 1], seg[u << 1 | 1]);
	cnt[u] = 0;
	if (seg[u] == seg[u << 1])
		cnt[u] += cnt[u << 1];
	if (seg[u] == seg[u << 1 | 1])
		cnt[u] += cnt[u << 1 | 1];
}
inline void modify(int x, int y, int coef)
{
	int lim = n * m;
	for (int i = 0; i < 2; i++)
	{
		int xx = x + dx[i], yy = y + dy[i];
		if (in_grid(xx, yy))
			lim = std::min(lim, arr[xx][yy]);
	}
	modify(1, 0, n * m - 1, arr[x][y], lim - 1, coef);
	std::vector<int> adj;
	for (int i = 0; i < 4; i++)
	{
		int xx = x + dx[i], yy = y + dy[i];
		if (in_grid(xx, yy))
			adj.push_back(arr[xx][yy]);
	}
	std::sort(adj.begin(), adj.end());
	if (adj.size() > 1)
		modify(1, 0, n * m - 1, adj[1], arr[x][y] - 1, coef);
}
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C)
{
	n = H;
	m = W;
	arr.resize(n, std::vector<int>(m));
	for (int i = 0; i < R.size(); i++)
	{
		arr[R[i]][C[i]] = i;
		pos.emplace_back(R[i], C[i]);
	}
	build(1, 0, n * m - 1);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
			modify(i, j, 1);
	}
}
int swap_seats(int a, int b)
{
	std::vector<std::pair<int, int> > vec;
	auto add = [&] (int x, int y)
	{
		vec.emplace_back(x, y);
		for (int i = 0; i < 4; i++)
		{
			int xx = x + dx[i], yy = y + dy[i];
			if (in_grid(xx, yy))
				vec.emplace_back(xx, yy);
		}
	};
	add(pos[a].first, pos[a].second);
	add(pos[b].first, pos[b].second);
	std::sort(vec.begin(), vec.end());
	vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
	for (auto &it : vec)
		modify(it.first, it.second, -1);
	std::swap(pos[a], pos[b]);
	arr[pos[a].first][pos[a].second] = a;
	arr[pos[b].first][pos[b].second] = b;
	for (auto &it : vec)
		modify(it.first, it.second, 1);
	return seg[1] == 1 ? cnt[1] : 0;
}

Compilation message

seats.cpp: In function 'void build(int, int, int)':
seats.cpp:15:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1;
            ~~^~~
seats.cpp: In function 'void modify(int, int, int, int, int, int)':
seats.cpp:34:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1;
            ~~^~~
seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < R.size(); i++)
                  ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 27 ms 532 KB Output is correct
3 Correct 36 ms 504 KB Output is correct
4 Correct 20 ms 504 KB Output is correct
5 Correct 14 ms 504 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 36 ms 504 KB Output is correct
8 Correct 32 ms 504 KB Output is correct
9 Correct 50 ms 504 KB Output is correct
10 Correct 34 ms 508 KB Output is correct
11 Correct 36 ms 528 KB Output is correct
12 Correct 19 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 27 ms 532 KB Output is correct
3 Correct 36 ms 504 KB Output is correct
4 Correct 20 ms 504 KB Output is correct
5 Correct 14 ms 504 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 36 ms 504 KB Output is correct
8 Correct 32 ms 504 KB Output is correct
9 Correct 50 ms 504 KB Output is correct
10 Correct 34 ms 508 KB Output is correct
11 Correct 36 ms 528 KB Output is correct
12 Correct 19 ms 504 KB Output is correct
13 Correct 59 ms 1400 KB Output is correct
14 Correct 72 ms 1384 KB Output is correct
15 Correct 38 ms 1400 KB Output is correct
16 Correct 22 ms 1912 KB Output is correct
17 Correct 53 ms 1400 KB Output is correct
18 Correct 48 ms 1384 KB Output is correct
19 Correct 47 ms 1408 KB Output is correct
20 Correct 42 ms 1528 KB Output is correct
21 Correct 30 ms 1400 KB Output is correct
22 Correct 37 ms 1912 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1665 ms 68760 KB Output is correct
2 Correct 834 ms 68564 KB Output is correct
3 Correct 970 ms 68564 KB Output is correct
4 Correct 608 ms 68564 KB Output is correct
5 Correct 674 ms 68596 KB Output is correct
6 Correct 1002 ms 68580 KB Output is correct
7 Correct 1131 ms 68820 KB Output is correct
8 Correct 920 ms 68716 KB Output is correct
9 Correct 898 ms 68552 KB Output is correct
10 Correct 773 ms 68852 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1400 KB Output is correct
2 Correct 136 ms 7408 KB Output is correct
3 Correct 751 ms 68552 KB Output is correct
4 Correct 1569 ms 68868 KB Output is correct
5 Correct 639 ms 70584 KB Output is correct
6 Correct 1559 ms 119636 KB Output is correct
7 Correct 703 ms 70488 KB Output is correct
8 Correct 978 ms 68616 KB Output is correct
9 Correct 918 ms 69076 KB Output is correct
10 Correct 726 ms 71768 KB Output is correct
11 Correct 711 ms 91168 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2036 KB Output is correct
2 Correct 122 ms 2140 KB Output is correct
3 Correct 178 ms 2104 KB Output is correct
4 Correct 193 ms 2176 KB Output is correct
5 Correct 298 ms 2816 KB Output is correct
6 Correct 1022 ms 72604 KB Output is correct
7 Correct 1126 ms 73636 KB Output is correct
8 Correct 1082 ms 71680 KB Output is correct
9 Correct 1821 ms 73608 KB Output is correct
10 Correct 910 ms 73680 KB Output is correct
11 Correct 942 ms 73576 KB Output is correct
12 Correct 613 ms 66052 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 27 ms 532 KB Output is correct
3 Correct 36 ms 504 KB Output is correct
4 Correct 20 ms 504 KB Output is correct
5 Correct 14 ms 504 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 36 ms 504 KB Output is correct
8 Correct 32 ms 504 KB Output is correct
9 Correct 50 ms 504 KB Output is correct
10 Correct 34 ms 508 KB Output is correct
11 Correct 36 ms 528 KB Output is correct
12 Correct 19 ms 504 KB Output is correct
13 Correct 59 ms 1400 KB Output is correct
14 Correct 72 ms 1384 KB Output is correct
15 Correct 38 ms 1400 KB Output is correct
16 Correct 22 ms 1912 KB Output is correct
17 Correct 53 ms 1400 KB Output is correct
18 Correct 48 ms 1384 KB Output is correct
19 Correct 47 ms 1408 KB Output is correct
20 Correct 42 ms 1528 KB Output is correct
21 Correct 30 ms 1400 KB Output is correct
22 Correct 37 ms 1912 KB Output is correct
23 Correct 1665 ms 68760 KB Output is correct
24 Correct 834 ms 68564 KB Output is correct
25 Correct 970 ms 68564 KB Output is correct
26 Correct 608 ms 68564 KB Output is correct
27 Correct 674 ms 68596 KB Output is correct
28 Correct 1002 ms 68580 KB Output is correct
29 Correct 1131 ms 68820 KB Output is correct
30 Correct 920 ms 68716 KB Output is correct
31 Correct 898 ms 68552 KB Output is correct
32 Correct 773 ms 68852 KB Output is correct
33 Correct 63 ms 1400 KB Output is correct
34 Correct 136 ms 7408 KB Output is correct
35 Correct 751 ms 68552 KB Output is correct
36 Correct 1569 ms 68868 KB Output is correct
37 Correct 639 ms 70584 KB Output is correct
38 Correct 1559 ms 119636 KB Output is correct
39 Correct 703 ms 70488 KB Output is correct
40 Correct 978 ms 68616 KB Output is correct
41 Correct 918 ms 69076 KB Output is correct
42 Correct 726 ms 71768 KB Output is correct
43 Correct 711 ms 91168 KB Output is correct
44 Correct 59 ms 2036 KB Output is correct
45 Correct 122 ms 2140 KB Output is correct
46 Correct 178 ms 2104 KB Output is correct
47 Correct 193 ms 2176 KB Output is correct
48 Correct 298 ms 2816 KB Output is correct
49 Correct 1022 ms 72604 KB Output is correct
50 Correct 1126 ms 73636 KB Output is correct
51 Correct 1082 ms 71680 KB Output is correct
52 Correct 1821 ms 73608 KB Output is correct
53 Correct 910 ms 73680 KB Output is correct
54 Correct 942 ms 73576 KB Output is correct
55 Correct 613 ms 66052 KB Output is correct
56 Correct 182 ms 2108 KB Output is correct
57 Correct 351 ms 2164 KB Output is correct
58 Correct 456 ms 3112 KB Output is correct
59 Correct 1819 ms 69588 KB Output is correct
60 Correct 2564 ms 69716 KB Output is correct
61 Correct 1198 ms 69592 KB Output is correct
62 Correct 1135 ms 70580 KB Output is correct
63 Correct 2844 ms 71520 KB Output is correct
64 Correct 1751 ms 69992 KB Output is correct
65 Correct 1726 ms 69712 KB Output is correct
66 Correct 1863 ms 69972 KB Output is correct
67 Correct 1419 ms 72856 KB Output is correct
68 Correct 1186 ms 83900 KB Output is correct
69 Correct 2426 ms 93140 KB Output is correct