#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 200+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
ll a[mx];
ll b[mx];
ll dp[mx][mx][mx][2];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
cin>>n>>m;
fip(1,n+1){
cin>>a[i];
}
fip(1,n+1){
cin>>b[i];
}
fip(0,n+1)
fjp(0,n+1)
fp(k,0,n+1)
dp[i][j][k][0] = dp[i][j][k][1] = 1e18;
fip(1,n+1){
if(a[i]<=b[i])
dp[0][i][1][0] = a[i];
else
dp[0][i][0][0] = a[i];
}
fip(1,n+1){
if(m-a[i]<=b[i])
dp[i][0][1][1] = m-a[i];
else
dp[i][0][0][1] = m-a[i];
}
dp[0][0][0][0] = 0;
dp[0][0][0][1] = 0;
fjp(0,n+1){
fin(n,0){
fp(k,0,n){
// debug(i);
// debug(j);
// debug(k);
// debug(dp[i][j][k][0]);
// debug(dp[i][j][k][1]);
if(i==0){
fp(l,1,n+1){
if(l>j){
if(dp[i][j][k][0]+a[l]-a[j] <= b[l])
dp[i][l][k+1][0] = min(dp[i][j][k][0]+a[l]-a[j],dp[i][l][k+1][0]);
else
dp[i][l][k][0] = min(dp[i][j][k][0]+a[l]-a[j],dp[i][l][k][0]);
if(dp[i][j][k][0]+m-a[l]+a[j] <= b[l])
dp[l][j][k+1][1] = min(dp[i][j][k][0]+m-a[l]+a[j],dp[l][j][k+1][1]);
else
dp[l][j][k][1] = min(dp[i][j][k][0]+m-a[l]+a[j],dp[l][j][k][1]);
}
}
}else if(j==0){
fp(l,1,n+1){
if(l<i){
if(dp[i][j][k][1]+a[i]-a[l] <= b[l])
dp[l][j][k+1][1] = min(dp[i][j][k][1]+a[i]-a[l],dp[l][j][k+1][1]);
else
dp[l][j][k][1] = min(dp[i][j][k][1]+a[i]-a[l],dp[l][j][k][1] );
if(dp[i][j][k][1]+a[l]+m-a[i] <= b[l])
dp[i][l][k+1][0] = min(dp[i][j][k][1]+a[l]+m-a[i],dp[i][l][k+1][0]);
else
dp[i][l][k][0] = min(dp[i][j][k][1]+a[l]+m-a[i],dp[i][l][k][0] );
}
}
}else{
fp(l,1,n+1){
if(j<i && l<i && l>j){
if(dp[i][j][k][0]+a[l]-a[j] <= b[l])
dp[i][l][k+1][0] = min(dp[i][j][k][0]+a[l]-a[j],dp[i][l][k+1][0]);
else
dp[i][l][k][0] = min(dp[i][j][k][0]+a[l]-a[j],dp[i][l][k][0]);
if(dp[i][j][k][1]+a[l]+m-a[i] <= b[l])
dp[i][l][k+1][0] = min(dp[i][j][k][1]+a[l]+m-a[i],dp[i][l][k+1][0]);
else
dp[i][l][k][0] = min(dp[i][j][k][1]+a[l]+m-a[i],dp[i][l][k][0] );
if(dp[i][j][k][1]+a[i]-a[l] <= b[l])
dp[l][j][k+1][1] = min(dp[i][j][k][1]+a[i]-a[l],dp[l][j][k+1][1]);
else
dp[l][j][k][1] = min(dp[i][j][k][1]+a[i]-a[l],dp[l][j][k][1] );
if(dp[i][j][k][0]+m-a[l]+a[j] <= b[l])
dp[l][j][k+1][1] = min(dp[i][j][k][0]+m-a[l]+a[j],dp[l][j][k+1][1]);
else
dp[l][j][k][1] = min(dp[i][j][k][0]+m-a[l]+a[j],dp[l][j][k][1]);
}
}
}
// cerr<<nli;
}
}
}
ans = -1e18;
fip(0,n+1)
fjn(n,0)
fp(k,0,n+1){
if(dp[i][j][k][0]!=1e18 || dp[i][j][k][1]!=1e18)
ans = max(k,ans);
}
cout<<ans<<nli;
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
