oj.uz

Submission #313352

# Submission time Handle Problem Language Result Execution time Memory
313352 2020-10-15T20:54:00 Z sofapuden Collecting Stamps 3 (JOI20_ho_t3) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
	int n, l; cin >> n >> l;
	vector<int> X(n), T(n);
	for(auto &x : X)cin >> x;
	for(auto &t : T)cin >> t;
	int ans = 0;
	for(int i = 0; i <= n; ++i){
		int cur = 0;
		int tim = 0;
		int place = l; 
		for(int j = 1; j <= i; ++j){
			tim+=place-X[n-j];
			place = X[n-j];
			if(tim <= T[n-j])cur++;
		}
		tim*=2;
		place = 0;
		for(int j = 0; j < n-i; ++j){
			tim+=X[j]-place;
			place = X[j];
			if(tim <= T[j])cur++;
		}
		ans = max(ans,cur);
	}
	cout << ans << "\n";
			
			
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 75.0

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