Submission #696315

#	Time	Username	Problem	Language	Result	Execution time	Memory
696315		stevancv	Collecting Stamps 3 (JOI20_ho_t3)	C++14	0 / 100	0 ms	468 KiB

ho_t3

// GPT TESTING
#include <bits/stdc++.h>
using namespace std;

const int N = 205;
int n, m, a[N], b[N], f[N][N];

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    memset(f, 0x3f, sizeof f);
    f[0][0] = 0;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            if (f[i][j] >= m) continue;
            if (i + 1 <= n) f[i + 1][j] = min(f[i + 1][j], f[i][j] + (a[i + 1] + b[i + 1]));
            if (j + 1 <= n) f[i][j + 1] = min(f[i][j + 1], f[i][j] + (a[j + 1] + b[j + 1]));
            if (i + 1 <= n && j + 1 <= n) f[i + 1][j + 1] = min(f[i + 1][j + 1], f[i][j] + abs(a[i + 1] - a[j + 1]) + abs(b[i + 1] - b[j + 1]));
        }
    }
    int ans = 0;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            if (f[i][j] >= m) continue;
            ans = max(ans, i + j);
        }
    }
    cout << ans << endl;
    return 0;
}

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