Submission #1493913


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#define loop(i,n) for(int i = 0; i < n; i++)
#define FOR(x,y,z) for(int x = y; x < z; x++)
#define INM 1145141919;
#define VEC vector<int>
#define in push_back
#define ans(x) cout<<x<<endl
#define ll long long int

using namespace std;

	int num[100][100];
	int dp[100][100];

int main()
{
	int n;
	cin >> n;
	loop(i, n)
	{
		for(int j = 0; j <= i; j++)
		{
			cin >> num[i][j];
		}
	}
	loop(i, n)
	{
		for(int j = 0; j <= i; j++)
		{
			dp[i][j] = num[i][j] + max(dp[i - 1][j - 1], dp[i - 1][j]);
		}
	}
	int ret = 0;
	loop(i, n)
	{
		if (dp[n - 1][i] > ret)ret = dp[n - 1][i];
	}
	ans(ret);
}

Submission Info

Submission Time
Task D - 三角パズル
User keitou
Language C++14 (GCC 5.4.1)
Score 100
Code Size 732 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

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 1 ms 256 KB
sub1/input_1.txt AC 1 ms 256 KB
sub1/input_14.txt AC 1 ms 256 KB
sub1/input_15.txt AC 1 ms 256 KB
sub1/input_18.txt AC 1 ms 256 KB
sub1/input_19.txt AC 1 ms 256 KB
sub1/input_2.txt AC 1 ms 256 KB
sub1/input_20.txt AC 1 ms 256 KB
sub1/input_3.txt AC 1 ms 256 KB
sub1/input_4.txt AC 1 ms 256 KB
sub1/input_5.txt AC 1 ms 256 KB
sub1/input_6.txt AC 1 ms 256 KB
sub1/input_9.txt AC 1 ms 256 KB
sub2/input_0.txt AC 1 ms 256 KB
sub2/input_1.txt AC 1 ms 256 KB
sub2/input_10.txt AC 1 ms 256 KB
sub2/input_11.txt AC 1 ms 256 KB
sub2/input_12.txt AC 1 ms 256 KB
sub2/input_13.txt AC 1 ms 256 KB
sub2/input_14.txt AC 1 ms 256 KB
sub2/input_15.txt AC 1 ms 256 KB
sub2/input_16.txt AC 1 ms 256 KB
sub2/input_17.txt AC 1 ms 256 KB
sub2/input_18.txt AC 1 ms 256 KB
sub2/input_19.txt AC 1 ms 256 KB
sub2/input_2.txt AC 1 ms 256 KB
sub2/input_20.txt AC 1 ms 256 KB
sub2/input_21.txt AC 1 ms 256 KB
sub2/input_22.txt AC 1 ms 256 KB
sub2/input_23.txt AC 1 ms 256 KB
sub2/input_3.txt AC 1 ms 256 KB
sub2/input_4.txt AC 1 ms 256 KB
sub2/input_5.txt AC 1 ms 256 KB
sub2/input_6.txt AC 1 ms 256 KB
sub2/input_7.txt AC 1 ms 256 KB
sub2/input_8.txt AC 1 ms 256 KB
sub2/input_9.txt AC 1 ms 256 KB