oj.uz

Submission #393241

# Submission time Handle Problem Language Result Execution time Memory
393241 2021-04-23T04:28:05 Z maximath_1 Seats (IOI18_seats) C++11
100 / 100
 2319 ms 99492 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;

#define mx(a, b) (a > b ? a : b)
#define mn(a, b) (a < b ? a : b)
#define ll long long
const int inf = 2;
const int MX = 1000005;
const int dx[] = {1, 1, -1, -1};
const int dy[] = {1, -1, 1, -1};

int mn[MX * 4], lz[MX * 4];
int cnt[MX * 4];
int sz;

void merge(int m, int l, int r){
	if(mn[l] < mn[r]){
		mn[m] = mn[l];
		cnt[m] = cnt[l];
	}else if(mn[l] > mn[r]){
		mn[m] = mn[r];
		cnt[m] = cnt[r];
	}else{
		mn[m] = mn[l];
		cnt[m] = cnt[l] + cnt[r];
	}
}

vector<int> arr;
void build(int nd, int cl, int cr){
	if(cl == cr){
		mn[nd] = arr[cl];
		cnt[nd] = 1;
		return;
	}
	build(nd * 2, cl, (cl + cr) / 2);
	build(nd * 2 + 1, (cl + cr) / 2 + 1, cr);
	merge(nd, nd * 2, nd * 2 + 1);
}

void init(int a){
	sz = a;
	build(1, 0, sz - 1);
}

void prop(int nd, int cl, int cr){
	if(lz[nd]){
		mn[nd] += lz[nd];
		if(cl != cr){
			lz[nd * 2] += lz[nd];
			lz[nd * 2 + 1] += lz[nd];
		}
		lz[nd] = 0;
	}
}

int ul, ur, uv;
void upd(int nd, int cl, int cr){
	prop(nd, cl, cr);
	if(ur < cl || cr < ul) return;
	if(ul <= cl && cr <= ur){
		lz[nd] += uv;
		prop(nd, cl, cr);
		return;
	}

	upd(nd * 2, cl, (cl + cr) / 2);
	upd(nd * 2 + 1, (cl + cr) / 2 + 1, cr);

	merge(nd, nd * 2, nd * 2 + 1);
}
void upd(){
	if(ul > ur) return;
	upd(1, 0, sz - 1);
}

void dfs(int nd, int cl, int cr){
	if(cl == cr){
		cout << mn[nd] << " ";
		return;
	}

	dfs(nd * 2, cl, (cl + cr) / 2);
	dfs(nd * 2 + 1, (cl + cr) / 2 + 1, cr);
}
void print(){
	dfs(1, 0, sz - 1); cout << endl;
}

int h, w, ans;
vector<int> r, c;
vector<vector<int> > mp;

void give_initial_chart(int H, int W, vector<int> R, vector<int> C){
	r = R; c = C;
	h = H; w = W;

	mp.assign(h + 2, vector<int>(w + 2, r.size()));
	for(int i = 0; i < r.size(); i ++){
		r[i] ++; c[i] ++;
		mp[r[i]][c[i]] = i;
	}

	arr.resize(r.size() + 1);
	for(int i = 0; i <= h; i ++)
		for(int j = 0; j <= w; j ++){
			vector<int> ord = {mp[i][j], mp[i + 1][j], mp[i][j + 1], mp[i + 1][j + 1]};
			sort(ord.begin(), ord.end());

			arr[ord[0]] ++; arr[ord[1]] --;
			arr[ord[2]] += inf; arr[ord[3]] -= inf;
		}

	for(int i = 0; i <= r.size(); i ++)
		arr[i] += (i > 0 ? arr[i - 1] : 0);

	init(r.size());

	return;
}

