oj.uz

Submission #80628

# Submission time Handle Problem Language Result Execution time Memory
80628 2018-10-21T19:40:20 Z qkxwsm Seats (IOI18_seats) C++14
37 / 100
 4000 ms 242244 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 1000013

typedef pair<int, int> pii;
typedef pair<pii, pii> ppp;
typedef pair<pii, int> ppi;

int N, M, K;
pii coor[MAXN];
vector<vector<int> > grid;

struct segtree
{
	vector<pii> lazy;
	vector<ppi> stor;
	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;
		update(1, 0, K - 1, l, r, p);
	}
};

segtree seg;

ppp sort4(int a, int b, int c, int d)
{
	if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
	if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
	if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
	return {{a, b}, {c, d}};
}

void give_initial_chart(int h, int w, vector<int> R, vector<int> C)
{
	N = h + 2;
	M = w + 2;
	K = w * h;
	seg.lazy.resize(1 << (33 - __builtin_clz(K)));
	seg.stor.resize(1 << (33 - __builtin_clz(K)));
	int cc = K;
	grid.resize(N);
	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] = cc; cc++;
			}
		}
	}
	for (int i = 0; i < K; i++)
	{
		R[i]++; C[i]++;
		coor[i] = {R[i], C[i]};
		grid[R[i]][C[i]] = i;
	}
	seg.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]);
			seg.upd(p.se.fi, p.se.se - 1, {1, 0});
			seg.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 = p0.fi + i, y = p0.se + j;
			ppp p = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			seg.upd(p.se.fi, p.se.se - 1, {-1, 0});
			seg.upd(p.fi.fi, p.fi.se - 1, {0, -1});
		}
	}
	for (int i = -1; i <= 0; i++)
	{
		for (int j = -1; j <= 0; j++)
		{
			int x = p1.fi + i, y = p1.se + j;
			ppp p = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			seg.upd(p.se.fi, p.se.se - 1, {-1, 0});
			seg.upd(p.fi.fi, p.fi.se - 1, {0, -1});
		}
	}
	swap(coor[a], coor[b]);
	swap(grid[p0.fi][p0.se], grid[p1.fi][p1.se]);
	for (int i = -1; i <= 0; i++)
	{
		for (int j = -1; j <= 0; j++)
		{
			int x = p0.fi + i, y = p0.se + j;
			ppp p = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			seg.upd(p.se.fi, p.se.se - 1, {1, 0});
			seg.upd(p.fi.fi, p.fi.se - 1, {0, 1});
		}
	}
	for (int i = -1; i <= 0; i++)
	{
		for (int j = -1; j <= 0; j++)
		{
			int x = p1.fi + i, y = p1.se + j;
		 	ppp p = sort4(grid[x][y], grid[x + 1][y], grid[x][y + 1], grid[x + 1][y + 1]);
			seg.upd(p.se.fi, p.se.se - 1, {1, 0});
			seg.upd(p.fi.fi, p.fi.se - 1, {0, 1});
		}
	}
	seg.push(1, 0, K - 1);
	return seg.stor[1].se;
}

Compilation message

seats.cpp: In function 'ppp sort4(int, int, int, int)':
seats.cpp:87:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
  ^~
seats.cpp:87:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
                         ^~
seats.cpp:88:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
  ^~
seats.cpp:88:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
                         ^~
seats.cpp:89:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
  ^~
seats.cpp:89:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if (a > b) swap(a, b); if (b > c) swap(b, c); if (c > d) swap(c, d);
                         ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 504 KB Output is correct
