Submission #8416314

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Is(c) ('0'<=c && c<='9')
inline int read(){
	int x=0;bool f=0;char c=getchar();
	while(!Is(c)) f=c=='-',c=getchar();
	while(Is(c)) x=x*10+c-48,c=getchar();
	return f ? -x : x;
}
int x,y,z;
int A[5001],B[5001],C[5001];
ll dp[2][3501][3501];
int main(){
//	freopen("b.in","r",stdin);
//	freopen("b.out","w",stdout);
	x=read(),y=read(),z=read();
	for(int i=1;i<=x+y+z;i++) A[i]=read(),B[i]=read(),C[i]=read();
	for(int i=1;i<=x+y+z;i++)
		for(int j=0;j<=x;j++)
			for(int k=0;k<=y;k++){
				dp[i%2][j][k]=0;
				if(j) dp[i%2][j][k]=max(dp[i%2][j][k],(ll)dp[(i-1)%2][j-1][k]+A[i]);
				if(k) dp[i%2][j][k]=max(dp[i%2][j][k],(ll)dp[(i-1)%2][j][k-1]+B[i]);
				if(i-j-k) dp[i%2][j][k]=max(dp[i%2][j][k],(ll)dp[(i-1)%2][j][k]+C[i]);
			}
	cout<<dp[(x+y+z)%2][x][y];
	return 0;
}

Submission Info

Submission Time
Task C - Coins
User Junglove
Language C++14 (GCC 5.4.1)
Score 0
Code Size 874 Byte
Status RE
Exec Time 104 ms
Memory 2304 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 3
AC × 8
RE × 27
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 2304 KiB
sample_02.txt AC 2 ms 2304 KiB
sample_03.txt AC 2 ms 2304 KiB
subtask_1_01.txt AC 2 ms 2304 KiB
subtask_1_02.txt RE 99 ms 256 KiB
subtask_1_03.txt RE 99 ms 256 KiB
subtask_1_04.txt RE 99 ms 256 KiB
subtask_1_05.txt RE 99 ms 256 KiB
subtask_1_06.txt RE 102 ms 256 KiB
subtask_1_07.txt RE 101 ms 256 KiB
subtask_1_08.txt RE 99 ms 256 KiB
subtask_1_09.txt RE 104 ms 256 KiB
subtask_1_10.txt RE 104 ms 256 KiB
subtask_1_11.txt RE 98 ms 256 KiB
subtask_1_12.txt RE 98 ms 256 KiB
subtask_1_13.txt RE 103 ms 256 KiB
subtask_1_14.txt RE 102 ms 256 KiB
subtask_1_15.txt RE 99 ms 256 KiB
subtask_1_16.txt RE 97 ms 256 KiB
subtask_1_17.txt RE 98 ms 256 KiB
subtask_1_18.txt RE 101 ms 256 KiB
subtask_1_19.txt RE 101 ms 256 KiB
subtask_1_20.txt RE 102 ms 256 KiB
subtask_1_21.txt RE 100 ms 256 KiB
subtask_1_22.txt RE 99 ms 256 KiB
subtask_1_23.txt RE 100 ms 256 KiB
subtask_1_24.txt RE 99 ms 256 KiB
subtask_1_25.txt RE 102 ms 256 KiB
subtask_1_26.txt RE 102 ms 256 KiB
subtask_1_27.txt RE 101 ms 256 KiB
subtask_1_28.txt RE 99 ms 256 KiB
subtask_1_29.txt AC 2 ms 2304 KiB