oj.uz

답안 #768482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768482 2023-06-28T07:55:43 Z SanguineChameleon 자리 배치 (IOI18_seats) C++17
100 / 100
 2147 ms 103232 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) {
	vector<int> vals = {seats[i][j], seats[i][j + 1], seats[i + 1][j], seats[i + 1][j + 1]};
	sort(vals.begin(), vals.end());
	if (vals[0] < vals[1]) {
		update_tree(1, 1, N, vals[0], vals[1] - 1, add);
	}
	if (vals[2] < vals[3]) {
		update_tree(1, 1, N, vals[2], vals[3] - 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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 340 KB Output is correct
2 Correct 14 ms 400 KB Output is correct
3 Correct 23 ms 340 KB Output is correct
4 Correct 14 ms 432 KB Output is correct
5 Correct 12 ms 404 KB Output is correct
6 Correct 23 ms 340 KB Output is correct
7 Correct 21 ms 400 KB Output is correct
8 Correct 20 ms 468 KB Output is correct
9 Correct 19 ms 340 KB Output is correct
10 Correct 22 ms 408 KB Output is correct
11 Correct 19 ms 408 KB Output is correct
12 Correct 13 ms 408 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 340 KB Output is correct
2 Correct 14 ms 400 KB Output is correct
3 Correct 23 ms 340 KB Output is correct
4 Correct 14 ms 432 KB Output is correct
5 Correct 12 ms 404 KB Output is correct
6 Correct 23 ms 340 KB Output is correct
7 Correct 21 ms 400 KB Output is correct
8 Correct 20 ms 468 KB Output is correct
9 Correct 19 ms 340 KB Output is correct
10 Correct 22 ms 408 KB Output is correct
11 Correct 19 ms 408 KB Output is correct
12 Correct 13 ms 408 KB Output is correct
13 Correct 49 ms 1008 KB Output is correct
14 Correct 56 ms 1028 KB Output is correct
15 Correct 31 ms 1128 KB Output is correct
16 Correct 23 ms 1548 KB Output is correct
17 Correct 41 ms 1072 KB Output is correct
18 Correct 39 ms 1044 KB Output is correct
19 Correct 36 ms 1068 KB Output is correct
20 Correct 30 ms 1172 KB Output is correct
21 Correct 23 ms 1140 KB Output is correct
22 Correct 24 ms 1556 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1356 ms 52420 KB Output is correct
2 Correct 709 ms 52452 KB Output is correct
3 Correct 645 ms 52416 KB Output is correct
4 Correct 578 ms 52400 KB Output is correct
5 Correct 611 ms 52296 KB Output is correct
6 Correct 567 ms 52344 KB Output is correct
7 Correct 633 ms 52496 KB Output is correct
8 Correct 636 ms 52300 KB Output is correct
9 Correct 652 ms 52300 KB Output is correct
10 Correct 634 ms 52336 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 1024 KB Output is correct
2 Correct 105 ms 5940 KB Output is correct
3 Correct 662 ms 52384 KB Output is correct
4 Correct 1362 ms 52424 KB Output is correct
5 Correct 544 ms 60212 KB Output is correct
6 Correct 1185 ms 103232 KB Output is correct
7 Correct 576 ms 54956 KB Output is correct
8 Correct 694 ms 52496 KB Output is correct
9 Correct 577 ms 52756 KB Output is correct
10 Correct 639 ms 57308 KB Output is correct
11 Correct 586 ms 75828 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 1352 KB Output is correct
2 Correct 74 ms 1332 KB Output is correct
3 Correct 117 ms 1336 KB Output is correct
4 Correct 157 ms 1384 KB Output is correct
5 Correct 255 ms 2124 KB Output is correct
6 Correct 920 ms 60548 KB Output is correct
7 Correct 1065 ms 60564 KB Output is correct
8 Correct 879 ms 60460 KB Output is correct
9 Correct 1694 ms 60564 KB Output is correct
10 Correct 887 ms 60568 KB Output is correct
11 Correct 840 ms 60560 KB Output is correct
12 Correct 814 ms 60564 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 340 KB Output is correct
2 Correct 14 ms 400 KB Output is correct
3 Correct 23 ms 340 KB Output is correct
4 Correct 14 ms 432 KB Output is correct
5 Correct 12 ms 404 KB Output is correct
6 Correct 23 ms 340 KB Output is correct
7 Correct 21 ms 400 KB Output is correct
8 Correct 20 ms 468 KB Output is correct
9 Correct 19 ms 340 KB Output is correct
10 Correct 22 ms 408 KB Output is correct
11 Correct 19 ms 408 KB Output is correct
12 Correct 13 ms 408 KB Output is correct
13 Correct 49 ms 1008 KB Output is correct
14 Correct 56 ms 1028 KB Output is correct
15 Correct 31 ms 1128 KB Output is correct
16 Correct 23 ms 1548 KB Output is correct
17 Correct 41 ms 1072 KB Output is correct
18 Correct 39 ms 1044 KB Output is correct
19 Correct 36 ms 1068 KB Output is correct
20 Correct 30 ms 1172 KB Output is correct
21 Correct 23 ms 1140 KB Output is correct
22 Correct 24 ms 1556 KB Output is correct
23 Correct 1356 ms 52420 KB Output is correct
24 Correct 709 ms 52452 KB Output is correct
25 Correct 645 ms 52416 KB Output is correct
26 Correct 578 ms 52400 KB Output is correct
27 Correct 611 ms 52296 KB Output is correct
28 Correct 567 ms 52344 KB Output is correct
29 Correct 633 ms 52496 KB Output is correct
30 Correct 636 ms 52300 KB Output is correct
31 Correct 652 ms 52300 KB Output is correct
32 Correct 634 ms 52336 KB Output is correct
33 Correct 46 ms 1024 KB Output is correct
34 Correct 105 ms 5940 KB Output is correct
35 Correct 662 ms 52384 KB Output is correct
36 Correct 1362 ms 52424 KB Output is correct
37 Correct 544 ms 60212 KB Output is correct
38 Correct 1185 ms 103232 KB Output is correct
39 Correct 576 ms 54956 KB Output is correct
40 Correct 694 ms 52496 KB Output is correct
41 Correct 577 ms 52756 KB Output is correct
42 Correct 639 ms 57308 KB Output is correct
43 Correct 586 ms 75828 KB Output is correct
44 Correct 49 ms 1352 KB Output is correct
45 Correct 74 ms 1332 KB Output is correct
46 Correct 117 ms 1336 KB Output is correct
47 Correct 157 ms 1384 KB Output is correct
48 Correct 255 ms 2124 KB Output is correct
49 Correct 920 ms 60548 KB Output is correct
50 Correct 1065 ms 60564 KB Output is correct
51 Correct 879 ms 60460 KB Output is correct
52 Correct 1694 ms 60564 KB Output is correct
53 Correct 887 ms 60568 KB Output is correct
54 Correct 840 ms 60560 KB Output is correct
55 Correct 814 ms 60564 KB Output is correct
56 Correct 95 ms 1356 KB Output is correct
57 Correct 225 ms 1296 KB Output is correct
58 Correct 362 ms 2060 KB Output is correct
59 Correct 1178 ms 52724 KB Output is correct
60 Correct 2147 ms 52776 KB Output is correct
61 Correct 1131 ms 52896 KB Output is correct
62 Correct 926 ms 56732 KB Output is correct
63 Correct 2062 ms 55352 KB Output is correct
64 Correct 1258 ms 53524 KB Output is correct
65 Correct 1076 ms 52852 KB Output is correct
66 Correct 1247 ms 53104 KB Output is correct
67 Correct 1266 ms 57448 KB Output is correct
68 Correct 975 ms 67048 KB Output is correct
69 Correct 1860 ms 76212 KB Output is correct