oj.uz

Submission #580982

# Submission time Handle Problem Language Result Execution time Memory
580982 2022-06-22T07:29:57 Z 8e7 Seats (IOI18_seats) C++17
100 / 100
 3533 ms 69340 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
#include "seats.h"
#pragma GCC optimize("Ofast")
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 1000005
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
struct segtree{
	int seg[4*maxn], cnt[4*maxn], tag[4*maxn];
	void push(int cur, int l, int r) {
		seg[cur] += tag[cur];
		if (r - l > 1) {
			tag[cur*2] += tag[cur];
			tag[cur*2+1] += tag[cur];
		}
		tag[cur] = 0;
	}
	void pull(int cur, int l, int r) {
		int m = (l + r) / 2;
		push(cur*2, l, m), push(cur*2+1, m, r);
		seg[cur] = min(seg[cur*2], seg[cur*2+1]);
		cnt[cur] = (seg[cur*2] == seg[cur] ? cnt[cur*2] : 0) + (seg[cur*2+1] == seg[cur] ? cnt[cur*2+1] : 0);
	}
	void init(int cur, int l, int r) {
		if (r <= l) return;
		cnt[cur] = r - l;
		seg[cur] = tag[cur] = 0;
		if (r - l == 1) return;
		int m = (l + r) / 2; 
		init(cur*2, l, m), init(cur*2+1, m, r);
	}
	void modify(int cur, int l, int r, int ql, int qr, int v) {
		if (r <= l || ql >= r || qr <= l) return;
		push(cur, l, r);
		if (ql <= l && qr >= r) {
			tag[cur] += v;
			return;
		}
		int m = (l + r) / 2;
		modify(cur*2, l, m, ql, qr, v);
		modify(cur*2+1, m, r, ql, qr, v);
		pull(cur, l, r);
	}
	int getval(int n) {
		push(1, 0, n);
		if (seg[1] == 4) return cnt[1];
		else return 0;	
	}
} tr;

vector<int> a, pos;
int n;
int m;

void upd(int x, int y, int v) {
	int tmp[4] = {a[x*m+y], a[x*m+y+1], a[(x+1)*m+y], a[(x+1)*m+y+1]};	
	sort(tmp, tmp+4);
	tr.modify(1, 0, n, tmp[0], tmp[1], v);
	tr.modify(1, 0, n, tmp[2], tmp[3], v);
}
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
	m = W+2;
	n = H*W;
	tr.init(1, 0, n);
	a.resize((H+2)*(W+2), maxn);
	pos.resize(n);
	for (int i = 0;i < n;i++) {
		R[i]++, C[i]++;
		pos[i] = R[i] * m + C[i];	
		a[R[i] * m + C[i]] = i;
	}
	for (int i = 0;i <= H;i++) {
		for (int j = 0;j <= W;j++) {
			upd(i, j, 1);
		}
	}
}

