oj.uz

Submission #336762

# Submission time Handle Problem Language Result Execution time Memory
336762 2020-12-16T18:34:34 Z super_j6 Abduction 2 (JOI17_abduction2) C++14
27 / 100
 5000 ms 403820 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <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;
const T d[k] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n[2], q;
int a[2][mxn];
map<T, 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;
	int ret = 0;
	if(a[!(y & 1)][x[!(y & 1)]] > a[y & 1][x[y & 1]]){
		ret = sol(x + d[y], y);
	}else if(dp[y].count(x)){
		ret = dp[y][x];
	}else{
		int t = 0;
		for(int i = 0; i < 2; i++){
			int z = (y + 2 * i + 1) % k;
			ret = max(ret, sol(x + d[z], z));
			t += !!ret;
		}
		if(t) dp[y][x] = 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 1 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 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 122 ms 105964 KB Output is correct
20 Correct 139 ms 132332 KB Output is correct
21 Correct 128 ms 123756 KB Output is correct
22 Correct 336 ms 403820 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 122 ms 105964 KB Output is correct
20 Correct 139 ms 132332 KB Output is correct
21 Correct 128 ms 123756 KB Output is correct
22 Correct 336 ms 403820 KB Output is correct
23 Correct 18 ms 6892 KB Output is correct
24 Correct 23 ms 9324 KB Output is correct
25 Correct 21 ms 8064 KB Output is correct
26 Correct 25 ms 14316 KB Output is correct
27 Correct 18 ms 8300 KB Output is correct
28 Execution timed out 5085 ms 12724 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 876 KB Output is correct
2 Correct 8 ms 876 KB Output is correct
3 Correct 7 ms 876 KB Output is correct
4 Correct 8 ms 1004 KB Output is correct
5 Correct 10 ms 1004 KB Output is correct
6 Correct 26 ms 1004 KB Output is correct
7 Correct 26 ms 1004 KB Output is correct
8 Correct 156 ms 117996 KB Output is correct
9 Correct 163 ms 138988 KB Output is correct
10 Correct 145 ms 101484 KB Output is correct
11 Correct 278 ms 177900 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 7 ms 748 KB Output is correct
19 Correct 122 ms 105964 KB Output is correct
20 Correct 139 ms 132332 KB Output is correct
21 Correct 128 ms 123756 KB Output is correct
22 Correct 336 ms 403820 KB Output is correct
23 Correct 18 ms 6892 KB Output is correct
24 Correct 23 ms 9324 KB Output is correct
25 Correct 21 ms 8064 KB Output is correct
26 Correct 25 ms 14316 KB Output is correct
27 Correct 18 ms 8300 KB Output is correct
28 Execution timed out 5085 ms 12724 KB Time limit exceeded
29 Halted 0 ms 0 KB -