#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>
/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/
#ifdef LOCAL
#define dbg(x) cout << #x << " : " << x << endl;
#else
#define dbg(x)
#endif
#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
using namespace std;
template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }
ostream& operator << (ostream &out, const vector<int> &b) {
for (auto k : b) out << k << ' ';
return out;
}
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;
const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const double EPS = 1e-9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int x[201];
int t[201];
int xa[201];
int xb[201];
int ta[201];
int tb[201];
int dp[201][201][201][2];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, l;
cin >> n >> l;
for (int i = 0; i < n; ++i) {
cin >> x[i];
xb[i + 1] = x[i];
xa[n - i] = l - x[i];
}
for (int i = 0; i < n; ++i) {
cin >> t[i];
tb[i + 1] = t[i];
ta[n - i] = t[i];
}
for (int a = 0; a <= n; ++a) {
for (int b = 0; b + a <= n; ++b) {
for (int cnt = 0; cnt <= n; ++cnt) {
for (int ep = 0; ep < 2; ++ep) {
dp[a][b][cnt][ep] = BIG;
}
}
}
}
dp[0][0][0][1] = dp[0][0][0][0] = 0;
for (int s = 0; s < n; ++s) {
for (int a = 0; a <= s; ++a) {
int b = s - a;
for (int cnt = 0; cnt <= s; ++cnt) {
//ep = 0 - in a
int t2;
// a + 1
t2 = dp[a][b][cnt][0] + xa[a + 1] - xa[a];
mine(dp[a + 1][b][cnt + (t2 <= ta[a + 1])][0], t2);
// b + 1
t2 = dp[a][b][cnt][0] + xa[a] + xb[b + 1];
mine(dp[a][b + 1][cnt + (t2 <= tb[b + 1])][1], t2);
// ep = 1 - in b
// b + 1
t2 = dp[a][b][cnt][0] + xb[b + 1] - xb[b];
mine(dp[a][b + 1][cnt + (t2 <= tb[b + 1])][1], t2);
// a + 1
t2 = dp[a][b][cnt][0] + xb[b] + xa[a + 1];
mine(dp[a + 1][b][cnt + (t2 <= ta[a + 1])][1], t2);
}
}
}
for (int cnt = n; cnt >= 0; --cnt) {
for (int a = 0; a <= n; ++a) {
for (int b = max(0ll, cnt - a); a + b <= n; ++b) {
for (int ep = 0; ep < 2; ++ep) {
if (dp[a][b][cnt][ep] != BIG) {
cout << cnt << '\n';
exit(0);
}
}
}
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
