Submission #7068787


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int A[3][105],dp[2][105],N;
int solve(int i,int j)
{
    if(i>2||j>N)return -1e9;
    if(i==2&&j==N)return A[i][j];
    if(i==1&&j==N)return A[i][j]+A[2][N];
    if(dp[i][j]!=-1)return dp[i][j];
    int res=0;
    res = solve(i+1,j)+A[i][j];
    res = max(res,A[i][j]+solve(i,j+1));
    //cout<<i<<" "<<j<<" res = "<<res<<endl;
    return dp[i][j]=res;
}
int main ()
{
    memset(dp,-1,sizeof dp);
    cin >> N;
    for(int i=1;i<=2;i++){
        for(int j=1;j<=N;j++)
            cin >> A[i][j];
    }
    cout<<solve(1,1);
    return 0;
}
/*

*/

Submission Info

Submission Time
Task C - Candies
User Frdhsn
Language C++14 (GCC 5.4.1)
Score 0
Code Size 620 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
WA × 1
AC × 5
WA × 11
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample01.txt, sample02.txt, sample03.txt, sample04.txt
Case Name Status Exec Time Memory
01.txt WA 1 ms 256 KB
02.txt WA 1 ms 256 KB
03.txt WA 1 ms 256 KB
04.txt WA 1 ms 256 KB
05.txt WA 1 ms 256 KB
06.txt WA 1 ms 256 KB
07.txt WA 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt WA 1 ms 256 KB
10.txt WA 1 ms 256 KB
11.txt WA 1 ms 256 KB
12.txt AC 1 ms 256 KB
sample01.txt WA 1 ms 256 KB
sample02.txt AC 1 ms 256 KB
sample03.txt AC 1 ms 256 KB
sample04.txt AC 1 ms 256 KB