Submission #20738


Source Code Expand

#include<cstdio>
#include<algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

const int INF=1<<29;

int main(){
	int n; scanf("%d",&n);
	int a[100][100];
	rep(i,n) rep(j,i+1) scanf("%d",a[i]+j);

	int dp[100][100];
	rep(i,n) rep(j,n) dp[i][j]=-INF;
	dp[0][0]=a[0][0];
	rep(i,n-1) rep(j,i+1) {
		dp[i+1][ j ]=max(dp[i+1][ j ],dp[i][j]+a[i+1][ j ]);
		dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+a[i+1][j+1]);
	}
	printf("%d\n",*max_element(dp[n-1],dp[n-1]+n));

	return 0;
}

Submission Info

Submission Time
Task D - 三角パズル
User fura2
Language C++ (G++ 4.6.4)
Score 100
Code Size 517 Byte
Status AC
Exec Time 23 ms
Memory 812 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:13:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name sub1 sub2
Score / Max Score 50 / 50 50 / 50
Status
AC × 13
AC × 24
Set Name Test Cases
sub1 sub1/input_0.txt, sub1/input_1.txt, sub1/input_14.txt, sub1/input_15.txt, sub1/input_18.txt, sub1/input_19.txt, sub1/input_2.txt, sub1/input_20.txt, sub1/input_3.txt, sub1/input_4.txt, sub1/input_5.txt, sub1/input_6.txt, sub1/input_9.txt
sub2 sub2/input_0.txt, sub2/input_1.txt, sub2/input_10.txt, sub2/input_11.txt, sub2/input_12.txt, sub2/input_13.txt, sub2/input_14.txt, sub2/input_15.txt, sub2/input_16.txt, sub2/input_17.txt, sub2/input_18.txt, sub2/input_19.txt, sub2/input_2.txt, sub2/input_20.txt, sub2/input_21.txt, sub2/input_22.txt, sub2/input_23.txt, sub2/input_3.txt, sub2/input_4.txt, sub2/input_5.txt, sub2/input_6.txt, sub2/input_7.txt, sub2/input_8.txt, sub2/input_9.txt
Case Name Status Exec Time Memory
sub1/input_0.txt AC 23 ms 692 KB
sub1/input_1.txt AC 19 ms 660 KB
sub1/input_14.txt AC 19 ms 696 KB
sub1/input_15.txt AC 20 ms 664 KB
sub1/input_18.txt AC 20 ms 664 KB
sub1/input_19.txt AC 20 ms 664 KB
sub1/input_2.txt AC 18 ms 676 KB
sub1/input_20.txt AC 20 ms 672 KB
sub1/input_3.txt AC 18 ms 664 KB
sub1/input_4.txt AC 21 ms 668 KB
sub1/input_5.txt AC 20 ms 668 KB
sub1/input_6.txt AC 20 ms 664 KB
sub1/input_9.txt AC 20 ms 672 KB
sub2/input_0.txt AC 19 ms 664 KB
sub2/input_1.txt AC 20 ms 672 KB
sub2/input_10.txt AC 20 ms 788 KB
sub2/input_11.txt AC 18 ms 792 KB
sub2/input_12.txt AC 20 ms 664 KB
sub2/input_13.txt AC 21 ms 784 KB
sub2/input_14.txt AC 19 ms 680 KB
sub2/input_15.txt AC 21 ms 680 KB
sub2/input_16.txt AC 20 ms 788 KB
sub2/input_17.txt AC 20 ms 812 KB
sub2/input_18.txt AC 20 ms 664 KB
sub2/input_19.txt AC 20 ms 660 KB
sub2/input_2.txt AC 20 ms 652 KB
sub2/input_20.txt AC 20 ms 660 KB
sub2/input_21.txt AC 21 ms 800 KB
sub2/input_22.txt AC 20 ms 764 KB
sub2/input_23.txt AC 20 ms 796 KB
sub2/input_3.txt AC 19 ms 684 KB
sub2/input_4.txt AC 19 ms 668 KB
sub2/input_5.txt AC 20 ms 644 KB
sub2/input_6.txt AC 20 ms 684 KB
sub2/input_7.txt AC 21 ms 768 KB
sub2/input_8.txt AC 20 ms 792 KB
sub2/input_9.txt AC 20 ms 668 KB