oj.uz

Submission #78702

# Submission time Handle Problem Language Result Execution time Memory
78702 2018-10-07T20:51:41 Z tincamatei Seats (IOI18_seats) C++14
70 / 100
 4000 ms 90196 KB 
#include "seats.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000000;

int val[1+4*MAX_N], fr[1+4*MAX_N];
int lazy[1+4*MAX_N];

static inline void pushLazy(int nod, int l, int r) {
	val[nod] += lazy[nod];
	if(l < r) {
		lazy[2 * nod] += lazy[nod];
		lazy[2 * nod + 1] += lazy[nod];
	}
	lazy[nod] = 0;
}

void init(int l, int r, int nod = 1) {
	if(l == r) {
		val[nod] = 0;
		fr[nod] = 1;
	}
	else if(l < r){
		int mid = (l + r) / 2;
		init(l, mid, 2 * nod);
		init(mid + 1, r, 2 * nod + 1);
		val[nod] = 0;
		fr[nod] = fr[2 * nod] + fr[2 * nod + 1];
	}
}

void update(int i, int j, int valU, int l, int r, int nod = 1) {
	val[nod] += lazy[nod];
	if(l < r) {
		lazy[2 * nod] += lazy[nod];
		lazy[2 * nod + 1] += lazy[nod];
	}
	lazy[nod] = 0;
	if(r < i || j < l || j < i || r < l)
		return;
	
	int mid = (l + r) / 2;
		if(i <= l && r <= j) {
			lazy[nod] += valU;
		val[nod] += lazy[nod];
		if(l < r) {
			lazy[2 * nod] += lazy[nod];
			lazy[2 * nod + 1] += lazy[nod];
		}
		lazy[nod] = 0;
	} else {
		update(i, j, valU, l, mid, 2 * nod);
		update(i, j, valU, mid + 1, r, 2 * nod + 1);
		val[nod] = val[2 * nod], fr[nod] = fr[2 * nod];
		if(val[2 * nod + 1] < val[nod])
			val[nod] = val[2 * nod + 1], fr[nod] = fr[2 * nod + 1];
		else if(val[nod] == val[2 * nod + 1])
			fr[nod] += fr[2 * nod + 1];
	}
}

int N;
int cells[4];
int **matr;

vector<int> R, C;

static inline void activateSqr(int l, int c, int x) {
	cells[0] = matr[l][c];
	cells[1] = matr[l + 1][c];
	cells[2] = matr[l][c + 1];
	cells[3] = matr[l + 1][c + 1];
	std::sort(cells, cells + 4);
	update(cells[0], cells[1] - 1, x, 0, N - 1);
	update(cells[2], cells[3] - 1, 4 * x, 0, N - 1);
}

static inline void activateCells(int l, int c, int x) {
	activateSqr(l, c, x);
	activateSqr(l - 1, c, x);
	activateSqr(l, c - 1, x);
	activateSqr(l - 1, c - 1, x);
}

void give_initial_chart(int H, int W, std::vector<int> _R, std::vector<int> _C) {
	N = H * W;
	init(0, N - 1, 1);
	R = _R;
	C = _C;
	matr = new int*[1 + H + 1];
	for(int i = 0; i <= H + 1; ++i) {
		matr[i] = new int[1 + W + 1];
		for(int j = 0; j <= W + 1; ++j)
			matr[i][j] = N;
	}

	for(int i = 0; i < N; ++i) {
		R[i]++;
		C[i]++;
		matr[R[i]][C[i]] = i;
	}
	for(int i = 0; i <= H; ++i)
		for(int j = 0; j <= W; ++j)
			activateSqr(i, j, 1);
}

