oj.uz

답안 #206364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
206364 2020-03-03T04:55:45 Z batmend 자리 배치 (IOI18_seats) C++14
100 / 100
 3380 ms 69592 KB 
#include "seats.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 1000005;

int n, m, k;
int posx[N], posy[N];
int num[N];
int minv[2100000], minc[2100000], lazy[2100000];						// initial values are 0, thus, minv is 0 for every val;
int a[5];

void build(int id, int l, int r);
int get(int x, int y);
void supd(int id, int l, int r, int ll, int rr, int val);
void upd(int x, int y, int v);
void change(int x, int y, int v);

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	n = H;
	m = W;
	k = H * W;
	build(1, 0, k - 1);    			// initially every val is 0;
	for (int i = 0; i < k ; i++) {
		posy[i] = R[i];
		posx[i] = C[i];
		num[posy[i]*m+posx[i]]=i;
	}
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			upd(j, i, 1);
		}
	}
}

int swap_seats(int a, int b) {
	change(posx[a], posy[a], b);
	change(posx[b], posy[b], a);
	swap(posx[a], posx[b]);
	swap(posy[a], posy[b]);
	return minc[1];
}

void change(int x, int y, int v) {
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			upd(x+i, y+j, -1);
		}
	}
	num[y * m + x] = v;
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			upd(x+i, y+j, 1);
		}
	}
}

void build(int id, int l, int r) {
	minc[id] = r - l + 1;
	if (r == l) return;
	int mid = (l + r) / 2;
	build(2 * id, l, mid);
	build(2 * id + 1, mid + 1, r);
}

int get(int x, int y) {
	if (x < 0 || x >= m || y < 0 || y >= n) return k;
	return num[y * m + x];
}

void supd(int id, int l, int r, int ll, int rr, int v) {
	if (l > rr || r < ll) return;
	if (ll <= l && r <= rr) {
		lazy[id] += v;
		minv[id] += v;
		return;
	}
	int mid = (l + r) / 2;
	supd(2*id, l, mid, ll, rr, v);
	supd(2*id + 1, mid + 1, r, ll, rr, v);
	if (minv[2*id] > minv[2*id+1]) {
		minv[id] = minv[2*id+1];
		minc[id] = minc[2*id+1];
	}
	if (minv[2*id] < minv[2*id+1]) {
		minv[id] = minv[2*id];
		minc[id] = minc[2*id];
	}
	if (minv[2*id] == minv[2*id + 1]) {
		minv[id] = minv[2*id];
		minc[id] = minc[2*id] + minc[2*id + 1];
	}
	minv[id] += lazy[id];
}

void upd(int x, int y, int v) {
	for (int i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			a[2 * i + j] = get(x - i, y - j);
		}
	}
	sort (a, a + 4);
	if (a[0] < a[1]) supd(1, 0, k - 1, a[0], a[1] - 1, v);
	if (a[2] < a[3]) supd(1, 0, k - 1, a[2], a[3] - 1, v);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 504 KB Output is correct
