oj.uz

Submission #438518

# Submission time Handle Problem Language Result Execution time Memory
438518 2021-06-28T07:17:39 Z fhvirus Seats (IOI18_seats) C++17
100 / 100
 1535 ms 107228 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;} 
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#pragma GCC optimize("Ofast")
#define debug(...) ((void)0)
#endif

#include "seats.h"

int H, W;
vector<int> R, C; 
vector<vector<int>> A;

vector<int> pre;
bool bld; 

struct ZCK {
	struct VAL {
		int val, cnt;
		VAL(int v = 0, int c = 1): val(v), cnt(c) {}
		VAL operator+ (int v) { return VAL(val + v, cnt); }
		VAL operator+ (VAL v) {
			if(val < v.val) return *this;
			if(val > v.val) return v;
			return VAL(val, cnt + v.cnt);
		}
	};
	struct NOD {
		VAL val; int tag;
		NOD (int v = 0): val(v), tag(0) {}
		VAL get() { return val + tag; }
	};
	int n; vector<NOD> nds;
	void init(int nn){
		n = nn; nds.resize(n * 2);
		for(int i = 0; i < n; ++i) nds[i + n] = NOD(pre[i]);
		for(int i = n-1; i > 0; --i) nds[i].val = nds[i<<1].get() + nds[i<<1|1].get();
	}
	void pull(int p){ for(p >>= 1; p > 0; p >>= 1) nds[p].val = nds[p<<1].get() + nds[p<<1|1].get(); }
	void mod(int l, int r, int v){ 
		int tl = l + n, tr = r + n - 1;
		for(l += n, r += n; l < r; l >>= 1, r >>= 1){
			if(l & 1) nds[l++].tag += v;
			if(r & 1) nds[--r].tag += v;
		}
		pull(tl), pull(tr);
	}
	int que(){ return nds[1].get().cnt; }
} sgt;

inline int eek(int i, int j){ return (i < 0 or j < 0 or i >= H or j >= W ? H * W : A[i][j]); }
void add(int l, int r, int v){
	if(l == r) return;
	if(bld) pre[l] += v, pre[r] -= v;
	else sgt.mod(l, r, v);
}
void upd(int i, int j, int v){
	vector<int> tmp({ eek(i, j), eek(i-1, j), eek(i, j-1), eek(i-1, j-1) });
	sort(AI(tmp));
	add(tmp[0], tmp[1], v);
	add(tmp[2], tmp[3], v);
}

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
	::H = H, ::W = W;
	::R = R, ::C = C;
	A.assign(H, vector<int>(W, 0));
	for(int i = 0; i < H * W; ++i) A[R[i]][C[i]] = i;

	pre.assign(H * W + 1, 0); bld = true;
	for(int i = 0; i <= H; ++i) for(int j = 0; j <= W; ++j) upd(i, j, 1); 
	for(int i = 1; i <= H * W; ++i) pre[i] += pre[i-1];
	sgt.init(H * W);
	bld = false;
}

