oj.uz

Submission #80638

# Submission time Handle Problem Language Result Execution time Memory
80638 2018-10-21T23:52:41 Z qkxwsm Seats (IOI18_seats) C++14
37 / 100
 4000 ms 121276 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];

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)
{
	stor[w] = {{0, 0}, 1};
	lazy[w] = {0, 0};
	if (L == R) 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;
	// cerr << "update " << l << ' ' << r << ' ' << p.fi << ',' << p.se << endl;
	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;
	}
	build(1, 0, K - 1);
	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]);
			upd(p.se.fi, p.se.se - 1, {1, 0});
			upd(p.fi.fi, p.fi.se - 1, {0, 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 44 ms 25080 KB Output is correct
2 Correct 50 ms 25212 KB Output is correct
3 Correct 64 ms 25288 KB Output is correct
4 Correct 53 ms 25288 KB Output is correct
5 Correct 50 ms 25288 KB Output is correct
6 Correct 73 ms 25288 KB Output is correct
7 Correct 60 ms 25288 KB Output is correct
8 Correct 59 ms 25340 KB Output is correct
9 Correct 66 ms 25340 KB Output is correct
10 Correct 63 ms 25404 KB Output is correct
11 Correct 61 ms 25404 KB Output is correct
12 Correct 53 ms 25496 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 25080 KB Output is correct
2 Correct 50 ms 25212 KB Output is correct
3 Correct 64 ms 25288 KB Output is correct
4 Correct 53 ms 25288 KB Output is correct
5 Correct 50 ms 25288 KB Output is correct
6 Correct 73 ms 25288 KB Output is correct
7 Correct 60 ms 25288 KB Output is correct
8 Correct 59 ms 25340 KB Output is correct
9 Correct 66 ms 25340 KB Output is correct
10 Correct 63 ms 25404 KB Output is correct
11 Correct 61 ms 25404 KB Output is correct
12 Correct 53 ms 25496 KB Output is correct
13 Correct 117 ms 26276 KB Output is correct
14 Correct 132 ms 26284 KB Output is correct
15 Correct 107 ms 26284 KB Output is correct
16 Correct 88 ms 26668 KB Output is correct
17 Correct 110 ms 26668 KB Output is correct
18 Correct 115 ms 26668 KB Output is correct
19 Correct 104 ms 26668 KB Output is correct
20 Correct 94 ms 26668 KB Output is correct
21 Correct 84 ms 26668 KB Output is correct
22 Correct 86 ms 26668 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3598 ms 93884 KB Output is correct
2 Correct 1904 ms 93884 KB Output is correct
3 Correct 1834 ms 93884 KB Output is correct
4 Correct 1594 ms 93884 KB Output is correct
5 Correct 1665 ms 93884 KB Output is correct
6 Correct 1571 ms 93884 KB Output is correct
7 Correct 1718 ms 93884 KB Output is correct
8 Correct 1776 ms 93884 KB Output is correct
9 Correct 1799 ms 93884 KB Output is correct
10 Correct 2226 ms 93884 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 93884 KB Output is correct
2 Correct 273 ms 93884 KB Output is correct
3 Correct 1615 ms 93884 KB Output is correct
4 Correct 3619 ms 93884 KB Output is correct
5 Correct 1519 ms 101600 KB Output is correct
6 Correct 3583 ms 121276 KB Output is correct
7 Correct 1603 ms 121276 KB Output is correct
8 Correct 1961 ms 121276 KB Output is correct
9 Correct 1779 ms 121276 KB Output is correct
10 Correct 1626 ms 121276 KB Output is correct
11 Correct 1673 ms 121276 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 121276 KB Output is correct
2 Correct 166 ms 121276 KB Output is correct
3 Correct 294 ms 121276 KB Output is correct
4 Correct 386 ms 121276 KB Output is correct
5 Correct 642 ms 121276 KB Output is correct
6 Correct 2330 ms 121276 KB Output is correct
7 Correct 2708 ms 121276 KB Output is correct
8 Correct 2225 ms 121276 KB Output is correct
9 Execution timed out 4029 ms 121276 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 25080 KB Output is correct
2 Correct 50 ms 25212 KB Output is correct
3 Correct 64 ms 25288 KB Output is correct
4 Correct 53 ms 25288 KB Output is correct
5 Correct 50 ms 25288 KB Output is correct
6 Correct 73 ms 25288 KB Output is correct
7 Correct 60 ms 25288 KB Output is correct
8 Correct 59 ms 25340 KB Output is correct
9 Correct 66 ms 25340 KB Output is correct
10 Correct 63 ms 25404 KB Output is correct
11 Correct 61 ms 25404 KB Output is correct
12 Correct 53 ms 25496 KB Output is correct
13 Correct 117 ms 26276 KB Output is correct
14 Correct 132 ms 26284 KB Output is correct
15 Correct 107 ms 26284 KB Output is correct
16 Correct 88 ms 26668 KB Output is correct
17 Correct 110 ms 26668 KB Output is correct
18 Correct 115 ms 26668 KB Output is correct
19 Correct 104 ms 26668 KB Output is correct
20 Correct 94 ms 26668 KB Output is correct
21 Correct 84 ms 26668 KB Output is correct
22 Correct 86 ms 26668 KB Output is correct
23 Correct 3598 ms 93884 KB Output is correct
24 Correct 1904 ms 93884 KB Output is correct
25 Correct 1834 ms 93884 KB Output is correct
26 Correct 1594 ms 93884 KB Output is correct
27 Correct 1665 ms 93884 KB Output is correct
28 Correct 1571 ms 93884 KB Output is correct
29 Correct 1718 ms 93884 KB Output is correct
30 Correct 1776 ms 93884 KB Output is correct
31 Correct 1799 ms 93884 KB Output is correct
32 Correct 2226 ms 93884 KB Output is correct
33 Correct 119 ms 93884 KB Output is correct
34 Correct 273 ms 93884 KB Output is correct
35 Correct 1615 ms 93884 KB Output is correct
36 Correct 3619 ms 93884 KB Output is correct
37 Correct 1519 ms 101600 KB Output is correct
38 Correct 3583 ms 121276 KB Output is correct
39 Correct 1603 ms 121276 KB Output is correct
40 Correct 1961 ms 121276 KB Output is correct
41 Correct 1779 ms 121276 KB Output is correct
42 Correct 1626 ms 121276 KB Output is correct
43 Correct 1673 ms 121276 KB Output is correct
44 Correct 95 ms 121276 KB Output is correct
45 Correct 166 ms 121276 KB Output is correct
46 Correct 294 ms 121276 KB Output is correct
47 Correct 386 ms 121276 KB Output is correct
48 Correct 642 ms 121276 KB Output is correct
49 Correct 2330 ms 121276 KB Output is correct
50 Correct 2708 ms 121276 KB Output is correct
51 Correct 2225 ms 121276 KB Output is correct
52 Execution timed out 4029 ms 121276 KB Time limit exceeded
53 Halted 0 ms 0 KB -