Contest Duration: - (local time) (300 minutes) Back to Home

Submission #18341911

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

int main(){
ll n,m;cin>>n>>m;
vi a(n),b(m);
rep(i,n)cin>>a[i];rep(i,m)cin>>b[i];
vvi dp(n+1,vi(m+1,-1));
function<ll(ll,ll,ll)> dfs=[&](ll i,ll j,ll k){
if(dp[i][j]!=-1)return dp[i][j];
if(i==n&&j==m)return 0ll;
if(i==n)return dp[i][j]=dfs(i,j+1,-k)+b[j]*k;
if(j==m)return dp[i][j]=dfs(i+1,j,-k)+a[i]*k;
if(k==1)return dp[i][j]=max(dfs(i+1,j,0)+a[i],dfs(i,j+1,0)+b[j]);
return dp[i][j]=min(dfs(i+1,j,1),dfs(i,j+1,1));
};
out(dfs(0,0,1));
}

Submission Info

Submission Time 2020-11-22 22:35:39+0900 B - ゲーム blackyuki C++ (GCC 9.2.1) 0 2900 Byte WA 43 ms 11200 KB

Judge Result

Set Name All
Score / Max Score 0 / 3
Status
 AC × 2 WA × 3
Set Name Test Cases
All 00, 01, 02, 90, 91
Case Name Status Exec Time Memory
00 AC 7 ms 3416 KB
01 WA 30 ms 8904 KB
02 WA 43 ms 11200 KB
90 AC 7 ms 3588 KB
91 WA 2 ms 3472 KB