int swap_seats(int a, int b) {
	activateCells(R[a], C[a], -1);
	activateCells(R[b], C[b], -1);
	swap(R[a], R[b]);
	swap(C[a], C[b]);
	swap(matr[R[a]][C[a]], matr[R[b]][C[b]]);
	activateCells(R[a], C[a], 1);
	activateCells(R[b], C[b], 1);
	
	if(val[1] != 4)
		return 0;
	return fr[1];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 29 ms 732 KB Output is correct
3 Correct 42 ms 732 KB Output is correct
4 Correct 48 ms 732 KB Output is correct
5 Correct 23 ms 732 KB Output is correct
6 Correct 35 ms 732 KB Output is correct
7 Correct 38 ms 732 KB Output is correct
8 Correct 37 ms 732 KB Output is correct
9 Correct 36 ms 740 KB Output is correct
10 Correct 39 ms 796 KB Output is correct
11 Correct 35 ms 804 KB Output is correct
12 Correct 23 ms 804 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 29 ms 732 KB Output is correct
3 Correct 42 ms 732 KB Output is correct
4 Correct 48 ms 732 KB Output is correct
5 Correct 23 ms 732 KB Output is correct
6 Correct 35 ms 732 KB Output is correct
7 Correct 38 ms 732 KB Output is correct
8 Correct 37 ms 732 KB Output is correct
9 Correct 36 ms 740 KB Output is correct
10 Correct 39 ms 796 KB Output is correct
11 Correct 35 ms 804 KB Output is correct
12 Correct 23 ms 804 KB Output is correct
13 Correct 91 ms 1460 KB Output is correct
14 Correct 113 ms 1592 KB Output is correct
15 Correct 65 ms 1748 KB Output is correct
16 Correct 52 ms 1816 KB Output is correct
17 Correct 77 ms 1816 KB Output is correct
18 Correct 78 ms 1816 KB Output is correct
19 Correct 79 ms 1816 KB Output is correct
20 Correct 60 ms 1816 KB Output is correct
21 Correct 58 ms 1816 KB Output is correct
22 Correct 50 ms 1816 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2775 ms 54980 KB Output is correct
2 Correct 1528 ms 54980 KB Output is correct
3 Correct 1461 ms 54984 KB Output is correct
4 Correct 1239 ms 54984 KB Output is correct
5 Correct 1295 ms 54996 KB Output is correct
6 Correct 1196 ms 54996 KB Output is correct
7 Correct 1362 ms 55000 KB Output is correct
8 Correct 1458 ms 55000 KB Output is correct
9 Correct 1481 ms 55000 KB Output is correct
10 Correct 1440 ms 55000 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 55000 KB Output is correct
2 Correct 234 ms 55000 KB Output is correct
3 Correct 1283 ms 55000 KB Output is correct
4 Correct 2941 ms 55000 KB Output is correct
5 Correct 1179 ms 62804 KB Output is correct
6 Correct 2738 ms 90196 KB Output is correct
7 Correct 1299 ms 90196 KB Output is correct
8 Correct 1499 ms 90196 KB Output is correct
9 Correct 1534 ms 90196 KB Output is correct
10 Correct 1511 ms 90196 KB Output is correct
11 Correct 1260 ms 90196 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 90196 KB Output is correct
2 Correct 135 ms 90196 KB Output is correct
3 Correct 214 ms 90196 KB Output is correct
4 Correct 287 ms 90196 KB Output is correct
5 Correct 468 ms 90196 KB Output is correct
6 Correct 1855 ms 90196 KB Output is correct
7 Correct 2180 ms 90196 KB Output is correct
8 Correct 1837 ms 90196 KB Output is correct
9 Correct 3833 ms 90196 KB Output is correct
10 Correct 1759 ms 90196 KB Output is correct
11 Correct 2094 ms 90196 KB Output is correct
12 Correct 1671 ms 90196 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 504 KB Output is correct
2 Correct 29 ms 732 KB Output is correct
3 Correct 42 ms 732 KB Output is correct
4 Correct 48 ms 732 KB Output is correct
5 Correct 23 ms 732 KB Output is correct
6 Correct 35 ms 732 KB Output is correct
7 Correct 38 ms 732 KB Output is correct
8 Correct 37 ms 732 KB Output is correct
9 Correct 36 ms 740 KB Output is correct
10 Correct 39 ms 796 KB Output is correct
11 Correct 35 ms 804 KB Output is correct
12 Correct 23 ms 804 KB Output is correct
13 Correct 91 ms 1460 KB Output is correct
14 Correct 113 ms 1592 KB Output is correct
15 Correct 65 ms 1748 KB Output is correct
16 Correct 52 ms 1816 KB Output is correct
17 Correct 77 ms 1816 KB Output is correct
18 Correct 78 ms 1816 KB Output is correct
19 Correct 79 ms 1816 KB Output is correct
20 Correct 60 ms 1816 KB Output is correct
21 Correct 58 ms 1816 KB Output is correct
22 Correct 50 ms 1816 KB Output is correct
23 Correct 2775 ms 54980 KB Output is correct
24 Correct 1528 ms 54980 KB Output is correct
25 Correct 1461 ms 54984 KB Output is correct
26 Correct 1239 ms 54984 KB Output is correct
27 Correct 1295 ms 54996 KB Output is correct
28 Correct 1196 ms 54996 KB Output is correct
29 Correct 1362 ms 55000 KB Output is correct
30 Correct 1458 ms 55000 KB Output is correct
31 Correct 1481 ms 55000 KB Output is correct
32 Correct 1440 ms 55000 KB Output is correct
33 Correct 89 ms 55000 KB Output is correct
34 Correct 234 ms 55000 KB Output is correct
35 Correct 1283 ms 55000 KB Output is correct
36 Correct 2941 ms 55000 KB Output is correct
37 Correct 1179 ms 62804 KB Output is correct
38 Correct 2738 ms 90196 KB Output is correct
39 Correct 1299 ms 90196 KB Output is correct
40 Correct 1499 ms 90196 KB Output is correct
41 Correct 1534 ms 90196 KB Output is correct
42 Correct 1511 ms 90196 KB Output is correct
43 Correct 1260 ms 90196 KB Output is correct
44 Correct 68 ms 90196 KB Output is correct
45 Correct 135 ms 90196 KB Output is correct
46 Correct 214 ms 90196 KB Output is correct
47 Correct 287 ms 90196 KB Output is correct
48 Correct 468 ms 90196 KB Output is correct
49 Correct 1855 ms 90196 KB Output is correct
50 Correct 2180 ms 90196 KB Output is correct
51 Correct 1837 ms 90196 KB Output is correct
52 Correct 3833 ms 90196 KB Output is correct
53 Correct 1759 ms 90196 KB Output is correct
54 Correct 2094 ms 90196 KB Output is correct
55 Correct 1671 ms 90196 KB Output is correct
56 Correct 173 ms 90196 KB Output is correct
57 Correct 395 ms 90196 KB Output is correct
58 Correct 681 ms 90196 KB Output is correct
59 Correct 2466 ms 90196 KB Output is correct
60 Execution timed out 4043 ms 90196 KB Time limit exceeded
61 Halted 0 ms 0 KB -