ACPC10D  Tri graphs
Here’s a simple graph problem: Find the shortest path from the topmiddle vertex to the bottommiddle vertex in a given trigraph. A trigraph is an acyclic graph of (N ≥ 2) rows and exactly 3 columns. Unlike regular graphs, the costs in a trigraph are associated with the vertices rather than the edges.
So, considering the example with N = 4, the cost of going straight down from the top to bottom along the middle vertices is 7 + 13 + 3 + 6 = 29. The layout of the directional edges in the graph are always the same as illustrated in the figure.
Input
Your program will be tested on one or more test cases.
Each test case is specified using N + 1 lines where the first line specifies a single integer (2 ≤ N ≤ 100, 000) denoting the number of rows in the graph. N lines follow, each specifying three integers representing the cost of the vertices on the ith row from left to right. The square of each cost value is less than 1,000,000.
The last case is followed by a line with a single zero.
Output
For each test case, print the following line:
k. n
Where k is the test case number (starting at one,) and n is the least cost to go from the topmiddle vertex to the bottommiddle vertex.
Example
Input:
4
13 7 5
7 13 6
14 3 12
15 6 16
0
Output:
1. 22
hide comments
karthik1997:
20171215 09:30:33
Note :


jha_gaurav98:
20171018 08:59:36
The cost of vertices can even be negative. Costed me 1 wa 

gourav_123:
20171017 23:47:30
after this solve http://www.spoj.com/problems/BYTESM2/ 

prashant_351:
20170901 18:59:09
Testcase :


deepanshu0298:
20170623 21:26:13
Simple DP :)....AC in one go(Fill up your dp matrix along with taking inputs for efficiency):p


heisenberg0820:
20170613 12:42:43
AC in one go :) 

da_201501181:
20170509 21:46:49
Simple DP...!!


prabodh prakash:
20170427 18:30:58
I solved MISERMAN also, but this question gave me great insights into improving efficiency of code. 

Nour Alhadi:
20170424 16:43:16
for negative values my mistake was:


don_1234:
20170401 16:28:04
use long in java cost me 1 wa 
Added by:  Omar ElAzazy 
Date:  20101130 
Time limit:  0.262s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  ACPC 2010 