oj.uz

Submission #205264

# Submission time Handle Problem Language Result Execution time Memory
205264 2020-02-28T11:37:44 Z hanagasumi Abduction 2 (JOI17_abduction2) C++17
100 / 100
 3385 ms 153784 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <chrono>
 
#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll

using namespace std;
typedef long long ll;
typedef long double ld;

vector<int> logt;

void built_logt(int n) {
	logt = vector<int> (n + 2, 0);
	int cnt = 0, now = 1;
	for (int i = 0; i <= n + 1; i++) {
		if(now * 2 == i) {
			now *= 2;
			cnt++;
		}
		logt[i] = cnt;
	}
	return;
}

struct sparse {
	vector<vector<int>> table;
	int n, log;
	sparse() {}
	sparse(vector<int>& have) {
		n = len(have);
		log = 1;
		while((1 << log) <= n) 
			log *= 2;
		table = vector<vector<int>> (log + 1, vector<int> (n + 1, 0));
		for (int i = 0; i < n; i++) {
			table[0][i] = have[i];
		}
		for (int logn = 1; logn < log; logn++) {
			for (int i = 0; i < n; i++) {
				int nxt = min(n - 1, (1 << (logn - 1)) + i);
				table[logn][i] = max(table[logn - 1][i], table[logn - 1][nxt]);
			}
		}
		return;
	}
	int get(int l, int r) {
		// int ans = 0;
		// for (int i = l; i <= r; i++) {
		// 	ans = max(table[0][i], ans);
		// }
		// return ans;
		int lenn = (r - l + 1);
		int logn = logt[lenn];
		int pred = (r - (1 << logn) + 1);
		int ans = max(table[logn][l], table[logn][pred]);
		return ans;
	}
};

map<pair<int, int>, int> dp;
int w, h;
vector<int> a;
vector<int> b;
sparse as;
sparse bs;

int solve(int i, int j) {
	// cout << i << " " << j << endl;
	// cout << a[i] << " " << b[j] << endl;
	if(dp.count({i, j})) 
		return dp[{i, j}];
	if(a[i] > b[j]) {

		int l = j, r = w;
		while(r - l > 1) {
			int now = (l + r) / 2;
			if(bs.get(j, now) > a[i]) 
				r = now;
			else
				l = now;
		}

		if(r == w) 
			dp[{i, j}] = max(dp[{i, j}], w - j);
		else
			dp[{i, j}] = max(dp[{i, j}], r - j + solve(i, r));

		l = -1, r = j;
		while(r - l > 1) {
			int now = (l + r) / 2;
			if(bs.get(now, j) > a[i]) 
				l = now;
			else
				r = now;
		}
		if(l == -1) 
			dp[{i, j}] = max(dp[{i, j}], j + 1);
		else
			dp[{i, j}] = max(dp[{i, j}], j - l + solve(i, l));
	}
	else {


		int l = i, r = h;
		while(r - l > 1) {
			int now = (l + r) / 2;
			if(as.get(i, now) > b[j]) 
				r = now;
			else
				l = now;
		}
		if(r == h) 
			dp[{i, j}] = max(dp[{i, j}], h - i);
		else
			dp[{i, j}] = max(dp[{i, j}], r - i + solve(r, j));

		l = -1, r = i;
		while(r - l > 1) {
			int now = (l + r) / 2;
			if(as.get(now, i) > b[j]) 
				l = now;
			else
				r = now;
		}
		if(l == -1) 
			dp[{i, j}] = max(dp[{i, j}], i + 1);
		else
			dp[{i, j}] = max(dp[{i, j}], i - l + solve(l, j));
	}
	return dp[{i, j}];
}


signed main() {
	#ifdef PC 
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int q;
	cin >> h >> w >> q;
	a = vector<int> (h);
	b = vector<int> (w);
	for (int i = 0; i < h; i++) {
		cin >> a[i];
	}
	for (int j = 0; j < w; j++) {
		cin >> b[j];
	}
	built_logt(w + h);
	as = *new sparse(a);
	bs = *new sparse(b);
	for (int k = 0; k < q; k++) {
		int i, j;
		cin >> i >> j;
		i--, j--;
		int ans = 1;
		for (int j1 = j + 1; j1 < w; j1++) {
			ans = max(ans, j1 - j + 1);
			if(b[j1] > a[i]) {
				ans = max(ans, j1 - j + solve(i, j1));
				break;
			}
		}
		for (int j1 = j - 1; j1 >= 0; j1--) {
			ans = max(ans, j - j1 + 1);
			if(b[j1] > a[i]) {
				ans = max(ans, j - j1 + solve(i, j1));
				break;
			}
		}
		for (int i1 = i + 1; i1 < h; i1++) {
			ans = max(ans, i1 - i + 1);
			if(a[i1] > b[j]) {
				ans = max(ans, i1 - i + solve(i1, j));
				break;
			}
		}
		for (int i1 = i - 1; i1 >= 0; i1--) {
			ans = max(ans, i - i1 + 1);
			if(a[i1] > b[j]) {
				ans = max(ans, i - i1 + solve(i1, j));
				break;
			}
		}

		cout << ans - 1 << '\n';
	}

}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 1528 KB Output is correct
13 Correct 6 ms 1528 KB Output is correct
14 Correct 7 ms 1528 KB Output is correct
15 Correct 8 ms 1528 KB Output is correct
16 Correct 6 ms 1528 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 9 ms 1656 KB Output is correct
20 Correct 13 ms 1784 KB Output is correct
21 Correct 9 ms 1660 KB Output is correct
22 Correct 13 ms 1916 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 1528 KB Output is correct
13 Correct 6 ms 1528 KB Output is correct
14 Correct 7 ms 1528 KB Output is correct
15 Correct 8 ms 1528 KB Output is correct
16 Correct 6 ms 1528 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 9 ms 1656 KB Output is correct
20 Correct 13 ms 1784 KB Output is correct
21 Correct 9 ms 1660 KB Output is correct
22 Correct 13 ms 1916 KB Output is correct
23 Correct 42 ms 29552 KB Output is correct
24 Correct 46 ms 29552 KB Output is correct
25 Correct 43 ms 29524 KB Output is correct
26 Correct 42 ms 29552 KB Output is correct
27 Correct 42 ms 29552 KB Output is correct
28 Correct 82 ms 33776 KB Output is correct
29 Correct 45 ms 29940 KB Output is correct
30 Correct 157 ms 35184 KB Output is correct
31 Correct 207 ms 36884 KB Output is correct
32 Correct 46 ms 29296 KB Output is correct
33 Correct 81 ms 31092 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1656 KB Output is correct
2 Correct 9 ms 1656 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 9 ms 1660 KB Output is correct
5 Correct 11 ms 1656 KB Output is correct
6 Correct 8 ms 1784 KB Output is correct
7 Correct 10 ms 1656 KB Output is correct
8 Correct 13 ms 1912 KB Output is correct
9 Correct 13 ms 1912 KB Output is correct
10 Correct 15 ms 1912 KB Output is correct
11 Correct 14 ms 2040 KB Output is correct

Subtask #5
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 1528 KB Output is correct
13 Correct 6 ms 1528 KB Output is correct
14 Correct 7 ms 1528 KB Output is correct
15 Correct 8 ms 1528 KB Output is correct
16 Correct 6 ms 1528 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 9 ms 1656 KB Output is correct
20 Correct 13 ms 1784 KB Output is correct
21 Correct 9 ms 1660 KB Output is correct
22 Correct 13 ms 1916 KB Output is correct
23 Correct 42 ms 29552 KB Output is correct
24 Correct 46 ms 29552 KB Output is correct
25 Correct 43 ms 29524 KB Output is correct
26 Correct 42 ms 29552 KB Output is correct
27 Correct 42 ms 29552 KB Output is correct
28 Correct 82 ms 33776 KB Output is correct
29 Correct 45 ms 29940 KB Output is correct
30 Correct 157 ms 35184 KB Output is correct
31 Correct 207 ms 36884 KB Output is correct
32 Correct 46 ms 29296 KB Output is correct
33 Correct 81 ms 31092 KB Output is correct
34 Correct 11 ms 1656 KB Output is correct
35 Correct 9 ms 1656 KB Output is correct
36 Correct 10 ms 1656 KB Output is correct
37 Correct 9 ms 1660 KB Output is correct
38 Correct 11 ms 1656 KB Output is correct
39 Correct 8 ms 1784 KB Output is correct
40 Correct 10 ms 1656 KB Output is correct
41 Correct 13 ms 1912 KB Output is correct
42 Correct 13 ms 1912 KB Output is correct
43 Correct 15 ms 1912 KB Output is correct
44 Correct 14 ms 2040 KB Output is correct
45 Correct 56 ms 29604 KB Output is correct
46 Correct 54 ms 29552 KB Output is correct
47 Correct 65 ms 29552 KB Output is correct
48 Correct 75 ms 29528 KB Output is correct
49 Correct 59 ms 29552 KB Output is correct
50 Correct 107 ms 33520 KB Output is correct
51 Correct 111 ms 34032 KB Output is correct
52 Correct 256 ms 39280 KB Output is correct
53 Correct 253 ms 38520 KB Output is correct
54 Correct 246 ms 38000 KB Output is correct
55 Correct 387 ms 43248 KB Output is correct
56 Correct 3385 ms 153784 KB Output is correct
57 Correct 846 ms 61652 KB Output is correct
58 Correct 790 ms 60144 KB Output is correct
59 Correct 794 ms 60012 KB Output is correct