#include <bits/stdc++.h>
using namespace std;
#define int long long
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define lim 205
int n,l;
int x[lim],t[lim];
int32_t main(){
faster
cin>>n>>l;
FOR{
cin>>x[i];
}
FOR{
cin>>t[i];
}
int cev=0;
x[0]=1;
x[n+1]=l;
for(int i=1;i<=n+1;i++){
int cur_time=1,cur_ans=0;
for(int j=1;j<i;j++){
cur_time+=x[j]-x[j-1];
if(cur_time<=t[j])cur_ans++;
}
cur_time+=x[i-1]-1;
cur_time++;
for(int j=n;j>=i;j--){
cur_time+=x[j+1]-x[j];
if(cur_time<=t[j])cur_ans++;
}
//cout<<cur_ans<<endl;
cev=max(cev,cur_ans);
}
for(int i=n;i>=0;i--){
int cur_time=0,cur_ans=0;
for(int j=n;j>i;j--){
cur_time+=x[j+1]-x[j];
if(cur_time<=t[j])cur_ans++;
//if(i==4)cout<<cur_time<<" "<<j<<endl;
}
cur_time+=l-x[i+1];
cur_time++;
for(int j=1;j<=i;j++){
cur_time+=x[j]-x[j-1];
if(cur_time<=t[j])cur_ans++;
//if(i==4)cout<<cur_time<<" "<<j<<endl;
}
//cout<<cur_ans<<endl;
cev=max(cev,cur_ans);
}
cout<<cev<<'\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |