oj.uz

답안 #80642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
80642 2018-10-22T00:19:26 Z qkxwsm 자리 배치 (IOI18_seats) C++14
31 / 100
 697 ms 154304 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)
{
	if (L == R)
	{
		stor[w] = {lazy[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]);
			lazy[p.se.fi].fi++;
			lazy[p.se.se].fi--;
			lazy[p.fi.fi].se++;
			lazy[p.fi.se].se--;
		}
	}
	for (int i = 0; i < K; i++)
	{
		if (i)
		{
			lazy[i].fi += lazy[i - 1].fi;
			lazy[i].se += lazy[i - 1].se;
		}
	}
	build(1, 0, K - 1);
	for (int i = 0; i < 2 * MAXN; i++)
	{
		lazy[i] = {0, 0};
	}
}
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

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 41464 KB Output is correct
2 Correct 65 ms 41588 KB Output is correct
3 Correct 76 ms 41588 KB Output is correct
4 Correct 67 ms 41696 KB Output is correct
5 Correct 61 ms 41720 KB Output is correct
6 Correct 73 ms 41720 KB Output is correct
7 Correct 76 ms 41812 KB Output is correct
8 Correct 76 ms 41812 KB Output is correct
9 Correct 72 ms 41812 KB Output is correct
10 Correct 73 ms 41864 KB Output is correct
11 Correct 102 ms 41868 KB Output is correct
12 Correct 63 ms 41868 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 41464 KB Output is correct
2 Correct 65 ms 41588 KB Output is correct
3 Correct 76 ms 41588 KB Output is correct
4 Correct 67 ms 41696 KB Output is correct
5 Correct 61 ms 41720 KB Output is correct
6 Correct 73 ms 41720 KB Output is correct
7 Correct 76 ms 41812 KB Output is correct
8 Correct 76 ms 41812 KB Output is correct
9 Correct 72 ms 41812 KB Output is correct
10 Correct 73 ms 41864 KB Output is correct
11 Correct 102 ms 41868 KB Output is correct
12 Correct 63 ms 41868 KB Output is correct
13 Correct 118 ms 42396 KB Output is correct
14 Correct 133 ms 42428 KB Output is correct
15 Correct 98 ms 42428 KB Output is correct
16 Correct 87 ms 42712 KB Output is correct
17 Correct 108 ms 42712 KB Output is correct
18 Correct 108 ms 42712 KB Output is correct
19 Correct 108 ms 42712 KB Output is correct
20 Correct 101 ms 42712 KB Output is correct
21 Correct 86 ms 42712 KB Output is correct
22 Correct 100 ms 42712 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 697 ms 93836 KB Output is correct
2 Correct 524 ms 93836 KB Output is correct
3 Correct 580 ms 93852 KB Output is correct
4 Correct 511 ms 93852 KB Output is correct
5 Correct 523 ms 93852 KB Output is correct
6 Correct 528 ms 93852 KB Output is correct
7 Correct 534 ms 93884 KB Output is correct
8 Correct 569 ms 93884 KB Output is correct
9 Correct 536 ms 93884 KB Output is correct
10 Correct 532 ms 93884 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 93884 KB Output is correct
2 Correct 167 ms 93884 KB Output is correct
3 Correct 513 ms 93884 KB Output is correct
4 Correct 613 ms 93884 KB Output is correct
5 Runtime error 495 ms 153532 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 153532 KB Output is correct
2 Correct 184 ms 153532 KB Output is correct
3 Correct 289 ms 153532 KB Output is correct
4 Correct 389 ms 153532 KB Output is correct
5 Correct 618 ms 153532 KB Output is correct
6 Runtime error 539 ms 154304 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 41464 KB Output is correct
2 Correct 65 ms 41588 KB Output is correct
3 Correct 76 ms 41588 KB Output is correct
4 Correct 67 ms 41696 KB Output is correct
5 Correct 61 ms 41720 KB Output is correct
6 Correct 73 ms 41720 KB Output is correct
7 Correct 76 ms 41812 KB Output is correct
8 Correct 76 ms 41812 KB Output is correct
9 Correct 72 ms 41812 KB Output is correct
10 Correct 73 ms 41864 KB Output is correct
11 Correct 102 ms 41868 KB Output is correct
12 Correct 63 ms 41868 KB Output is correct
13 Correct 118 ms 42396 KB Output is correct
14 Correct 133 ms 42428 KB Output is correct
15 Correct 98 ms 42428 KB Output is correct
16 Correct 87 ms 42712 KB Output is correct
17 Correct 108 ms 42712 KB Output is correct
18 Correct 108 ms 42712 KB Output is correct
19 Correct 108 ms 42712 KB Output is correct
20 Correct 101 ms 42712 KB Output is correct
21 Correct 86 ms 42712 KB Output is correct
22 Correct 100 ms 42712 KB Output is correct
23 Correct 697 ms 93836 KB Output is correct
24 Correct 524 ms 93836 KB Output is correct
25 Correct 580 ms 93852 KB Output is correct
26 Correct 511 ms 93852 KB Output is correct
27 Correct 523 ms 93852 KB Output is correct
28 Correct 528 ms 93852 KB Output is correct
29 Correct 534 ms 93884 KB Output is correct
30 Correct 569 ms 93884 KB Output is correct
31 Correct 536 ms 93884 KB Output is correct
32 Correct 532 ms 93884 KB Output is correct
33 Correct 127 ms 93884 KB Output is correct
34 Correct 167 ms 93884 KB Output is correct
35 Correct 513 ms 93884 KB Output is correct
36 Correct 613 ms 93884 KB Output is correct
37 Runtime error 495 ms 153532 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Halted 0 ms 0 KB -