2 Correct 23 ms 504 KB Output is correct
3 Correct 35 ms 504 KB Output is correct
4 Correct 22 ms 504 KB Output is correct
5 Correct 19 ms 504 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 33 ms 504 KB Output is correct
8 Correct 30 ms 632 KB Output is correct
9 Correct 30 ms 632 KB Output is correct
10 Correct 33 ms 632 KB Output is correct
11 Correct 30 ms 504 KB Output is correct
12 Correct 21 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 504 KB Output is correct
2 Correct 23 ms 504 KB Output is correct
3 Correct 35 ms 504 KB Output is correct
4 Correct 22 ms 504 KB Output is correct
5 Correct 19 ms 504 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 33 ms 504 KB Output is correct
8 Correct 30 ms 632 KB Output is correct
9 Correct 30 ms 632 KB Output is correct
10 Correct 33 ms 632 KB Output is correct
11 Correct 30 ms 504 KB Output is correct
12 Correct 21 ms 504 KB Output is correct
13 Correct 75 ms 1272 KB Output is correct
14 Correct 88 ms 1272 KB Output is correct
15 Correct 51 ms 1272 KB Output is correct
16 Correct 37 ms 1272 KB Output is correct
17 Correct 64 ms 1272 KB Output is correct
18 Correct 64 ms 1272 KB Output is correct
19 Correct 54 ms 1272 KB Output is correct
20 Correct 49 ms 1272 KB Output is correct
21 Correct 39 ms 1276 KB Output is correct
22 Correct 39 ms 1272 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2196 ms 52600 KB Output is correct
2 Correct 1218 ms 52600 KB Output is correct
3 Correct 1112 ms 52728 KB Output is correct
4 Correct 953 ms 52664 KB Output is correct
5 Correct 1012 ms 52600 KB Output is correct
6 Correct 958 ms 52600 KB Output is correct
7 Correct 1036 ms 52624 KB Output is correct
8 Correct 1096 ms 52628 KB Output is correct
9 Correct 1117 ms 52600 KB Output is correct
10 Correct 1064 ms 52600 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 1272 KB Output is correct
2 Correct 176 ms 6136 KB Output is correct
3 Correct 968 ms 52600 KB Output is correct
4 Correct 2236 ms 52600 KB Output is correct
5 Correct 901 ms 50556 KB Output is correct
6 Correct 1893 ms 68600 KB Output is correct
7 Correct 963 ms 67964 KB Output is correct
8 Correct 1162 ms 68344 KB Output is correct
9 Correct 1161 ms 67704 KB Output is correct
10 Correct 1103 ms 68440 KB Output is correct
11 Correct 986 ms 67576 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 1524 KB Output is correct
2 Correct 103 ms 1524 KB Output is correct
3 Correct 160 ms 2164 KB Output is correct
4 Correct 223 ms 2164 KB Output is correct
5 Correct 348 ms 2808 KB Output is correct
6 Correct 1390 ms 68472 KB Output is correct
7 Correct 1606 ms 69368 KB Output is correct
8 Correct 1359 ms 67448 KB Output is correct
9 Correct 2637 ms 69592 KB Output is correct
10 Correct 1349 ms 68344 KB Output is correct
11 Correct 1339 ms 68472 KB Output is correct
12 Correct 1262 ms 67396 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 504 KB Output is correct
2 Correct 23 ms 504 KB Output is correct
3 Correct 35 ms 504 KB Output is correct
4 Correct 22 ms 504 KB Output is correct
5 Correct 19 ms 504 KB Output is correct
6 Correct 31 ms 504 KB Output is correct
7 Correct 33 ms 504 KB Output is correct
8 Correct 30 ms 632 KB Output is correct
9 Correct 30 ms 632 KB Output is correct
10 Correct 33 ms 632 KB Output is correct
11 Correct 30 ms 504 KB Output is correct
12 Correct 21 ms 504 KB Output is correct
13 Correct 75 ms 1272 KB Output is correct
14 Correct 88 ms 1272 KB Output is correct
15 Correct 51 ms 1272 KB Output is correct
16 Correct 37 ms 1272 KB Output is correct
17 Correct 64 ms 1272 KB Output is correct
18 Correct 64 ms 1272 KB Output is correct
19 Correct 54 ms 1272 KB Output is correct
20 Correct 49 ms 1272 KB Output is correct
21 Correct 39 ms 1276 KB Output is correct
22 Correct 39 ms 1272 KB Output is correct
23 Correct 2196 ms 52600 KB Output is correct
24 Correct 1218 ms 52600 KB Output is correct
25 Correct 1112 ms 52728 KB Output is correct
26 Correct 953 ms 52664 KB Output is correct
27 Correct 1012 ms 52600 KB Output is correct
28 Correct 958 ms 52600 KB Output is correct
29 Correct 1036 ms 52624 KB Output is correct
30 Correct 1096 ms 52628 KB Output is correct
31 Correct 1117 ms 52600 KB Output is correct
32 Correct 1064 ms 52600 KB Output is correct
33 Correct 71 ms 1272 KB Output is correct
34 Correct 176 ms 6136 KB Output is correct
35 Correct 968 ms 52600 KB Output is correct
36 Correct 2236 ms 52600 KB Output is correct
37 Correct 901 ms 50556 KB Output is correct
38 Correct 1893 ms 68600 KB Output is correct
39 Correct 963 ms 67964 KB Output is correct
40 Correct 1162 ms 68344 KB Output is correct
41 Correct 1161 ms 67704 KB Output is correct
42 Correct 1103 ms 68440 KB Output is correct
43 Correct 986 ms 67576 KB Output is correct
44 Correct 69 ms 1524 KB Output is correct
45 Correct 103 ms 1524 KB Output is correct
46 Correct 160 ms 2164 KB Output is correct
47 Correct 223 ms 2164 KB Output is correct
48 Correct 348 ms 2808 KB Output is correct
49 Correct 1390 ms 68472 KB Output is correct
50 Correct 1606 ms 69368 KB Output is correct
51 Correct 1359 ms 67448 KB Output is correct
52 Correct 2637 ms 69592 KB Output is correct
53 Correct 1349 ms 68344 KB Output is correct
54 Correct 1339 ms 68472 KB Output is correct
55 Correct 1262 ms 67396 KB Output is correct
56 Correct 131 ms 2164 KB Output is correct
57 Correct 315 ms 2164 KB Output is correct
58 Correct 518 ms 2860 KB Output is correct
59 Correct 1890 ms 69276 KB Output is correct
60 Correct 3380 ms 69364 KB Output is correct
61 Correct 1705 ms 69496 KB Output is correct
62 Correct 1399 ms 67444 KB Output is correct
63 Correct 3139 ms 69376 KB Output is correct
64 Correct 1955 ms 69496 KB Output is correct
65 Correct 1742 ms 69492 KB Output is correct
66 Correct 2023 ms 68728 KB Output is correct
67 Correct 1928 ms 69236 KB Output is correct
68 Correct 1490 ms 68992 KB Output is correct
69 Correct 2780 ms 69496 KB Output is correct