Submission #6414333

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

int dp[1010][1010];

int main() {
    int A, B;
    cin >> A >> B;

    vector<int> a(A), b(B);
    rep(i, A) cin >> a[i];
    rep(i, B) cin >> b[i];

    for (int i=A; i>=0; --i) {
        for (int j=B; j>=0; --j) {

            // 最終手番はスキップ
            if (i == A and j == B) continue;

            if ((i+j)%2 == 0) {
                // 自分の手番
                if (i == A) {
                    // Aの山札が空
                    dp[i][j] = b[j] + dp[i][j+1];
                }
                else if (j == B) {
                    // Bの山札が空
                    dp[i][j] = a[i] + dp[i+1][j];
                }
                else {
                    dp[i][j] = max(dp[i][j+1] + b[j], a[i] + dp[i+1][j]);
                }
            }
            else {
                // 相手の手番
                if (i == A) {
                    dp[i][j] = dp[i][j+1];
                }
                else if (j == B) {
                    dp[i][j] = dp[i+1][j];
                }
                else {
                    dp[i][j] = min(dp[i+1][j], dp[i][j+1]);
                }
            }
        }
    }

    cout << dp[0][0] << endl;
}

Submission Info

Judge Result