oj.uz

Submission #768480

# Submission time Handle Problem Language Result Execution time Memory
768480 2023-06-28T07:54:26 Z SanguineChameleon Seats (IOI18_seats) C++17
100 / 100
 2033 ms 103252 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 1e6 + 20;
pair<int, int> tree[maxN * 4];
int lazy[maxN * 4];
int R[maxN];
int C[maxN];
vector<vector<int>> seats;
int N;

void build_tree(int id, int lt, int rt) {
	if (lt == rt) {
		tree[id] = make_pair(0, 1);
		return;
	}
	int mt = (lt + rt) >> 1;
	build_tree(id << 1, lt, mt);
	build_tree(id << 1 | 1, mt + 1, rt);
	tree[id] = make_pair(0, rt - lt + 1);
}

void update_tree(int id, int lt, int rt, int ql, int qr, int add) {
	if (lt == ql && rt == qr) {
		tree[id].first += add;
		lazy[id] += add;
		return;
	}
	tree[id << 1].first += lazy[id];
	lazy[id << 1] += lazy[id];
	tree[id << 1 | 1].first += lazy[id];
	lazy[id << 1 | 1] += lazy[id];
	lazy[id] = 0;
	int mt = (lt + rt) >> 1;
	if (qr <= mt) {
		update_tree(id << 1, lt, mt, ql, qr, add);
	}
	else if (ql >= mt + 1) {
		update_tree(id << 1 | 1, mt + 1, rt, ql, qr, add);
	}
	else {
		update_tree(id << 1, lt, mt, ql, mt, add);
		update_tree(id << 1 | 1, mt + 1, rt, mt + 1, qr, add);
	}
	tree[id].first = min(tree[id << 1].first, tree[id << 1 | 1].first);
	tree[id].second = (tree[id << 1].first == tree[id].first ? tree[id << 1].second : 0) + (tree[id << 1 | 1].first == tree[id].first ? tree[id << 1 | 1].second : 0);
}

void update_square(int i, int j, int add) {
	int val1 = seats[i][j];
	int val2 = seats[i][j + 1];
	int val3 = seats[i + 1][j];
	int val4 = seats[i + 1][j + 1];
	if (val1 > val2) {
		swap(val1, val2);
	}
	if (val1 > val3) {
		swap(val1, val3);
	}
	if (val1 > val4) {
		swap(val1, val4);
	}
	if (val2 > val3) {
		swap(val2, val3);
	}
	if (val2 > val4) {
		swap(val2, val4);
	}
	if (val3 > val4) {
		swap(val3, val4);
	}
	if (val1 < val2) {
		update_tree(1, 1, N, val1, val2 - 1, add);
	}
	if (val3 < val4) {
		update_tree(1, 1, N, val3, val4 - 1, add);
	}
}

void update_pos(int i, int j, int val) {
	update_square(i - 1, j - 1, -1);
	update_square(i - 1, j, -1);
	update_square(i, j - 1, -1);
	update_square(i, j, -1);
	seats[i][j] = val;
	update_square(i - 1, j - 1, 1);
	update_square(i - 1, j, 1);
	update_square(i, j - 1, 1);
	update_square(i, j, 1);
}

void give_initial_chart(int H, int W, vector<int> _R, vector<int> _C) {
	H = H;
	W = W;
	N = H * W;
	seats.resize(H + 2, vector<int>(W + 2, N + 1));
	build_tree(1, 1, N);
	for (int i = 1; i <= N; i++) {
		R[i] = _R[i - 1] + 1;
		C[i] = _C[i - 1] + 1;
		seats[R[i]][C[i]] = i;
	}
	for (int i = 0; i <= H; i++) {
		for (int j = 0; j <= W; j++) {
			update_square(i, j, 1);
		}
	}
}

