oj.uz

Submission #336760

# Submission time Handle Problem Language Result Execution time Memory
336760 2020-12-16T18:27:41 Z super_j6 Abduction 2 (JOI17_abduction2) C++14
27 / 100
 480 ms 452972 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 = 2000, k = 4;
const T d[k] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n[2], q;
int a[2][mxn];
int dp[k][mxn][mxn];

int sol(T x, int y){
	for(int i = 0; i < 2; i++) if(x[i] < 0 || x[i] >= n[i]) return 0;
	if(dp[y][x[0]][x[1]]) return dp[y][x[0]][x[1]];
	int ret = 0;
	if(a[!(y & 1)][x[!(y & 1)]] < a[y & 1][x[y & 1]]){
		for(int i = 0; i < 2; i++){
			int z = (y + 2 * i + 1) % k;
			ret = max(ret, sol(x + d[z], z));
		}
	}else{
		ret = sol(x + d[y], y);
	}
	return dp[y][x[0]][x[1]] = ++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 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 0 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 0 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 10 ms 13160 KB Output is correct
13 Correct 4 ms 5228 KB Output is correct
14 Correct 7 ms 9196 KB Output is correct
15 Correct 10 ms 11756 KB Output is correct
16 Correct 5 ms 5868 KB Output is correct
17 Correct 9 ms 9324 KB Output is correct
18 Correct 24 ms 13676 KB Output is correct
19 Correct 199 ms 142572 KB Output is correct
20 Correct 235 ms 173508 KB Output is correct
21 Correct 211 ms 162924 KB Output is correct
22 Correct 480 ms 452972 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 0 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 10 ms 13160 KB Output is correct
13 Correct 4 ms 5228 KB Output is correct
14 Correct 7 ms 9196 KB Output is correct
15 Correct 10 ms 11756 KB Output is correct
16 Correct 5 ms 5868 KB Output is correct
17 Correct 9 ms 9324 KB Output is correct
18 Correct 24 ms 13676 KB Output is correct
19 Correct 199 ms 142572 KB Output is correct
20 Correct 235 ms 173508 KB Output is correct
21 Correct 211 ms 162924 KB Output is correct
22 Correct 480 ms 452972 KB Output is correct
23 Runtime error 5 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 34796 KB Output is correct
2 Correct 29 ms 35564 KB Output is correct
3 Correct 31 ms 35564 KB Output is correct
4 Correct 30 ms 35564 KB Output is correct
5 Correct 30 ms 36076 KB Output is correct
6 Correct 84 ms 39916 KB Output is correct
7 Correct 93 ms 40044 KB Output is correct
8 Correct 271 ms 165888 KB Output is correct
9 Correct 268 ms 185836 KB Output is correct
10 Correct 249 ms 148204 KB Output is correct
11 Correct 451 ms 231648 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 0 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 10 ms 13160 KB Output is correct
13 Correct 4 ms 5228 KB Output is correct
14 Correct 7 ms 9196 KB Output is correct
15 Correct 10 ms 11756 KB Output is correct
16 Correct 5 ms 5868 KB Output is correct
17 Correct 9 ms 9324 KB Output is correct
18 Correct 24 ms 13676 KB Output is correct
19 Correct 199 ms 142572 KB Output is correct
20 Correct 235 ms 173508 KB Output is correct
21 Correct 211 ms 162924 KB Output is correct
22 Correct 480 ms 452972 KB Output is correct
23 Runtime error 5 ms 620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -