oj.uz

답안 #144346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144346 2019-08-16T17:15:21 Z Minnakhmetov 자리 배치 (IOI18_seats) C++14
100 / 100
 3995 ms 112064 KB 
#include "seats.h"
#include<bits/stdc++.h>
 
#pragma GCC optimize("Ofast")
 
using namespace std;
 
const int N = 1e6 + 5, INF = 1e9, G = 5;
int n, m, len;
vector<int> x, y;
vector<int> num[N];
int dx[4] = { 0, 0, 1, 1 }, dy[4] = { 1, 0, 0, 1};
 
int mn[N * 4], ct[N * 4], up[N * 4];
 
void push(int v, int L, int R) {
	if (up[v]) {
		if (L != R) {
			up[v * 2] += up[v];
			up[v * 2 + 1] += up[v];
		}
		mn[v] += up[v];
		up[v] = 0;
	}
}
 
void upd(int l, int r, int x, int v, int L, int R) {
	push(v, L, R);
	if (l > r)
		return;
	if (l == L && r == R) {
		up[v] += x;
		push(v, L, R);
	}
	else {
		int m = (L + R) >> 1;
		upd(l, min(m, r), x, v * 2, L, m);
		upd(max(m + 1, l), r, x, v * 2 + 1, m + 1, R);
 
		if (mn[v * 2] == mn[v * 2 + 1]) {
			mn[v] = mn[v * 2];
			ct[v] = ct[v * 2] + ct[v * 2 + 1];
		}
		else if (mn[v * 2] < mn[v * 2 + 1]) {
			mn[v] = mn[v * 2];
			ct[v] = ct[v * 2];
		}
		else {
			mn[v] = mn[v * 2 + 1];
			ct[v] = ct[v * 2 + 1];	
		}
	}
}
 
int anime[4];
 
void upd2times2(int a, int b, int d) {
	for (int j = 0; j < 4; j++) {
		anime[j] = num[a + dx[j]][b + dy[j]];
	}	
 
	sort(anime, anime + 4);
 
	upd(anime[0], anime[1] - 1, d, 1, 0, len - 1);
	upd(anime[2], anime[3] - 1, d * G, 1, 0, len - 1);
}
 
void change(int a, int b, int d) {
	for (int i = 0; i < 4; i++) {
		upd2times2(a - dx[i], b - dy[i], d);
	}
}
 
// void que(int v, int L, int R) {
// 	push(v, L, R);
// 	if (L == R) {
// 		cout << t[v].mn << " ";
// 	}
// 	else {
// 		int m = (L + R) >> 1;
// 		que(v * 2, L, m);
// 		que(v * 2 + 1, m + 1, R);
// 	}
// }
 
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	n = H;
	m = W;
	x = R;
	y = C;
 
	len = n * m;
 
	for (int i = 0; i < n + 2; i++)
		num[i].resize(m + 2, len);
 
	fill(ct, ct + len * 4, 1);
 
	for (int i = 0; i < len; i++) {
		x[i]++;
		y[i]++;
		num[x[i]][y[i]] = i;
	}
 
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			upd2times2(i, j, 1);
		}
	}
}
 