int swap_seats(int a, int b) {
	a++;
	b++;
	update_pos(R[a], C[a], b);
	update_pos(R[b], C[b], a);
	swap(R[a], R[b]);
	swap(C[a], C[b]);
	return tree[1].second;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 15 ms 444 KB Output is correct
3 Correct 21 ms 340 KB Output is correct
4 Correct 15 ms 388 KB Output is correct
5 Correct 11 ms 436 KB Output is correct
6 Correct 18 ms 440 KB Output is correct
7 Correct 19 ms 404 KB Output is correct
8 Correct 23 ms 416 KB Output is correct
9 Correct 17 ms 408 KB Output is correct
10 Correct 19 ms 340 KB Output is correct
11 Correct 17 ms 396 KB Output is correct
12 Correct 11 ms 412 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 15 ms 444 KB Output is correct
3 Correct 21 ms 340 KB Output is correct
4 Correct 15 ms 388 KB Output is correct
5 Correct 11 ms 436 KB Output is correct
6 Correct 18 ms 440 KB Output is correct
7 Correct 19 ms 404 KB Output is correct
8 Correct 23 ms 416 KB Output is correct
9 Correct 17 ms 408 KB Output is correct
10 Correct 19 ms 340 KB Output is correct
11 Correct 17 ms 396 KB Output is correct
12 Correct 11 ms 412 KB Output is correct
13 Correct 64 ms 1016 KB Output is correct
14 Correct 55 ms 980 KB Output is correct
15 Correct 29 ms 1136 KB Output is correct
16 Correct 28 ms 1548 KB Output is correct
17 Correct 38 ms 1064 KB Output is correct
18 Correct 37 ms 1052 KB Output is correct
19 Correct 45 ms 1068 KB Output is correct
20 Correct 33 ms 1240 KB Output is correct
21 Correct 21 ms 1148 KB Output is correct
22 Correct 22 ms 1556 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1437 ms 52424 KB Output is correct
2 Correct 732 ms 52312 KB Output is correct
3 Correct 690 ms 52380 KB Output is correct
4 Correct 564 ms 52328 KB Output is correct
5 Correct 658 ms 52308 KB Output is correct
6 Correct 584 ms 52412 KB Output is correct
7 Correct 640 ms 52296 KB Output is correct
8 Correct 642 ms 52416 KB Output is correct
9 Correct 638 ms 52424 KB Output is correct
10 Correct 606 ms 52420 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1028 KB Output is correct
2 Correct 99 ms 5844 KB Output is correct
3 Correct 564 ms 52316 KB Output is correct
4 Correct 1284 ms 52416 KB Output is correct
5 Correct 536 ms 60208 KB Output is correct
6 Correct 1211 ms 103252 KB Output is correct
7 Correct 549 ms 54988 KB Output is correct
8 Correct 661 ms 52496 KB Output is correct
9 Correct 582 ms 52860 KB Output is correct
10 Correct 621 ms 57092 KB Output is correct
11 Correct 597 ms 75852 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1396 KB Output is correct
2 Correct 60 ms 1512 KB Output is correct
3 Correct 97 ms 1372 KB Output is correct
4 Correct 140 ms 1344 KB Output is correct
5 Correct 222 ms 2116 KB Output is correct
6 Correct 835 ms 60568 KB Output is correct
7 Correct 997 ms 60536 KB Output is correct
8 Correct 823 ms 60540 KB Output is correct
9 Correct 1634 ms 60560 KB Output is correct
10 Correct 857 ms 60564 KB Output is correct
11 Correct 782 ms 60572 KB Output is correct
12 Correct 744 ms 60652 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 15 ms 444 KB Output is correct
3 Correct 21 ms 340 KB Output is correct
4 Correct 15 ms 388 KB Output is correct
5 Correct 11 ms 436 KB Output is correct
6 Correct 18 ms 440 KB Output is correct
7 Correct 19 ms 404 KB Output is correct
8 Correct 23 ms 416 KB Output is correct
9 Correct 17 ms 408 KB Output is correct
10 Correct 19 ms 340 KB Output is correct
11 Correct 17 ms 396 KB Output is correct
12 Correct 11 ms 412 KB Output is correct
13 Correct 64 ms 1016 KB Output is correct
14 Correct 55 ms 980 KB Output is correct
15 Correct 29 ms 1136 KB Output is correct
16 Correct 28 ms 1548 KB Output is correct
17 Correct 38 ms 1064 KB Output is correct
18 Correct 37 ms 1052 KB Output is correct
19 Correct 45 ms 1068 KB Output is correct
20 Correct 33 ms 1240 KB Output is correct
21 Correct 21 ms 1148 KB Output is correct
22 Correct 22 ms 1556 KB Output is correct
23 Correct 1437 ms 52424 KB Output is correct
24 Correct 732 ms 52312 KB Output is correct
25 Correct 690 ms 52380 KB Output is correct
26 Correct 564 ms 52328 KB Output is correct
27 Correct 658 ms 52308 KB Output is correct
28 Correct 584 ms 52412 KB Output is correct
29 Correct 640 ms 52296 KB Output is correct
30 Correct 642 ms 52416 KB Output is correct
31 Correct 638 ms 52424 KB Output is correct
32 Correct 606 ms 52420 KB Output is correct
33 Correct 48 ms 1028 KB Output is correct
34 Correct 99 ms 5844 KB Output is correct
35 Correct 564 ms 52316 KB Output is correct
36 Correct 1284 ms 52416 KB Output is correct
37 Correct 536 ms 60208 KB Output is correct
38 Correct 1211 ms 103252 KB Output is correct
39 Correct 549 ms 54988 KB Output is correct
40 Correct 661 ms 52496 KB Output is correct
41 Correct 582 ms 52860 KB Output is correct
42 Correct 621 ms 57092 KB Output is correct
43 Correct 597 ms 75852 KB Output is correct
44 Correct 22 ms 1396 KB Output is correct
45 Correct 60 ms 1512 KB Output is correct
46 Correct 97 ms 1372 KB Output is correct
47 Correct 140 ms 1344 KB Output is correct
48 Correct 222 ms 2116 KB Output is correct
49 Correct 835 ms 60568 KB Output is correct
50 Correct 997 ms 60536 KB Output is correct
51 Correct 823 ms 60540 KB Output is correct
52 Correct 1634 ms 60560 KB Output is correct
53 Correct 857 ms 60564 KB Output is correct
54 Correct 782 ms 60572 KB Output is correct
55 Correct 744 ms 60652 KB Output is correct
56 Correct 75 ms 2024 KB Output is correct
57 Correct 208 ms 2096 KB Output is correct
58 Correct 338 ms 2752 KB Output is correct
59 Correct 1139 ms 69292 KB Output is correct
60 Correct 2033 ms 69340 KB Output is correct
61 Correct 1068 ms 69292 KB Output is correct
62 Correct 857 ms 73112 KB Output is correct
63 Correct 1938 ms 71952 KB Output is correct
64 Correct 1258 ms 70056 KB Output is correct
65 Correct 1131 ms 69408 KB Output is correct
66 Correct 1276 ms 69592 KB Output is correct
67 Correct 1256 ms 73980 KB Output is correct
68 Correct 949 ms 83612 KB Output is correct
69 Correct 1807 ms 92772 KB Output is correct