oj.uz

Submission #78705

# Submission time Handle Problem Language Result Execution time Memory
78705 2018-10-07T21:28:13 Z tincamatei Seats (IOI18_seats) C++14
70 / 100
 4000 ms 88492 KB 
#pragma GCC target("avx,avx2,sse,sse2")
#pragma GCC optimize("Ofast")
#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) {
	if(lazy[nod] != 0) {
		val[nod] += lazy[nod];
		if(l < r) {
			lazy[2 * nod] += lazy[nod];
			lazy[2 * nod + 1] += lazy[nod];
		}
		lazy[nod] = 0;
	}
}

inline 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];
	}
}

inline void update(int i, int j, int valU, int l, int r, int nod = 1) {
	pushLazy(nod, l, r);
	if(r < i || j < l)
		return;
	
	int mid = (l + r) / 2;
	if(i <= l && r <= j) {
		lazy[nod] += valU;
		pushLazy(nod, l, r);
	} 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);
}

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 dr[] = {0,-1, 0, -1};
int dc[] = {0, 0,-1, -1};

int swap_seats(int a, int b) {
	vector<pair<int, int> > yeet;
	for(int i = 0; i < 4; ++i) {
		yeet.push_back(make_pair(R[a] + dr[i], C[a] + dc[i]));
		yeet.push_back(make_pair(R[b] + dr[i], C[b] + dc[i]));
	}
	std::sort(yeet.begin(), yeet.end());
	
	for(int i = 0; i < yeet.size(); ++i) {
		if(i < yeet.size() - 1 && yeet[i] != yeet[i + 1])
			activateSqr(yeet[i].first, yeet[i].second, -1);
		else if(i == yeet.size() - 1)
			activateSqr(yeet[i].first, yeet[i].second, -1);
	}
	swap(R[a], R[b]);
	swap(C[a], C[b]);
	swap(matr[R[a]][C[a]], matr[R[b]][C[b]]);
	for(int i = 0; i < yeet.size(); ++i) {
		if(i < yeet.size() - 1 && yeet[i] != yeet[i + 1])
			activateSqr(yeet[i].first, yeet[i].second, 1);
		else if(i == yeet.size() - 1)
			activateSqr(yeet[i].first, yeet[i].second, 1);
	}
	
	if(val[1] != 4)
		return 0;
	return fr[1];
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:107:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < yeet.size(); ++i) {
                 ~~^~~~~~~~~~~~~
seats.cpp:108:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i < yeet.size() - 1 && yeet[i] != yeet[i + 1])
      ~~^~~~~~~~~~~~~~~~~
seats.cpp:110:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   else if(i == yeet.size() - 1)
           ~~^~~~~~~~~~~~~~~~~~
seats.cpp:116:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < yeet.size(); ++i) {
                 ~~^~~~~~~~~~~~~
seats.cpp:117:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i < yeet.size() - 1 && yeet[i] != yeet[i + 1])
      ~~^~~~~~~~~~~~~~~~~
seats.cpp:119:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   else if(i == yeet.size() - 1)
           ~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 632 KB Output is correct
