oj.uz

Submission #216860

# Submission time Handle Problem Language Result Execution time Memory
216860 2020-03-28T08:12:36 Z oolimry Collecting Stamps 3 (JOI20_ho_t3) C++14
0 / 100
 5 ms 640 KB 
#include <bits/stdc++.h>
#define x first
#define t second

using namespace std;
typedef pair<long long, long long> ii;
long long inf = (1LL << 48LL);
vector<ii> arr = {ii({0,0})};

static long long memo[205][205][205];
long long n, L; 


long long dp(int pos, int bound, int taken){
	if(memo[pos][bound][taken] != -1) return memo[pos][bound][taken];
	
	
	long long ans = inf;
	if(pos == 0 && bound == 0) return inf;
	if(pos == n+1 && bound == n+1) return inf;
	if(pos == 0 && bound == n+1){
		if(taken == 0) return 0;
		else return inf;
	}
	if(pos == n+1 && bound == 0){
		if(taken == 0) return 0;
		else return inf;
	}
	if(pos == 0 || pos == n+1) return inf;
	
	int pos2;
	long long dPos, dCross;

	if(pos < bound){
		pos2 = pos-1;
		if(pos2 == -1) pos2 = n+1;
	}
	else{
		pos2 = pos+1;
		if(pos2 == n+2) pos2 = 0;
	}
	
	if(pos > pos2) dPos = arr[pos].x - arr[pos2].x;
	else dPos = arr[pos2].x - arr[pos].x;
	
	

	///move from bound to pos
	if(bound > pos){
		dCross = L - (arr[bound].x - arr[pos].x);
	}
	else{
		dCross = L - (arr[pos].x - arr[bound].x);
	}
	
	assert(dPos >= 0);
	assert(dCross >= 0);
	
	//cout << pos << " " << bound << " " << taken << " " << pos2 << endl;
	if(pos == 1 && bound == 0){
		//cout << pos << " " << bound << " " << pos2 << " " << dPos << " " << dCross << "\n";
	}
	
	ans = min(ans, dp(pos2, bound, taken) + dPos);
	ans = min(ans, dp(bound, pos2, taken) + dCross);
	
	if(dp(pos2, bound, taken - 1) + dPos <= arr[pos].t){
		ans = min(dp(pos2, bound, taken - 1) + dPos, ans);
	}
	
	if(dp(bound, pos2, taken - 1) + dCross <= arr[pos].t){
		ans = min(dp(bound, pos2, taken - 1) + dCross, ans);
	}
	
	memo[pos][bound][taken] = ans;
	return ans;
}
int main(){
	//freopen("i.txt","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> L;
	
	for(int i = 0;i < n;i++){
		arr.push_back(ii(0,0));
	}
	
	for(int i = 1;i <= n;i++) cin >> arr[i].x;
	for(int i = 1;i <= n;i++) cin >> arr[i].t;
	arr.push_back(ii(L,0));
	
	for(int i = 0;i <= n + 1;i++){
		for(int j = 0;j <= n + 1;j++){
			for(int k = 0;k <= n + 1;k++){
				memo[i][j][k] = -1;
			}
		}
	}
	
	
	long long ANS = 0;
	for(long long taken = 0;taken <= n;taken++){
		for(int i = 0;i <= n + 1;i++){
			for(int j = 0;j <= n + 1;j++){
				long long DP = dp(i,j,taken);
				if(DP < inf){
					ANS = max(ANS, taken);
				}
			}
		}
	}
	
	cout << ANS;
	
	
	//cout << dp(1,0,1);
	
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 5 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 5 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 5 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 5 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -