oj.uz

Submission #336779

# Submission time Handle Problem Language Result Execution time Memory
336779 2020-12-16T19:09:11 Z super_j6 Abduction 2 (JOI17_abduction2) C++14
27 / 100
 5000 ms 379776 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <unordered_map>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
 
typedef array<int, 2> T;
 
T operator+(T x, T y){
	return {x[0] + y[0], x[1] + y[1]};
}
 
const int mxn = 50000, k = 4, w = 3;
const T d[k] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n[2], q;
int a[2][mxn];
unordered_map<ll, int> dp[k];
 
int sol(T x, int y){
	for(int i = 0; i < 2; i++) if(x[i] < 0 || x[i] >= n[i]) return 0;
	ll f = (ll)x[0] * mxn + x[1];
	int ret = 0;
	if(dp[y].count(f)){
		ret = dp[y][f];
	} else if(a[!(y & 1)][x[!(y & 1)]] > a[y & 1][x[y & 1]]){
		ret = sol(x + d[y], y);
		if(!(x[0] % w) && !(x[1] % w)) dp[y][f] = ret;
	}else{
		for(int i = 0; i < 2; i++){
			int z = (y + 2 * i + 1) % k;
			ret = max(ret, sol(x + d[z], z));
		}
		dp[y][f] = ret;
	}
	return ++ret;
}
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n[0] >> n[1] >> q;
	
	for(int i = 0; i < 2; i++)
	for(int j = 0; j < n[i]; j++){
		cin >> a[i][j];
	}
	
	while(q--){
		T x;
		for(int i = 0; i < 2; i++) cin >> x[i], x[i]--;
		int ret = 0;
		for(int i = 0; i < k; i++) ret = max(ret, sol(x + d[i], i));
		cout << ret << endl;
	}
 
	return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 4 ms 1004 KB Output is correct
18 Correct 21 ms 3136 KB Output is correct
19 Correct 204 ms 106108 KB Output is correct
20 Correct 262 ms 132636 KB Output is correct
21 Correct 229 ms 123004 KB Output is correct
22 Correct 509 ms 379776 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 4 ms 1004 KB Output is correct
18 Correct 21 ms 3136 KB Output is correct
19 Correct 204 ms 106108 KB Output is correct
20 Correct 262 ms 132636 KB Output is correct
21 Correct 229 ms 123004 KB Output is correct
22 Correct 509 ms 379776 KB Output is correct
23 Correct 24 ms 6892 KB Output is correct
24 Correct 33 ms 8940 KB Output is correct
25 Correct 29 ms 8044 KB Output is correct
26 Correct 35 ms 13036 KB Output is correct
27 Correct 21 ms 7788 KB Output is correct
28 Execution timed out 5067 ms 262340 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1388 KB Output is correct
2 Correct 15 ms 1132 KB Output is correct
3 Correct 16 ms 1388 KB Output is correct
4 Correct 15 ms 1516 KB Output is correct
5 Correct 14 ms 1516 KB Output is correct
6 Correct 96 ms 10792 KB Output is correct
7 Correct 98 ms 10536 KB Output is correct
8 Correct 334 ms 127372 KB Output is correct
9 Correct 329 ms 144520 KB Output is correct
10 Correct 310 ms 112416 KB Output is correct
11 Correct 521 ms 188288 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 4 ms 1004 KB Output is correct
18 Correct 21 ms 3136 KB Output is correct
19 Correct 204 ms 106108 KB Output is correct
20 Correct 262 ms 132636 KB Output is correct
21 Correct 229 ms 123004 KB Output is correct
22 Correct 509 ms 379776 KB Output is correct
23 Correct 24 ms 6892 KB Output is correct
24 Correct 33 ms 8940 KB Output is correct
25 Correct 29 ms 8044 KB Output is correct
26 Correct 35 ms 13036 KB Output is correct
27 Correct 21 ms 7788 KB Output is correct
28 Execution timed out 5067 ms 262340 KB Time limit exceeded
29 Halted 0 ms 0 KB -