oj.uz

Submission #80651

# Submission time Handle Problem Language Result Execution time Memory
80651 2018-10-22T00:30:28 Z qkxwsm Seats (IOI18_seats) C++14
100 / 100
 2267 ms 142752 KB 
#include "seats.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define MP make_pair
#define fi first
#define se second
#define INF 1000000007
#define MAXN 1048577
 
typedef pair<int, int> pii;
typedef pair<pii, pii> ppp;
typedef pair<pii, int> ppi;
 
int N, M, K;
pii coor[MAXN];
vector<int> grid[MAXN];
pii lazy[2 * MAXN];
ppi stor[2 * MAXN];
pii pref[2 * MAXN];
 
ppi comb(ppi a, ppi b)
{
	ppi res = {{0, 0}, 0};
	if (a.fi <= b.fi)
	{
		res.fi = a.fi;
		res.se += a.se;
	}
	if (b.fi <= a.fi)
	{
		res.fi = b.fi;
		res.se += b.se;
	}
	return res;
}
void build(int w, int L, int R)
{
	lazy[w] = {0, 0};
	if (L == R)
	{
		stor[w] = {pref[L], 1};
		return;
	}
	int mid = (L + R) >> 1;
	build(w << 1, L, mid);
	build(w << 1 | 1, mid + 1, R);
	stor[w] = comb(stor[w << 1], stor[w << 1 | 1]);
}
void push(int w, int L, int R)
{
	stor[w].fi.fi += lazy[w].fi; stor[w].fi.se += lazy[w].se;
	if (L != R)
	{
		lazy[w << 1].fi += lazy[w].fi; lazy[w << 1].se += lazy[w].se;
		lazy[w << 1 | 1].fi += lazy[w].fi; lazy[w << 1 | 1].se += lazy[w].se;
	}
	lazy[w] = {0, 0};
}
void update(int w, int L, int R, int a, int b, pii v)
{
	push(w, L, R);
	if (b < L || R < a) return;
	if (a <= L && R <= b)
	{
		lazy[w].fi += v.fi; lazy[w].se += v.se;
		push(w, L, R);
		return;
	}
	int mid = (L + R) >> 1;
	update(w << 1, L, mid, a, b, v);
	update(w << 1 | 1, mid + 1, R, a, b, v);
	stor[w] = comb(stor[w << 1], stor[w << 1 | 1]);
}
void upd(int l, int r, pii p)
{
	r = min(r, K - 1);
	l = max(l, 0);
	if (l > r) return;
	update(1, 0, K - 1, l, r, p);
}
 
int sorta[4];
ppp sort4(int a, int b, int c, int d)
{
	sorta[0] = a; sorta[1] = b; sorta[2] = c; sorta[3] = d;
	sort(sorta, sorta + 4);
	return {{sorta[0], sorta[1]}, {sorta[2], sorta[3]}};
}
 
