oj.uz

Submission #336766

# Submission time Handle Problem Language Result Execution time Memory
336766 2020-12-16T18:43:47 Z super_j6 Abduction 2 (JOI17_abduction2) C++14
17 / 100
 1421 ms 524292 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 = 2;
const T d[k] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n[2], q;
int a[2][mxn];
unordered_map<int, int> dp[k][mxn];
 
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(dp[y][x[0]].count(x[1])){
		ret = dp[y][x[0]][x[1]];
	}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][x[0]][x[1]] = 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][x[0]][x[1]] = 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 8 ms 11244 KB Output is correct
2 Correct 8 ms 11244 KB Output is correct
3 Correct 8 ms 11244 KB Output is correct
4 Correct 8 ms 11244 KB Output is correct
5 Correct 8 ms 11244 KB Output is correct
6 Correct 8 ms 11244 KB Output is correct
7 Correct 8 ms 11244 KB Output is correct
8 Correct 8 ms 11244 KB Output is correct
9 Correct 8 ms 11244 KB Output is correct
10 Correct 8 ms 11244 KB Output is correct
11 Correct 8 ms 11244 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11244 KB Output is correct
2 Correct 8 ms 11244 KB Output is correct
3 Correct 8 ms 11244 KB Output is correct
4 Correct 8 ms 11244 KB Output is correct
5 Correct 8 ms 11244 KB Output is correct
6 Correct 8 ms 11244 KB Output is correct
7 Correct 8 ms 11244 KB Output is correct
8 Correct 8 ms 11244 KB Output is correct
9 Correct 8 ms 11244 KB Output is correct
10 Correct 8 ms 11244 KB Output is correct
11 Correct 8 ms 11244 KB Output is correct
12 Correct 10 ms 11756 KB Output is correct
13 Correct 9 ms 11756 KB Output is correct
14 Correct 9 ms 11628 KB Output is correct
15 Correct 9 ms 11756 KB Output is correct
16 Correct 10 ms 11756 KB Output is correct
17 Correct 17 ms 13932 KB Output is correct
18 Correct 77 ms 28780 KB Output is correct
19 Correct 558 ms 195172 KB Output is correct
20 Correct 683 ms 239852 KB Output is correct
21 Correct 596 ms 217068 KB Output is correct
22 Runtime error 950 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11244 KB Output is correct
2 Correct 8 ms 11244 KB Output is correct
3 Correct 8 ms 11244 KB Output is correct
4 Correct 8 ms 11244 KB Output is correct
5 Correct 8 ms 11244 KB Output is correct
6 Correct 8 ms 11244 KB Output is correct
7 Correct 8 ms 11244 KB Output is correct
8 Correct 8 ms 11244 KB Output is correct
9 Correct 8 ms 11244 KB Output is correct
10 Correct 8 ms 11244 KB Output is correct
11 Correct 8 ms 11244 KB Output is correct
12 Correct 10 ms 11756 KB Output is correct
13 Correct 9 ms 11756 KB Output is correct
14 Correct 9 ms 11628 KB Output is correct
15 Correct 9 ms 11756 KB Output is correct
16 Correct 10 ms 11756 KB Output is correct
17 Correct 17 ms 13932 KB Output is correct
18 Correct 77 ms 28780 KB Output is correct
19 Correct 558 ms 195172 KB Output is correct
20 Correct 683 ms 239852 KB Output is correct
21 Correct 596 ms 217068 KB Output is correct
22 Runtime error 950 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15596 KB Output is correct
2 Correct 24 ms 15340 KB Output is correct
3 Correct 27 ms 16108 KB Output is correct
4 Correct 25 ms 15852 KB Output is correct
5 Correct 31 ms 16108 KB Output is correct
6 Correct 337 ms 83748 KB Output is correct
7 Correct 333 ms 84332 KB Output is correct
8 Correct 885 ms 265580 KB Output is correct
9 Correct 851 ms 274520 KB Output is correct
10 Correct 864 ms 246764 KB Output is correct
11 Correct 1421 ms 396268 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11244 KB Output is correct
2 Correct 8 ms 11244 KB Output is correct
3 Correct 8 ms 11244 KB Output is correct
4 Correct 8 ms 11244 KB Output is correct
5 Correct 8 ms 11244 KB Output is correct
6 Correct 8 ms 11244 KB Output is correct
7 Correct 8 ms 11244 KB Output is correct
8 Correct 8 ms 11244 KB Output is correct
9 Correct 8 ms 11244 KB Output is correct
10 Correct 8 ms 11244 KB Output is correct
11 Correct 8 ms 11244 KB Output is correct
12 Correct 10 ms 11756 KB Output is correct
13 Correct 9 ms 11756 KB Output is correct
14 Correct 9 ms 11628 KB Output is correct
15 Correct 9 ms 11756 KB Output is correct
16 Correct 10 ms 11756 KB Output is correct
17 Correct 17 ms 13932 KB Output is correct
18 Correct 77 ms 28780 KB Output is correct
19 Correct 558 ms 195172 KB Output is correct
20 Correct 683 ms 239852 KB Output is correct
21 Correct 596 ms 217068 KB Output is correct
22 Runtime error 950 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)