Submission #629986

#	Time	Username	Problem	Language	Result	Execution time	Memory
629986		colossal_pepe	Collecting Stamps 3 (JOI20_ho_t3)	C++17	5 / 100	2103 ms	267576 KiB

ho_t3

#include <iostream>
#include <map>
using namespace std;

using ll = long long;

int n, l;
ll x[205], t[205];
map<ll, int> dp[205][205];

ll dist(int x1, int x2) {
    if (x1 > x2) swap(x1, x2);
    return min(x2 - x1, l - x2 + x1);
}

int solve(int i, int j, int time_passed) {
    if (abs(i - j) == 1) return 0;
    if (dp[i][j].count(time_passed)) return dp[i][j][time_passed];
    int cur = i, l = min(i, j), r = max(i, j);
    int ans = solve(l + 1, r, dist(x[cur], x[l + 1]) + time_passed) + (dist(x[cur], x[l + 1]) + time_passed <= t[l + 1]);
    ans = max(ans, solve(r - 1, l, dist(x[cur], x[r - 1]) + time_passed) + (dist(x[cur], x[r - 1]) + time_passed <= t[r - 1]));
    dp[i][j][time_passed] = ans;
    return ans;
}

int main() {
    cin >> n >> l;
    for (int i = 1; i <= n; i++) {
        cin >> x[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
    }
    t[0] = t[n + 1] = 0;
    cout << solve(0, n + 1, 0) << '\n';
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75