void give_initial_chart(int h, int w, vector<int> R, vector<int> C)
{
	N = h + 2;
	M = w + 2;
	K = w * h;
	for (int i = 0; i < N; i++)
	{
		grid[i].resize(M);
	}
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			if (i == 0 || i == N - 1 || j == 0 || j == M - 1)
			{
				grid[i][j] = K; K++;
			}
		}
	}
	K = w * h;
	for (int i = 0; i < K; i++)
	{
		R[i]++; C[i]++;
		coor[i] = {R[i], C[i]};
		grid[R[i]][C[i]] = i;
	}
	for (int i = 0; i < N - 1; i++)
	{
		for (int j = 0; j < M - 1; j++)
		{
			ppp p = sort4(grid[i][j], grid[i + 1][j], grid[i][j + 1], grid[i + 1][j + 1]);
			pref[p.se.fi].fi++;
			pref[p.se.se].fi--;
			pref[p.fi.fi].se++;
			pref[p.fi.se].se--;
			// upd(p.se.fi, p.se.se - 1, {1, 0});
			// upd(p.fi.fi, p.fi.se - 1, {0, 1});
		}
	}
	for (int i = 0; i < K; i++)
	{
		if (i)
		{
			pref[i].fi += pref[i - 1].fi;
			pref[i].se += pref[i - 1].se;
		}
	}
	build(1, 0, K - 1);
}
int swap_seats(int a, int b)
{
	pii p0 = coor[a], p1 = coor[b];
	for (int i = -1; i <= 0; i++)
	{
		for (int j = -1; j <= 0; j++)
		{
			int x, y; ppp p2, p3;
			x = p0.fi + i; y = p0.se + j;
			p2 = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			grid[p0.fi][p0.se] = b;
			grid[p1.fi][p1.se] = a;
			p3 = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			if (p2.fi != p3.fi)
			{
				upd(p2.fi.fi, p2.fi.se - 1, {0, -1});
				upd(p3.fi.fi, p3.fi.se - 1, {0, 1});
			}
			if (p2.se != p3.se)
			{
				upd(p2.se.fi, p2.se.se - 1, {-1, 0});
				upd(p3.se.fi, p3.se.se - 1, {1, 0});
			}
			grid[p0.fi][p0.se] = a;
			grid[p1.fi][p1.se] = b;
		}
	}
	for (int i = -1; i <= 0; i++)
	{
		for (int j = -1; j <= 0; j++)
		{
			int x, y; ppp p2, p3;
			x = p1.fi + i; y = p1.se + j;
			p2 = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			grid[p0.fi][p0.se] = b;
			grid[p1.fi][p1.se] = a;
			p3 = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			if (p2.fi != p3.fi)
			{
				upd(p2.fi.fi, p2.fi.se - 1, {0, -1});
				upd(p3.fi.fi, p3.fi.se - 1, {0, 1});
			}
			if (p2.se != p3.se)
			{
				upd(p2.se.fi, p2.se.se - 1, {-1, 0});
				upd(p3.se.fi, p3.se.se - 1, {1, 0});
			}
			grid[p0.fi][p0.se] = a;
			grid[p1.fi][p1.se] = b;
		}
	}
	grid[p0.fi][p0.se] = b;
	grid[p1.fi][p1.se] = a;
	swap(coor[a], coor[b]);
	push(1, 0, K - 1);
	return stor[1].se;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 25080 KB Output is correct
2 Correct 49 ms 25344 KB Output is correct
3 Correct 62 ms 25344 KB Output is correct
4 Correct 52 ms 25344 KB Output is correct
5 Correct 55 ms 25348 KB Output is correct
6 Correct 62 ms 25348 KB Output is correct
7 Correct 60 ms 25348 KB Output is correct
8 Correct 59 ms 25360 KB Output is correct
9 Correct 58 ms 25404 KB Output is correct
10 Correct 67 ms 25404 KB Output is correct
11 Correct 60 ms 25404 KB Output is correct
12 Correct 49 ms 25492 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 25080 KB Output is correct
2 Correct 49 ms 25344 KB Output is correct
3 Correct 62 ms 25344 KB Output is correct
4 Correct 52 ms 25344 KB Output is correct
5 Correct 55 ms 25348 KB Output is correct
6 Correct 62 ms 25348 KB Output is correct
7 Correct 60 ms 25348 KB Output is correct
8 Correct 59 ms 25360 KB Output is correct
9 Correct 58 ms 25404 KB Output is correct
10 Correct 67 ms 25404 KB Output is correct
11 Correct 60 ms 25404 KB Output is correct
12 Correct 49 ms 25492 KB Output is correct
13 Correct 103 ms 26272 KB Output is correct
14 Correct 109 ms 26272 KB Output is correct
15 Correct 86 ms 26656 KB Output is correct
16 Correct 74 ms 26784 KB Output is correct
17 Correct 95 ms 26784 KB Output is correct
18 Correct 108 ms 26784 KB Output is correct
19 Correct 93 ms 26784 KB Output is correct
20 Correct 85 ms 26784 KB Output is correct
21 Correct 72 ms 26784 KB Output is correct
22 Correct 77 ms 26784 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 715 ms 101712 KB Output is correct
2 Correct 549 ms 101712 KB Output is correct
3 Correct 536 ms 101712 KB Output is correct
4 Correct 536 ms 101772 KB Output is correct
5 Correct 527 ms 101772 KB Output is correct
6 Correct 531 ms 101772 KB Output is correct
7 Correct 538 ms 101772 KB Output is correct
8 Correct 592 ms 101772 KB Output is correct
9 Correct 545 ms 101772 KB Output is correct
10 Correct 526 ms 101776 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 101776 KB Output is correct
2 Correct 149 ms 101776 KB Output is correct
3 Correct 525 ms 101776 KB Output is correct
4 Correct 635 ms 101776 KB Output is correct
5 Correct 529 ms 117932 KB Output is correct
6 Correct 957 ms 137788 KB Output is correct
7 Correct 528 ms 137788 KB Output is correct
8 Correct 538 ms 137788 KB Output is correct
9 Correct 548 ms 137788 KB Output is correct
10 Correct 543 ms 137788 KB Output is correct
11 Correct 543 ms 137788 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 137788 KB Output is correct
2 Correct 158 ms 137788 KB Output is correct
3 Correct 278 ms 137788 KB Output is correct
4 Correct 371 ms 137788 KB Output is correct
5 Correct 623 ms 137788 KB Output is correct
6 Correct 1293 ms 137788 KB Output is correct
7 Correct 1342 ms 137788 KB Output is correct
8 Correct 1297 ms 137788 KB Output is correct
9 Correct 1626 ms 137788 KB Output is correct
10 Correct 1191 ms 137788 KB Output is correct
11 Correct 1250 ms 137788 KB Output is correct
12 Correct 1178 ms 137788 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 25080 KB Output is correct
2 Correct 49 ms 25344 KB Output is correct
3 Correct 62 ms 25344 KB Output is correct
4 Correct 52 ms 25344 KB Output is correct
5 Correct 55 ms 25348 KB Output is correct
6 Correct 62 ms 25348 KB Output is correct
7 Correct 60 ms 25348 KB Output is correct
8 Correct 59 ms 25360 KB Output is correct
9 Correct 58 ms 25404 KB Output is correct
10 Correct 67 ms 25404 KB Output is correct
11 Correct 60 ms 25404 KB Output is correct
12 Correct 49 ms 25492 KB Output is correct
13 Correct 103 ms 26272 KB Output is correct
14 Correct 109 ms 26272 KB Output is correct
15 Correct 86 ms 26656 KB Output is correct
16 Correct 74 ms 26784 KB Output is correct
17 Correct 95 ms 26784 KB Output is correct
18 Correct 108 ms 26784 KB Output is correct
19 Correct 93 ms 26784 KB Output is correct
20 Correct 85 ms 26784 KB Output is correct
21 Correct 72 ms 26784 KB Output is correct
22 Correct 77 ms 26784 KB Output is correct
23 Correct 715 ms 101712 KB Output is correct
24 Correct 549 ms 101712 KB Output is correct
25 Correct 536 ms 101712 KB Output is correct
26 Correct 536 ms 101772 KB Output is correct
27 Correct 527 ms 101772 KB Output is correct
28 Correct 531 ms 101772 KB Output is correct
29 Correct 538 ms 101772 KB Output is correct
30 Correct 592 ms 101772 KB Output is correct
31 Correct 545 ms 101772 KB Output is correct
32 Correct 526 ms 101776 KB Output is correct
33 Correct 106 ms 101776 KB Output is correct
34 Correct 149 ms 101776 KB Output is correct
35 Correct 525 ms 101776 KB Output is correct
36 Correct 635 ms 101776 KB Output is correct
37 Correct 529 ms 117932 KB Output is correct
38 Correct 957 ms 137788 KB Output is correct
39 Correct 528 ms 137788 KB Output is correct
40 Correct 538 ms 137788 KB Output is correct
41 Correct 548 ms 137788 KB Output is correct
42 Correct 543 ms 137788 KB Output is correct
43 Correct 543 ms 137788 KB Output is correct
44 Correct 93 ms 137788 KB Output is correct
45 Correct 158 ms 137788 KB Output is correct
46 Correct 278 ms 137788 KB Output is correct
47 Correct 371 ms 137788 KB Output is correct
48 Correct 623 ms 137788 KB Output is correct
49 Correct 1293 ms 137788 KB Output is correct
50 Correct 1342 ms 137788 KB Output is correct
51 Correct 1297 ms 137788 KB Output is correct
52 Correct 1626 ms 137788 KB Output is correct
53 Correct 1191 ms 137788 KB Output is correct
54 Correct 1250 ms 137788 KB Output is correct
55 Correct 1178 ms 137788 KB Output is correct
56 Correct 169 ms 137788 KB Output is correct
57 Correct 412 ms 137788 KB Output is correct
58 Correct 743 ms 137788 KB Output is correct
59 Correct 1736 ms 137788 KB Output is correct
60 Correct 2240 ms 137788 KB Output is correct
61 Correct 1559 ms 137788 KB Output is correct
62 Correct 1312 ms 137788 KB Output is correct
63 Correct 2267 ms 137788 KB Output is correct
64 Correct 1704 ms 137788 KB Output is correct
65 Correct 1538 ms 137788 KB Output is correct
66 Correct 1826 ms 137788 KB Output is correct
67 Correct 1696 ms 137788 KB Output is correct
68 Correct 1439 ms 137788 KB Output is correct
69 Correct 2193 ms 142752 KB Output is correct