2 Correct 33 ms 612 KB Output is correct
3 Correct 81 ms 612 KB Output is correct
4 Correct 27 ms 660 KB Output is correct
5 Correct 27 ms 720 KB Output is correct
6 Correct 43 ms 752 KB Output is correct
7 Correct 49 ms 752 KB Output is correct
8 Correct 47 ms 772 KB Output is correct
9 Correct 45 ms 784 KB Output is correct
10 Correct 50 ms 784 KB Output is correct
11 Correct 44 ms 784 KB Output is correct
12 Correct 26 ms 800 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 504 KB Output is correct
2 Correct 33 ms 612 KB Output is correct
3 Correct 81 ms 612 KB Output is correct
4 Correct 27 ms 660 KB Output is correct
5 Correct 27 ms 720 KB Output is correct
6 Correct 43 ms 752 KB Output is correct
7 Correct 49 ms 752 KB Output is correct
8 Correct 47 ms 772 KB Output is correct
9 Correct 45 ms 784 KB Output is correct
10 Correct 50 ms 784 KB Output is correct
11 Correct 44 ms 784 KB Output is correct
12 Correct 26 ms 800 KB Output is correct
13 Correct 116 ms 1568 KB Output is correct
14 Correct 131 ms 1644 KB Output is correct
15 Correct 73 ms 1664 KB Output is correct
16 Correct 59 ms 2080 KB Output is correct
17 Correct 100 ms 2080 KB Output is correct
18 Correct 95 ms 2080 KB Output is correct
19 Correct 97 ms 2080 KB Output is correct
20 Correct 74 ms 2080 KB Output is correct
21 Correct 58 ms 2080 KB Output is correct
22 Correct 57 ms 2292 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3293 ms 69180 KB Output is correct
2 Correct 1696 ms 72380 KB Output is correct
3 Correct 1590 ms 72380 KB Output is correct
4 Correct 1341 ms 72380 KB Output is correct
5 Correct 1490 ms 72380 KB Output is correct
6 Correct 1434 ms 72380 KB Output is correct
7 Correct 1522 ms 72380 KB Output is correct
8 Correct 1525 ms 72380 KB Output is correct
9 Correct 1612 ms 72380 KB Output is correct
10 Correct 1568 ms 72380 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 72380 KB Output is correct
2 Correct 256 ms 72380 KB Output is correct
3 Correct 1457 ms 72428 KB Output is correct
4 Correct 3231 ms 72428 KB Output is correct
5 Correct 1237 ms 96112 KB Output is correct
6 Correct 3066 ms 155184 KB Output is correct
7 Correct 1378 ms 155184 KB Output is correct
8 Correct 1656 ms 155184 KB Output is correct
9 Correct 1510 ms 155184 KB Output is correct
10 Correct 1479 ms 173044 KB Output is correct
11 Correct 1462 ms 207860 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 207860 KB Output is correct
2 Correct 130 ms 207860 KB Output is correct
3 Correct 237 ms 207860 KB Output is correct
4 Correct 377 ms 207860 KB Output is correct
5 Correct 627 ms 207860 KB Output is correct
6 Correct 2007 ms 207860 KB Output is correct
7 Correct 2410 ms 209092 KB Output is correct
8 Correct 1934 ms 225588 KB Output is correct
9 Execution timed out 4006 ms 242244 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 504 KB Output is correct
2 Correct 33 ms 612 KB Output is correct
3 Correct 81 ms 612 KB Output is correct
4 Correct 27 ms 660 KB Output is correct
5 Correct 27 ms 720 KB Output is correct
6 Correct 43 ms 752 KB Output is correct
7 Correct 49 ms 752 KB Output is correct
8 Correct 47 ms 772 KB Output is correct
9 Correct 45 ms 784 KB Output is correct
10 Correct 50 ms 784 KB Output is correct
11 Correct 44 ms 784 KB Output is correct
12 Correct 26 ms 800 KB Output is correct
13 Correct 116 ms 1568 KB Output is correct
14 Correct 131 ms 1644 KB Output is correct
15 Correct 73 ms 1664 KB Output is correct
16 Correct 59 ms 2080 KB Output is correct
17 Correct 100 ms 2080 KB Output is correct
18 Correct 95 ms 2080 KB Output is correct
19 Correct 97 ms 2080 KB Output is correct
20 Correct 74 ms 2080 KB Output is correct
21 Correct 58 ms 2080 KB Output is correct
22 Correct 57 ms 2292 KB Output is correct
23 Correct 3293 ms 69180 KB Output is correct
24 Correct 1696 ms 72380 KB Output is correct
25 Correct 1590 ms 72380 KB Output is correct
26 Correct 1341 ms 72380 KB Output is correct
27 Correct 1490 ms 72380 KB Output is correct
28 Correct 1434 ms 72380 KB Output is correct
29 Correct 1522 ms 72380 KB Output is correct
30 Correct 1525 ms 72380 KB Output is correct
31 Correct 1612 ms 72380 KB Output is correct
32 Correct 1568 ms 72380 KB Output is correct
33 Correct 120 ms 72380 KB Output is correct
34 Correct 256 ms 72380 KB Output is correct
35 Correct 1457 ms 72428 KB Output is correct
36 Correct 3231 ms 72428 KB Output is correct
37 Correct 1237 ms 96112 KB Output is correct
38 Correct 3066 ms 155184 KB Output is correct
39 Correct 1378 ms 155184 KB Output is correct
40 Correct 1656 ms 155184 KB Output is correct
41 Correct 1510 ms 155184 KB Output is correct
42 Correct 1479 ms 173044 KB Output is correct
43 Correct 1462 ms 207860 KB Output is correct
44 Correct 53 ms 207860 KB Output is correct
45 Correct 130 ms 207860 KB Output is correct
46 Correct 237 ms 207860 KB Output is correct
47 Correct 377 ms 207860 KB Output is correct
48 Correct 627 ms 207860 KB Output is correct
49 Correct 2007 ms 207860 KB Output is correct
50 Correct 2410 ms 209092 KB Output is correct
51 Correct 1934 ms 225588 KB Output is correct
52 Execution timed out 4006 ms 242244 KB Time limit exceeded
53 Halted 0 ms 0 KB -