Submission #3273071

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
	if (n == 0)return 1;
	if (n == 1)return x%MOD;
	ll res = sq(mod_pow(x, n / 2));
	res %= MOD;
	if (n % 2 == 1) {
		res *= x;
		res %= MOD;
	}
	return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }

int A,B;
ll a[1000];
ll b[1000];

ll dp[1001][1001];

ll solve(int ac,int bc, bool t){
	if(dp[ac][bc] != -1)return dp[ac][bc];
	if(ac >= A && bc >= B)return dp[ac][bc] = 0;

	if(!t){
		if(ac >= A)return dp[ac][bc] = solve(ac,bc+1,!t)+b[bc];
		if(bc >= B)return dp[ac][bc] = solve(ac+1,bc,!t)+a[ac];
		return dp[ac][bc] = max(solve(ac+1,bc,!t)+a[ac], solve(ac,bc+1,!t)+b[bc]);
	}
	if(ac >= A)return dp[ac][bc] = solve(ac,bc+1,!t);
	if(bc >= B)return dp[ac][bc] = solve(ac+1,bc,!t);
	return dp[ac][bc] = min(solve(ac+1,bc,!t), solve(ac,bc+1,!t));
}

int main(){
	cin >> A >> B;
	rep(i,A)cin >> a[i];
	rep(i,B)cin >> b[i];
	rep(i,1001)rep(j,1001)dp[i][j] = -1;
	cout << solve(0,0,0) << endl;
	// rep(i,A){
	// 	rep(j,B)cout << dp[i][j] << " ";
	// 	cout << endl;
	// }
}

Submission Info

Judge Result