int swap_seats(int a, int b){
	vector<int> li = {a, b};
	set<pair<int, int> > processed;
	for(int x, y, tp = 0; tp < 2; tp ++){
		x = r[li[tp]], y = c[li[tp]];
		for(int d = 0; d < 4; d ++){
			int mnr = min(x, x + dx[d]);
			int mnc = min(y, y + dy[d]);
			if(processed.count({mnr, mnc})) continue;
			processed.insert({mnr, mnc});
			if(mnr < 0 || mnc < 0) continue;
			if(x + dx[d] > h + 1 || y + dy[d] > w + 1 ) continue;

			vector<int> ord = {mp[x][y], mp[x + dx[d]][y], mp[x][y + dy[d]], mp[x + dx[d]][y + dy[d]]};
			sort(ord.begin(), ord.end());

			ul = ord[0], ur = ord[1] - 1, uv = -1;
			upd();
			ul = ord[2], ur = ord[3] - 1, uv = -inf;
			upd();
		}
	}

	swap(mp[r[a]][c[a]], mp[r[b]][c[b]]);
	swap(r[a], r[b]);
	swap(c[a], c[b]);

	processed.clear();
	for(int x, y, tp = 0; tp < 2; tp ++){
		x = r[li[tp]], y = c[li[tp]];
		for(int d = 0; d < 4; d ++){
			int mnr = min(x, x + dx[d]);
			int mnc = min(y, y + dy[d]);
			if(processed.count({mnr, mnc})) continue;
			processed.insert({mnr, mnc});
			if(mnr < 0 || mnc < 0) continue;
			if(x + dx[d] > h + 1 || y + dy[d] > w + 1) continue;
			vector<int> ord = {mp[x][y], mp[x + dx[d]][y], mp[x][y + dy[d]], mp[x + dx[d]][y + dy[d]]};
			sort(ord.begin(), ord.end());

			ul = ord[0], ur = ord[1] - 1, uv = 1;
			upd();
			ul = ord[2], ur = ord[3] - 1, uv = inf;
			upd();
		}
	}	

	return cnt[1];
}

Compilation message

seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:100:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |  for(int i = 0; i < r.size(); i ++){
      |                 ~~^~~~~~~~~~
seats.cpp:115:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |  for(int i = 0; i <= r.size(); i ++)
      |                 ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 380 KB Output is correct
2 Correct 29 ms 332 KB Output is correct
3 Correct 45 ms 368 KB Output is correct
4 Correct 27 ms 396 KB Output is correct
5 Correct 23 ms 412 KB Output is correct
6 Correct 40 ms 364 KB Output is correct
7 Correct 41 ms 368 KB Output is correct
8 Correct 37 ms 412 KB Output is correct
9 Correct 36 ms 376 KB Output is correct
10 Correct 41 ms 404 KB Output is correct
11 Correct 38 ms 400 KB Output is correct
12 Correct 23 ms 380 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 380 KB Output is correct
2 Correct 29 ms 332 KB Output is correct
3 Correct 45 ms 368 KB Output is correct
4 Correct 27 ms 396 KB Output is correct
5 Correct 23 ms 412 KB Output is correct
6 Correct 40 ms 364 KB Output is correct
7 Correct 41 ms 368 KB Output is correct
8 Correct 37 ms 412 KB Output is correct
9 Correct 36 ms 376 KB Output is correct
10 Correct 41 ms 404 KB Output is correct
11 Correct 38 ms 400 KB Output is correct
12 Correct 23 ms 380 KB Output is correct
13 Correct 87 ms 1040 KB Output is correct
14 Correct 100 ms 972 KB Output is correct
15 Correct 53 ms 1112 KB Output is correct
16 Correct 41 ms 1564 KB Output is correct
17 Correct 69 ms 1104 KB Output is correct
18 Correct 68 ms 1056 KB Output is correct
19 Correct 61 ms 1100 KB Output is correct
20 Correct 52 ms 1280 KB Output is correct
21 Correct 42 ms 1220 KB Output is correct
22 Correct 41 ms 1556 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 600 ms 48512 KB Output is correct
2 Correct 506 ms 48552 KB Output is correct
3 Correct 492 ms 48580 KB Output is correct
4 Correct 487 ms 48564 KB Output is correct
5 Correct 514 ms 48624 KB Output is correct
6 Correct 471 ms 48508 KB Output is correct
7 Correct 474 ms 48692 KB Output is correct
8 Correct 489 ms 48552 KB Output is correct
9 Correct 469 ms 48684 KB Output is correct
10 Correct 473 ms 48560 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 972 KB Output is correct
2 Correct 140 ms 5684 KB Output is correct
3 Correct 464 ms 48680 KB Output is correct
4 Correct 602 ms 48648 KB Output is correct
5 Correct 465 ms 56336 KB Output is correct
6 Correct 848 ms 99492 KB Output is correct
7 Correct 483 ms 51080 KB Output is correct
8 Correct 485 ms 48508 KB Output is correct
9 Correct 476 ms 48992 KB Output is correct
10 Correct 525 ms 53288 KB Output is correct
11 Correct 496 ms 71956 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 1336 KB Output is correct
2 Correct 168 ms 1240 KB Output is correct
3 Correct 227 ms 1268 KB Output is correct
4 Correct 289 ms 1420 KB Output is correct
5 Correct 502 ms 2120 KB Output is correct
6 Correct 1091 ms 57580 KB Output is correct
7 Correct 1157 ms 57444 KB Output is correct
8 Correct 1104 ms 57372 KB Output is correct
9 Correct 1351 ms 57572 KB Output is correct
10 Correct 975 ms 57440 KB Output is correct
11 Correct 990 ms 57484 KB Output is correct
12 Correct 952 ms 57376 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 380 KB Output is correct
2 Correct 29 ms 332 KB Output is correct
3 Correct 45 ms 368 KB Output is correct
4 Correct 27 ms 396 KB Output is correct
5 Correct 23 ms 412 KB Output is correct
6 Correct 40 ms 364 KB Output is correct
7 Correct 41 ms 368 KB Output is correct
8 Correct 37 ms 412 KB Output is correct
9 Correct 36 ms 376 KB Output is correct
10 Correct 41 ms 404 KB Output is correct
11 Correct 38 ms 400 KB Output is correct
12 Correct 23 ms 380 KB Output is correct
13 Correct 87 ms 1040 KB Output is correct
14 Correct 100 ms 972 KB Output is correct
15 Correct 53 ms 1112 KB Output is correct
16 Correct 41 ms 1564 KB Output is correct
17 Correct 69 ms 1104 KB Output is correct
18 Correct 68 ms 1056 KB Output is correct
19 Correct 61 ms 1100 KB Output is correct
20 Correct 52 ms 1280 KB Output is correct
21 Correct 42 ms 1220 KB Output is correct
22 Correct 41 ms 1556 KB Output is correct
23 Correct 600 ms 48512 KB Output is correct
24 Correct 506 ms 48552 KB Output is correct
25 Correct 492 ms 48580 KB Output is correct
26 Correct 487 ms 48564 KB Output is correct
27 Correct 514 ms 48624 KB Output is correct
28 Correct 471 ms 48508 KB Output is correct
29 Correct 474 ms 48692 KB Output is correct
30 Correct 489 ms 48552 KB Output is correct
31 Correct 469 ms 48684 KB Output is correct
32 Correct 473 ms 48560 KB Output is correct
33 Correct 84 ms 972 KB Output is correct
34 Correct 140 ms 5684 KB Output is correct
35 Correct 464 ms 48680 KB Output is correct
36 Correct 602 ms 48648 KB Output is correct
37 Correct 465 ms 56336 KB Output is correct
38 Correct 848 ms 99492 KB Output is correct
39 Correct 483 ms 51080 KB Output is correct
40 Correct 485 ms 48508 KB Output is correct
41 Correct 476 ms 48992 KB Output is correct
42 Correct 525 ms 53288 KB Output is correct
43 Correct 496 ms 71956 KB Output is correct
44 Correct 113 ms 1336 KB Output is correct
45 Correct 168 ms 1240 KB Output is correct
46 Correct 227 ms 1268 KB Output is correct
47 Correct 289 ms 1420 KB Output is correct
48 Correct 502 ms 2120 KB Output is correct
49 Correct 1091 ms 57580 KB Output is correct
50 Correct 1157 ms 57444 KB Output is correct
51 Correct 1104 ms 57372 KB Output is correct
52 Correct 1351 ms 57572 KB Output is correct
53 Correct 975 ms 57440 KB Output is correct
54 Correct 990 ms 57484 KB Output is correct
55 Correct 952 ms 57376 KB Output is correct
56 Correct 192 ms 1280 KB Output is correct
57 Correct 434 ms 1296 KB Output is correct
58 Correct 656 ms 1972 KB Output is correct
59 Correct 1572 ms 49648 KB Output is correct
60 Correct 2319 ms 49700 KB Output is correct
61 Correct 1323 ms 66352 KB Output is correct
62 Correct 1186 ms 70060 KB Output is correct
63 Correct 2025 ms 68780 KB Output is correct
64 Correct 1516 ms 66984 KB Output is correct
65 Correct 1376 ms 66228 KB Output is correct
66 Correct 1652 ms 66584 KB Output is correct
67 Correct 1540 ms 70812 KB Output is correct
68 Correct 1230 ms 80472 KB Output is correct
69 Correct 2039 ms 89864 KB Output is correct