int swap_seats(int a, int b) {
	change(x[a], y[a], -1);
	num[x[a]][y[a]] = b;
	change(x[a], y[a], 1);
 
 
	change(x[b], y[b], -1);
	num[x[b]][y[b]] = a;
	change(x[b], y[b], 1);
 
	swap(x[a], x[b]);
	swap(y[a], y[b]);
 
	push(1, 0, len - 1);
	return mn[1] == 4 ? ct[1] : 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 23928 KB Output is correct
2 Correct 45 ms 24056 KB Output is correct
3 Correct 58 ms 23928 KB Output is correct
4 Correct 45 ms 23928 KB Output is correct
5 Correct 41 ms 23928 KB Output is correct
6 Correct 53 ms 23980 KB Output is correct
7 Correct 55 ms 23928 KB Output is correct
8 Correct 51 ms 23928 KB Output is correct
9 Correct 51 ms 23928 KB Output is correct
10 Correct 55 ms 24056 KB Output is correct
11 Correct 54 ms 23900 KB Output is correct
12 Correct 41 ms 23928 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 23928 KB Output is correct
2 Correct 45 ms 24056 KB Output is correct
3 Correct 58 ms 23928 KB Output is correct
4 Correct 45 ms 23928 KB Output is correct
5 Correct 41 ms 23928 KB Output is correct
6 Correct 53 ms 23980 KB Output is correct
7 Correct 55 ms 23928 KB Output is correct
8 Correct 51 ms 23928 KB Output is correct
9 Correct 51 ms 23928 KB Output is correct
10 Correct 55 ms 24056 KB Output is correct
11 Correct 54 ms 23900 KB Output is correct
12 Correct 41 ms 23928 KB Output is correct
13 Correct 106 ms 24620 KB Output is correct
14 Correct 118 ms 24568 KB Output is correct
15 Correct 78 ms 24696 KB Output is correct
16 Correct 58 ms 24828 KB Output is correct
17 Correct 92 ms 24624 KB Output is correct
18 Correct 81 ms 24568 KB Output is correct
19 Correct 89 ms 24568 KB Output is correct
20 Correct 72 ms 24824 KB Output is correct
21 Correct 59 ms 24696 KB Output is correct
22 Correct 62 ms 24904 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2575 ms 83412 KB Output is correct
2 Correct 1254 ms 83392 KB Output is correct
3 Correct 1079 ms 83448 KB Output is correct
4 Correct 885 ms 83572 KB Output is correct
5 Correct 989 ms 83400 KB Output is correct
6 Correct 856 ms 83420 KB Output is correct
7 Correct 983 ms 83412 KB Output is correct
8 Correct 1043 ms 83528 KB Output is correct
9 Correct 1046 ms 83420 KB Output is correct
10 Correct 1002 ms 83420 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 24568 KB Output is correct
2 Correct 209 ms 29816 KB Output is correct
3 Correct 964 ms 83448 KB Output is correct
4 Correct 2585 ms 83452 KB Output is correct
5 Correct 816 ms 91332 KB Output is correct
6 Correct 2435 ms 110968 KB Output is correct
7 Correct 896 ms 86008 KB Output is correct
8 Correct 1184 ms 83704 KB Output is correct
9 Correct 1026 ms 83704 KB Output is correct
10 Correct 1014 ms 85704 KB Output is correct
11 Correct 948 ms 94156 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 24888 KB Output is correct
2 Correct 136 ms 24948 KB Output is correct
3 Correct 197 ms 24820 KB Output is correct
4 Correct 261 ms 24948 KB Output is correct
5 Correct 428 ms 25700 KB Output is correct
6 Correct 1369 ms 91764 KB Output is correct
7 Correct 1731 ms 91476 KB Output is correct
8 Correct 1302 ms 91480 KB Output is correct
9 Correct 3385 ms 91640 KB Output is correct
10 Correct 1264 ms 91640 KB Output is correct
11 Correct 1267 ms 91596 KB Output is correct
12 Correct 1188 ms 91536 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 23928 KB Output is correct
2 Correct 45 ms 24056 KB Output is correct
3 Correct 58 ms 23928 KB Output is correct
4 Correct 45 ms 23928 KB Output is correct
5 Correct 41 ms 23928 KB Output is correct
6 Correct 53 ms 23980 KB Output is correct
7 Correct 55 ms 23928 KB Output is correct
8 Correct 51 ms 23928 KB Output is correct
9 Correct 51 ms 23928 KB Output is correct
10 Correct 55 ms 24056 KB Output is correct
11 Correct 54 ms 23900 KB Output is correct
12 Correct 41 ms 23928 KB Output is correct
13 Correct 106 ms 24620 KB Output is correct
14 Correct 118 ms 24568 KB Output is correct
15 Correct 78 ms 24696 KB Output is correct
16 Correct 58 ms 24828 KB Output is correct
17 Correct 92 ms 24624 KB Output is correct
18 Correct 81 ms 24568 KB Output is correct
19 Correct 89 ms 24568 KB Output is correct
20 Correct 72 ms 24824 KB Output is correct
21 Correct 59 ms 24696 KB Output is correct
22 Correct 62 ms 24904 KB Output is correct
23 Correct 2575 ms 83412 KB Output is correct
24 Correct 1254 ms 83392 KB Output is correct
25 Correct 1079 ms 83448 KB Output is correct
26 Correct 885 ms 83572 KB Output is correct
27 Correct 989 ms 83400 KB Output is correct
28 Correct 856 ms 83420 KB Output is correct
29 Correct 983 ms 83412 KB Output is correct
30 Correct 1043 ms 83528 KB Output is correct
31 Correct 1046 ms 83420 KB Output is correct
32 Correct 1002 ms 83420 KB Output is correct
33 Correct 101 ms 24568 KB Output is correct
34 Correct 209 ms 29816 KB Output is correct
35 Correct 964 ms 83448 KB Output is correct
36 Correct 2585 ms 83452 KB Output is correct
37 Correct 816 ms 91332 KB Output is correct
38 Correct 2435 ms 110968 KB Output is correct
39 Correct 896 ms 86008 KB Output is correct
40 Correct 1184 ms 83704 KB Output is correct
41 Correct 1026 ms 83704 KB Output is correct
42 Correct 1014 ms 85704 KB Output is correct
43 Correct 948 ms 94156 KB Output is correct
44 Correct 74 ms 24888 KB Output is correct
45 Correct 136 ms 24948 KB Output is correct
46 Correct 197 ms 24820 KB Output is correct
47 Correct 261 ms 24948 KB Output is correct
48 Correct 428 ms 25700 KB Output is correct
49 Correct 1369 ms 91764 KB Output is correct
50 Correct 1731 ms 91476 KB Output is correct
51 Correct 1302 ms 91480 KB Output is correct
52 Correct 3385 ms 91640 KB Output is correct
53 Correct 1264 ms 91640 KB Output is correct
54 Correct 1267 ms 91596 KB Output is correct
55 Correct 1188 ms 91536 KB Output is correct
56 Correct 157 ms 24856 KB Output is correct
57 Correct 365 ms 24852 KB Output is correct
58 Correct 572 ms 25588 KB Output is correct
59 Correct 1882 ms 83804 KB Output is correct
60 Correct 3995 ms 83704 KB Output is correct
61 Correct 1744 ms 100344 KB Output is correct
62 Correct 1351 ms 104312 KB Output is correct
63 Correct 3890 ms 102980 KB Output is correct
64 Correct 2147 ms 101240 KB Output is correct
65 Correct 1845 ms 100420 KB Output is correct
66 Correct 2027 ms 100372 KB Output is correct
67 Correct 2119 ms 102840 KB Output is correct
68 Correct 1536 ms 106952 KB Output is correct
69 Correct 3485 ms 112064 KB Output is correct