int swap_seats(int u, int v) {
	int ax = pos[u] / m, ay = pos[u] % m;	
	int bx = pos[v] / m, by = pos[v] % m;	
	for (int i = -1;i <= 0;i++) {
		for (int j = -1;j <= 0;j++) {
			upd(ax+i, ay+j, -1);		
			upd(bx+i, by+j, -1);		
		}
	}
	swap(a[pos[u]], a[pos[v]]);
	for (int i = -1;i <= 0;i++) {
		for (int j = -1;j <= 0;j++) {
			upd(ax+i, ay+j, 1);		
			upd(bx+i, by+j, 1);		
		}
	}
	swap(pos[u], pos[v]);
	return tr.getval(n);
}
/*
2 3 2
0 0
1 0
1 1
0 1
0 2
1 2
0 5
0 5
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 476 KB Output is correct
2 Correct 22 ms 440 KB Output is correct
3 Correct 35 ms 460 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 18 ms 460 KB Output is correct
6 Correct 28 ms 452 KB Output is correct
7 Correct 39 ms 432 KB Output is correct
8 Correct 32 ms 460 KB Output is correct
9 Correct 29 ms 444 KB Output is correct
10 Correct 34 ms 440 KB Output is correct
11 Correct 29 ms 460 KB Output is correct
12 Correct 18 ms 452 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 476 KB Output is correct
2 Correct 22 ms 440 KB Output is correct
3 Correct 35 ms 460 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 18 ms 460 KB Output is correct
6 Correct 28 ms 452 KB Output is correct
7 Correct 39 ms 432 KB Output is correct
8 Correct 32 ms 460 KB Output is correct
9 Correct 29 ms 444 KB Output is correct
10 Correct 34 ms 440 KB Output is correct
11 Correct 29 ms 460 KB Output is correct
12 Correct 18 ms 452 KB Output is correct
13 Correct 83 ms 1144 KB Output is correct
14 Correct 103 ms 1160 KB Output is correct
15 Correct 66 ms 1216 KB Output is correct
16 Correct 38 ms 1232 KB Output is correct
17 Correct 77 ms 1108 KB Output is correct
18 Correct 65 ms 1144 KB Output is correct
19 Correct 59 ms 1160 KB Output is correct
20 Correct 53 ms 1184 KB Output is correct
21 Correct 38 ms 1216 KB Output is correct
22 Correct 49 ms 1228 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2565 ms 49488 KB Output is correct
2 Correct 1235 ms 64516 KB Output is correct
3 Correct 1358 ms 64480 KB Output is correct
4 Correct 1211 ms 64472 KB Output is correct
5 Correct 1218 ms 64472 KB Output is correct
6 Correct 1120 ms 64476 KB Output is correct
7 Correct 1107 ms 64476 KB Output is correct
8 Correct 1144 ms 64476 KB Output is correct
9 Correct 1309 ms 64476 KB Output is correct
10 Correct 1168 ms 64484 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1144 KB Output is correct
2 Correct 189 ms 6160 KB Output is correct
3 Correct 1086 ms 49196 KB Output is correct
4 Correct 2398 ms 49204 KB Output is correct
5 Correct 927 ms 57016 KB Output is correct
6 Correct 2180 ms 57060 KB Output is correct
7 Correct 1077 ms 51800 KB Output is correct
8 Correct 1243 ms 49268 KB Output is correct
9 Correct 1120 ms 49288 KB Output is correct
10 Correct 1083 ms 49964 KB Output is correct
11 Correct 963 ms 53092 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 2000 KB Output is correct
2 Correct 104 ms 1952 KB Output is correct
3 Correct 168 ms 1952 KB Output is correct
4 Correct 241 ms 1984 KB Output is correct
5 Correct 388 ms 2524 KB Output is correct
6 Correct 1572 ms 56868 KB Output is correct
7 Correct 1766 ms 56748 KB Output is correct
8 Correct 1422 ms 56792 KB Output is correct
9 Correct 2897 ms 57692 KB Output is correct
10 Correct 1546 ms 57444 KB Output is correct
11 Correct 1354 ms 56676 KB Output is correct
12 Correct 1321 ms 56648 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 476 KB Output is correct
2 Correct 22 ms 440 KB Output is correct
3 Correct 35 ms 460 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 18 ms 460 KB Output is correct
6 Correct 28 ms 452 KB Output is correct
7 Correct 39 ms 432 KB Output is correct
8 Correct 32 ms 460 KB Output is correct
9 Correct 29 ms 444 KB Output is correct
10 Correct 34 ms 440 KB Output is correct
11 Correct 29 ms 460 KB Output is correct
12 Correct 18 ms 452 KB Output is correct
13 Correct 83 ms 1144 KB Output is correct
14 Correct 103 ms 1160 KB Output is correct
15 Correct 66 ms 1216 KB Output is correct
16 Correct 38 ms 1232 KB Output is correct
17 Correct 77 ms 1108 KB Output is correct
18 Correct 65 ms 1144 KB Output is correct
19 Correct 59 ms 1160 KB Output is correct
20 Correct 53 ms 1184 KB Output is correct
21 Correct 38 ms 1216 KB Output is correct
22 Correct 49 ms 1228 KB Output is correct
23 Correct 2565 ms 49488 KB Output is correct
24 Correct 1235 ms 64516 KB Output is correct
25 Correct 1358 ms 64480 KB Output is correct
26 Correct 1211 ms 64472 KB Output is correct
27 Correct 1218 ms 64472 KB Output is correct
28 Correct 1120 ms 64476 KB Output is correct
29 Correct 1107 ms 64476 KB Output is correct
30 Correct 1144 ms 64476 KB Output is correct
31 Correct 1309 ms 64476 KB Output is correct
32 Correct 1168 ms 64484 KB Output is correct
33 Correct 85 ms 1144 KB Output is correct
34 Correct 189 ms 6160 KB Output is correct
35 Correct 1086 ms 49196 KB Output is correct
36 Correct 2398 ms 49204 KB Output is correct
37 Correct 927 ms 57016 KB Output is correct
38 Correct 2180 ms 57060 KB Output is correct
39 Correct 1077 ms 51800 KB Output is correct
40 Correct 1243 ms 49268 KB Output is correct
41 Correct 1120 ms 49288 KB Output is correct
42 Correct 1083 ms 49964 KB Output is correct
43 Correct 963 ms 53092 KB Output is correct
44 Correct 58 ms 2000 KB Output is correct
45 Correct 104 ms 1952 KB Output is correct
46 Correct 168 ms 1952 KB Output is correct
47 Correct 241 ms 1984 KB Output is correct
48 Correct 388 ms 2524 KB Output is correct
49 Correct 1572 ms 56868 KB Output is correct
50 Correct 1766 ms 56748 KB Output is correct
51 Correct 1422 ms 56792 KB Output is correct
52 Correct 2897 ms 57692 KB Output is correct
53 Correct 1546 ms 57444 KB Output is correct
54 Correct 1354 ms 56676 KB Output is correct
55 Correct 1321 ms 56648 KB Output is correct
56 Correct 130 ms 2120 KB Output is correct
57 Correct 326 ms 1992 KB Output is correct
58 Correct 600 ms 2628 KB Output is correct
59 Correct 2004 ms 65500 KB Output is correct
60 Correct 3533 ms 65440 KB Output is correct
61 Correct 1793 ms 65448 KB Output is correct
62 Correct 1376 ms 69340 KB Output is correct
63 Correct 2972 ms 68032 KB Output is correct
64 Correct 1925 ms 66232 KB Output is correct
65 Correct 1714 ms 65504 KB Output is correct
66 Correct 1818 ms 65544 KB Output is correct
67 Correct 1874 ms 66208 KB Output is correct
68 Correct 1534 ms 68028 KB Output is correct
69 Correct 2710 ms 69340 KB Output is correct