Submission #1493986


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
int main(void)
{
	int n;
	cin >> n;
	vector<vector<int>> arr;
	vector<int> arrray(n+1);
	arr.resize(n + 1);
	for (int i = 0; i < n + 1; i++)
	{
		arr[i].resize(n + 1);
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < i + 1; j++)
		{
			cin >> arr[i][j];
		}
	}
	for (int i = 1; i < n + 1; i++)
	{
		for (int j = 0; j < i + 1; j++)
		{
			if (j == 0)
			{
				arr[i][j] = arr[i - 1][j];
			}
			else 
			{
				arr[i][j] += max(arr[i - 1][j - 1], arr[i - 1][j]);
			}
		}
	}
	for (int i = 0; i < n+1; i++)
	{
		arrray[i] = arr[n][i];
	}
	sort(arrray.begin(), arrray.end());
	cout << arrray[n] << endl;
}

Submission Info

Submission Time
Task D - 三角パズル
User kasatomo03
Language C++14 (GCC 5.4.1)
Score 0
Code Size 695 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name sub1 sub2
Score / Max Score 0 / 50 0 / 50
Status
AC × 10
WA × 3
AC × 17
WA × 7
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 WA 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 WA 1 ms 256 KB
sub1/input_9.txt WA 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 WA 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 WA 1 ms 256 KB
sub2/input_21.txt WA 1 ms 256 KB
sub2/input_22.txt AC 1 ms 256 KB
sub2/input_23.txt WA 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 WA 1 ms 256 KB
sub2/input_7.txt AC 1 ms 256 KB
sub2/input_8.txt WA 1 ms 256 KB
sub2/input_9.txt WA 1 ms 256 KB