int swap_seats(int a, int b) {
	for(int d: {0, 1}) for(int e: {0, 1}) upd(R[a] + d, C[a] + e, -1);
	for(int d: {0, 1}) for(int e: {0, 1}) upd(R[b] + d, C[b] + e, -1);
	swap(A[R[a]][C[a]], A[R[b]][C[b]]);
	swap(R[a], R[b]), swap(C[a], C[b]);
	for(int d: {0, 1}) for(int e: {0, 1}) upd(R[a] + d, C[a] + e, 1);
	for(int d: {0, 1}) for(int e: {0, 1}) upd(R[b] + d, C[b] + e, 1); 
	return sgt.que();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 412 KB Output is correct
2 Correct 22 ms 332 KB Output is correct
3 Correct 31 ms 420 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 22 ms 432 KB Output is correct
6 Correct 26 ms 424 KB Output is correct
7 Correct 27 ms 452 KB Output is correct
8 Correct 27 ms 416 KB Output is correct
9 Correct 27 ms 460 KB Output is correct
10 Correct 35 ms 416 KB Output is correct
11 Correct 26 ms 444 KB Output is correct
12 Correct 20 ms 408 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 412 KB Output is correct
2 Correct 22 ms 332 KB Output is correct
3 Correct 31 ms 420 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 22 ms 432 KB Output is correct
6 Correct 26 ms 424 KB Output is correct
7 Correct 27 ms 452 KB Output is correct
8 Correct 27 ms 416 KB Output is correct
9 Correct 27 ms 460 KB Output is correct
10 Correct 35 ms 416 KB Output is correct
11 Correct 26 ms 444 KB Output is correct
12 Correct 20 ms 408 KB Output is correct
13 Correct 56 ms 1064 KB Output is correct
14 Correct 59 ms 1064 KB Output is correct
15 Correct 33 ms 1048 KB Output is correct
16 Correct 37 ms 1580 KB Output is correct
17 Correct 42 ms 1088 KB Output is correct
18 Correct 53 ms 1060 KB Output is correct
19 Correct 48 ms 1088 KB Output is correct
20 Correct 44 ms 1288 KB Output is correct
21 Correct 34 ms 1064 KB Output is correct
22 Correct 34 ms 1484 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 562 ms 55616 KB Output is correct
2 Correct 476 ms 55652 KB Output is correct
3 Correct 478 ms 56384 KB Output is correct
4 Correct 519 ms 56388 KB Output is correct
5 Correct 464 ms 56388 KB Output is correct
6 Correct 449 ms 56388 KB Output is correct
7 Correct 516 ms 56444 KB Output is correct
8 Correct 464 ms 56348 KB Output is correct
9 Correct 458 ms 56368 KB Output is correct
10 Correct 467 ms 56520 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1076 KB Output is correct
2 Correct 105 ms 6488 KB Output is correct
3 Correct 526 ms 56368 KB Output is correct
4 Correct 577 ms 56368 KB Output is correct
5 Correct 470 ms 56292 KB Output is correct
6 Correct 755 ms 107228 KB Output is correct
7 Correct 548 ms 56364 KB Output is correct
8 Correct 471 ms 56448 KB Output is correct
9 Correct 509 ms 56756 KB Output is correct
10 Correct 499 ms 59456 KB Output is correct
11 Correct 562 ms 79772 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 1484 KB Output is correct
2 Correct 130 ms 1472 KB Output is correct
3 Correct 197 ms 1944 KB Output is correct
4 Correct 234 ms 1952 KB Output is correct
5 Correct 276 ms 2644 KB Output is correct
6 Correct 906 ms 55420 KB Output is correct
7 Correct 886 ms 55464 KB Output is correct
8 Correct 832 ms 55440 KB Output is correct
9 Correct 1012 ms 55520 KB Output is correct
10 Correct 831 ms 55564 KB Output is correct
11 Correct 869 ms 55460 KB Output is correct
12 Correct 879 ms 55464 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 412 KB Output is correct
2 Correct 22 ms 332 KB Output is correct
3 Correct 31 ms 420 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 22 ms 432 KB Output is correct
6 Correct 26 ms 424 KB Output is correct
7 Correct 27 ms 452 KB Output is correct
8 Correct 27 ms 416 KB Output is correct
9 Correct 27 ms 460 KB Output is correct
10 Correct 35 ms 416 KB Output is correct
11 Correct 26 ms 444 KB Output is correct
12 Correct 20 ms 408 KB Output is correct
13 Correct 56 ms 1064 KB Output is correct
14 Correct 59 ms 1064 KB Output is correct
15 Correct 33 ms 1048 KB Output is correct
16 Correct 37 ms 1580 KB Output is correct
17 Correct 42 ms 1088 KB Output is correct
18 Correct 53 ms 1060 KB Output is correct
19 Correct 48 ms 1088 KB Output is correct
20 Correct 44 ms 1288 KB Output is correct
21 Correct 34 ms 1064 KB Output is correct
22 Correct 34 ms 1484 KB Output is correct
23 Correct 562 ms 55616 KB Output is correct
24 Correct 476 ms 55652 KB Output is correct
25 Correct 478 ms 56384 KB Output is correct
26 Correct 519 ms 56388 KB Output is correct
27 Correct 464 ms 56388 KB Output is correct
28 Correct 449 ms 56388 KB Output is correct
29 Correct 516 ms 56444 KB Output is correct
30 Correct 464 ms 56348 KB Output is correct
31 Correct 458 ms 56368 KB Output is correct
32 Correct 467 ms 56520 KB Output is correct
33 Correct 51 ms 1076 KB Output is correct
34 Correct 105 ms 6488 KB Output is correct
35 Correct 526 ms 56368 KB Output is correct
36 Correct 577 ms 56368 KB Output is correct
37 Correct 470 ms 56292 KB Output is correct
38 Correct 755 ms 107228 KB Output is correct
39 Correct 548 ms 56364 KB Output is correct
40 Correct 471 ms 56448 KB Output is correct
41 Correct 509 ms 56756 KB Output is correct
42 Correct 499 ms 59456 KB Output is correct
43 Correct 562 ms 79772 KB Output is correct
44 Correct 95 ms 1484 KB Output is correct
45 Correct 130 ms 1472 KB Output is correct
46 Correct 197 ms 1944 KB Output is correct
47 Correct 234 ms 1952 KB Output is correct
48 Correct 276 ms 2644 KB Output is correct
49 Correct 906 ms 55420 KB Output is correct
50 Correct 886 ms 55464 KB Output is correct
51 Correct 832 ms 55440 KB Output is correct
52 Correct 1012 ms 55520 KB Output is correct
53 Correct 831 ms 55564 KB Output is correct
54 Correct 869 ms 55460 KB Output is correct
55 Correct 879 ms 55464 KB Output is correct
56 Correct 169 ms 1944 KB Output is correct
57 Correct 321 ms 1984 KB Output is correct
58 Correct 498 ms 2588 KB Output is correct
59 Correct 1166 ms 55516 KB Output is correct
60 Correct 1535 ms 55560 KB Output is correct
61 Correct 1135 ms 55492 KB Output is correct
62 Correct 1006 ms 55584 KB Output is correct
63 Correct 1327 ms 55472 KB Output is correct
64 Correct 1084 ms 55544 KB Output is correct
65 Correct 1080 ms 55488 KB Output is correct
66 Correct 1140 ms 56004 KB Output is correct
67 Correct 1112 ms 58704 KB Output is correct
68 Correct 1050 ms 69796 KB Output is correct
69 Correct 1394 ms 79172 KB Output is correct