2 Correct 27 ms 704 KB Output is correct
3 Correct 43 ms 704 KB Output is correct
4 Correct 26 ms 704 KB Output is correct
5 Correct 23 ms 704 KB Output is correct
6 Correct 35 ms 828 KB Output is correct
7 Correct 42 ms 828 KB Output is correct
8 Correct 35 ms 912 KB Output is correct
9 Correct 32 ms 912 KB Output is correct
10 Correct 46 ms 912 KB Output is correct
11 Correct 34 ms 912 KB Output is correct
12 Correct 25 ms 1040 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 632 KB Output is correct
2 Correct 27 ms 704 KB Output is correct
3 Correct 43 ms 704 KB Output is correct
4 Correct 26 ms 704 KB Output is correct
5 Correct 23 ms 704 KB Output is correct
6 Correct 35 ms 828 KB Output is correct
7 Correct 42 ms 828 KB Output is correct
8 Correct 35 ms 912 KB Output is correct
9 Correct 32 ms 912 KB Output is correct
10 Correct 46 ms 912 KB Output is correct
11 Correct 34 ms 912 KB Output is correct
12 Correct 25 ms 1040 KB Output is correct
13 Correct 82 ms 1448 KB Output is correct
14 Correct 118 ms 1448 KB Output is correct
15 Correct 58 ms 1576 KB Output is correct
16 Correct 44 ms 1840 KB Output is correct
17 Correct 70 ms 1840 KB Output is correct
18 Correct 63 ms 1840 KB Output is correct
19 Correct 60 ms 1840 KB Output is correct
20 Correct 51 ms 1840 KB Output is correct
21 Correct 61 ms 1840 KB Output is correct
22 Correct 43 ms 1840 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2584 ms 53068 KB Output is correct
2 Correct 1280 ms 53164 KB Output is correct
3 Correct 1202 ms 53292 KB Output is correct
4 Correct 1031 ms 53292 KB Output is correct
5 Correct 1052 ms 53292 KB Output is correct
6 Correct 960 ms 53292 KB Output is correct
7 Correct 1089 ms 53292 KB Output is correct
8 Correct 1186 ms 53292 KB Output is correct
9 Correct 1150 ms 53292 KB Output is correct
10 Correct 1196 ms 53292 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 53292 KB Output is correct
2 Correct 184 ms 53292 KB Output is correct
3 Correct 1071 ms 53312 KB Output is correct
4 Correct 2732 ms 53312 KB Output is correct
5 Correct 922 ms 61036 KB Output is correct
6 Correct 2562 ms 88492 KB Output is correct
7 Correct 1008 ms 88492 KB Output is correct
8 Correct 1236 ms 88492 KB Output is correct
9 Correct 1197 ms 88492 KB Output is correct
10 Correct 1114 ms 88492 KB Output is correct
11 Correct 1008 ms 88492 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 88492 KB Output is correct
2 Correct 135 ms 88492 KB Output is correct
3 Correct 232 ms 88492 KB Output is correct
4 Correct 267 ms 88492 KB Output is correct
5 Correct 442 ms 88492 KB Output is correct
6 Correct 1517 ms 88492 KB Output is correct
7 Correct 1922 ms 88492 KB Output is correct
8 Correct 1481 ms 88492 KB Output is correct
9 Correct 3370 ms 88492 KB Output is correct
10 Correct 1424 ms 88492 KB Output is correct
11 Correct 1510 ms 88492 KB Output is correct
12 Correct 1396 ms 88492 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 632 KB Output is correct
2 Correct 27 ms 704 KB Output is correct
3 Correct 43 ms 704 KB Output is correct
4 Correct 26 ms 704 KB Output is correct
5 Correct 23 ms 704 KB Output is correct
6 Correct 35 ms 828 KB Output is correct
7 Correct 42 ms 828 KB Output is correct
8 Correct 35 ms 912 KB Output is correct
9 Correct 32 ms 912 KB Output is correct
10 Correct 46 ms 912 KB Output is correct
11 Correct 34 ms 912 KB Output is correct
12 Correct 25 ms 1040 KB Output is correct
13 Correct 82 ms 1448 KB Output is correct
14 Correct 118 ms 1448 KB Output is correct
15 Correct 58 ms 1576 KB Output is correct
16 Correct 44 ms 1840 KB Output is correct
17 Correct 70 ms 1840 KB Output is correct
18 Correct 63 ms 1840 KB Output is correct
19 Correct 60 ms 1840 KB Output is correct
20 Correct 51 ms 1840 KB Output is correct
21 Correct 61 ms 1840 KB Output is correct
22 Correct 43 ms 1840 KB Output is correct
23 Correct 2584 ms 53068 KB Output is correct
24 Correct 1280 ms 53164 KB Output is correct
25 Correct 1202 ms 53292 KB Output is correct
26 Correct 1031 ms 53292 KB Output is correct
27 Correct 1052 ms 53292 KB Output is correct
28 Correct 960 ms 53292 KB Output is correct
29 Correct 1089 ms 53292 KB Output is correct
30 Correct 1186 ms 53292 KB Output is correct
31 Correct 1150 ms 53292 KB Output is correct
32 Correct 1196 ms 53292 KB Output is correct
33 Correct 78 ms 53292 KB Output is correct
34 Correct 184 ms 53292 KB Output is correct
35 Correct 1071 ms 53312 KB Output is correct
36 Correct 2732 ms 53312 KB Output is correct
37 Correct 922 ms 61036 KB Output is correct
38 Correct 2562 ms 88492 KB Output is correct
39 Correct 1008 ms 88492 KB Output is correct
40 Correct 1236 ms 88492 KB Output is correct
41 Correct 1197 ms 88492 KB Output is correct
42 Correct 1114 ms 88492 KB Output is correct
43 Correct 1008 ms 88492 KB Output is correct
44 Correct 66 ms 88492 KB Output is correct
45 Correct 135 ms 88492 KB Output is correct
46 Correct 232 ms 88492 KB Output is correct
47 Correct 267 ms 88492 KB Output is correct
48 Correct 442 ms 88492 KB Output is correct
49 Correct 1517 ms 88492 KB Output is correct
50 Correct 1922 ms 88492 KB Output is correct
51 Correct 1481 ms 88492 KB Output is correct
52 Correct 3370 ms 88492 KB Output is correct
53 Correct 1424 ms 88492 KB Output is correct
54 Correct 1510 ms 88492 KB Output is correct
55 Correct 1396 ms 88492 KB Output is correct
56 Correct 151 ms 88492 KB Output is correct
57 Correct 394 ms 88492 KB Output is correct
58 Correct 603 ms 88492 KB Output is correct
59 Correct 2102 ms 88492 KB Output is correct
60 Execution timed out 4035 ms 88492 KB Time limit exceeded
61 Halted 0 ms 0 KB -