oj.uz

답안 #144350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144350 2019-08-16T17:26:49 Z Minnakhmetov 자리 배치 (IOI18_seats) C++14
100 / 100
 3954 ms 72184 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;
int dx[4] = { 0, 0, 1, 1 }, dy[4] = { 1, 0, 0, 1}, num[N * 4];
 
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 i = 0; i < 2; i++) {
		for (int j = 0; j < 2; j++) {
			anime[(i << 1) | j] = num[(a + i) * (m + 2) + b + 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 < 2; i++) {
		for (int j = 0; j < 2; j++) {
			upd2times2(a - i, b - j, 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;

	fill(num, num + N * 4, len);
 
	fill(ct, ct + len * 4, 1);
 
	for (int i = 0; i < len; i++) {
		x[i]++;
		y[i]++;
		num[x[i] * (m + 2) + 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] * (m + 2) + y[a]] = b;
	change(x[a], y[a], 1);
 
 
	change(x[b], y[b], -1);
	num[x[b] * (m + 2) + 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 26 ms 16120 KB Output is correct
2 Correct 32 ms 16120 KB Output is correct
3 Correct 45 ms 16120 KB Output is correct
4 Correct 33 ms 16248 KB Output is correct
5 Correct 28 ms 16120 KB Output is correct
6 Correct 41 ms 16120 KB Output is correct
7 Correct 43 ms 16120 KB Output is correct
8 Correct 39 ms 16092 KB Output is correct
9 Correct 39 ms 16092 KB Output is correct
10 Correct 43 ms 16120 KB Output is correct
11 Correct 40 ms 16092 KB Output is correct
12 Correct 30 ms 16120 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16120 KB Output is correct
2 Correct 32 ms 16120 KB Output is correct
3 Correct 45 ms 16120 KB Output is correct
4 Correct 33 ms 16248 KB Output is correct
5 Correct 28 ms 16120 KB Output is correct
6 Correct 41 ms 16120 KB Output is correct
7 Correct 43 ms 16120 KB Output is correct
8 Correct 39 ms 16092 KB Output is correct
9 Correct 39 ms 16092 KB Output is correct
10 Correct 43 ms 16120 KB Output is correct
11 Correct 40 ms 16092 KB Output is correct
12 Correct 30 ms 16120 KB Output is correct
13 Correct 91 ms 16728 KB Output is correct
14 Correct 112 ms 16760 KB Output is correct
15 Correct 67 ms 16732 KB Output is correct
16 Correct 46 ms 16760 KB Output is correct
17 Correct 81 ms 16632 KB Output is correct
18 Correct 69 ms 16760 KB Output is correct
19 Correct 66 ms 16632 KB Output is correct
20 Correct 58 ms 16760 KB Output is correct
21 Correct 52 ms 16752 KB Output is correct
22 Correct 48 ms 16760 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2611 ms 71600 KB Output is correct
2 Correct 1217 ms 71676 KB Output is correct
3 Correct 1041 ms 71632 KB Output is correct
4 Correct 860 ms 71672 KB Output is correct
5 Correct 963 ms 71808 KB Output is correct
6 Correct 845 ms 71848 KB Output is correct
7 Correct 950 ms 71788 KB Output is correct
8 Correct 1020 ms 71900 KB Output is correct
9 Correct 1033 ms 71528 KB Output is correct
10 Correct 996 ms 71672 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 16760 KB Output is correct
2 Correct 189 ms 21704 KB Output is correct
3 Correct 933 ms 71660 KB Output is correct
4 Correct 2598 ms 71652 KB Output is correct
5 Correct 800 ms 71644 KB Output is correct
6 Correct 2296 ms 71648 KB Output is correct
7 Correct 884 ms 71800 KB Output is correct
8 Correct 1282 ms 71724 KB Output is correct
9 Correct 1035 ms 71680 KB Output is correct
10 Correct 999 ms 71724 KB Output is correct
11 Correct 902 ms 70792 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 17080 KB Output is correct
2 Correct 109 ms 17076 KB Output is correct
3 Correct 174 ms 17140 KB Output is correct
4 Correct 235 ms 17140 KB Output is correct
5 Correct 418 ms 17788 KB Output is correct
6 Correct 1339 ms 72072 KB Output is correct
7 Correct 1692 ms 71948 KB Output is correct
8 Correct 1285 ms 72056 KB Output is correct
9 Correct 3351 ms 72080 KB Output is correct
10 Correct 1205 ms 71956 KB Output is correct
11 Correct 1224 ms 72108 KB Output is correct
12 Correct 1134 ms 72056 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16120 KB Output is correct
2 Correct 32 ms 16120 KB Output is correct
3 Correct 45 ms 16120 KB Output is correct
4 Correct 33 ms 16248 KB Output is correct
5 Correct 28 ms 16120 KB Output is correct
6 Correct 41 ms 16120 KB Output is correct
7 Correct 43 ms 16120 KB Output is correct
8 Correct 39 ms 16092 KB Output is correct
9 Correct 39 ms 16092 KB Output is correct
10 Correct 43 ms 16120 KB Output is correct
11 Correct 40 ms 16092 KB Output is correct
12 Correct 30 ms 16120 KB Output is correct
13 Correct 91 ms 16728 KB Output is correct
14 Correct 112 ms 16760 KB Output is correct
15 Correct 67 ms 16732 KB Output is correct
16 Correct 46 ms 16760 KB Output is correct
17 Correct 81 ms 16632 KB Output is correct
18 Correct 69 ms 16760 KB Output is correct
19 Correct 66 ms 16632 KB Output is correct
20 Correct 58 ms 16760 KB Output is correct
21 Correct 52 ms 16752 KB Output is correct
22 Correct 48 ms 16760 KB Output is correct
23 Correct 2611 ms 71600 KB Output is correct
24 Correct 1217 ms 71676 KB Output is correct
25 Correct 1041 ms 71632 KB Output is correct
26 Correct 860 ms 71672 KB Output is correct
27 Correct 963 ms 71808 KB Output is correct
28 Correct 845 ms 71848 KB Output is correct
29 Correct 950 ms 71788 KB Output is correct
30 Correct 1020 ms 71900 KB Output is correct
31 Correct 1033 ms 71528 KB Output is correct
32 Correct 996 ms 71672 KB Output is correct
33 Correct 88 ms 16760 KB Output is correct
34 Correct 189 ms 21704 KB Output is correct
35 Correct 933 ms 71660 KB Output is correct
36 Correct 2598 ms 71652 KB Output is correct
37 Correct 800 ms 71644 KB Output is correct
38 Correct 2296 ms 71648 KB Output is correct
39 Correct 884 ms 71800 KB Output is correct
40 Correct 1282 ms 71724 KB Output is correct
41 Correct 1035 ms 71680 KB Output is correct
42 Correct 999 ms 71724 KB Output is correct
43 Correct 902 ms 70792 KB Output is correct
44 Correct 61 ms 17080 KB Output is correct
45 Correct 109 ms 17076 KB Output is correct
46 Correct 174 ms 17140 KB Output is correct
47 Correct 235 ms 17140 KB Output is correct
48 Correct 418 ms 17788 KB Output is correct
49 Correct 1339 ms 72072 KB Output is correct
50 Correct 1692 ms 71948 KB Output is correct
51 Correct 1285 ms 72056 KB Output is correct
52 Correct 3351 ms 72080 KB Output is correct
53 Correct 1205 ms 71956 KB Output is correct
54 Correct 1224 ms 72108 KB Output is correct
55 Correct 1134 ms 72056 KB Output is correct
56 Correct 134 ms 17060 KB Output is correct
57 Correct 327 ms 17064 KB Output is correct
58 Correct 536 ms 17684 KB Output is correct
59 Correct 1864 ms 72184 KB Output is correct
60 Correct 3954 ms 71972 KB Output is correct
61 Correct 1687 ms 72112 KB Output is correct
62 Correct 1314 ms 71988 KB Output is correct
63 Correct 3853 ms 72056 KB Output is correct
64 Correct 2429 ms 72184 KB Output is correct
65 Correct 1766 ms 72096 KB Output is correct
66 Correct 1963 ms 71876 KB Output is correct
67 Correct 2047 ms 72056 KB Output is correct
68 Correct 1460 ms 72184 KB Output is correct
69 Correct 3332 ms 72000 KB Output is correct