ACPC10D - Tri graphs

no tags 

Here’s a simple graph problem: Find the shortest path from the top-middle vertex to the bottom-middle vertex in a given tri-graph. A tri-graph is an acyclic graph of (N ≥ 2) rows and exactly 3 columns. Unlike regular graphs, the costs in a tri-graph are associated with the vertices rather than the edges.

a

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 top-middle vertex to the bottom-middle vertex.

Example

Input:
4
13 7 5
7 13 6
14 3 12
15 6 16
0

Output:
1. 22

hide comments
Abishek: 2016-01-16 04:17:01

top down gave runtime error . got AC with bottom up .

karthik1997: 2016-01-02 13:33:15

3 wa because of using fast i/o method for which i realized later that it would not scan negative values.
After that direct AC 0.0s

yashwanth_58: 2015-12-08 14:27:58

Last edit: 2015-12-08 14:44:12
Akshay Damle: 2015-10-17 17:32:51

1 WA for not considering output format >.< why does this always happen :|

ashish jaiswal: 2015-08-30 22:04:50

piece of cake

/* EDWARD KENWAY */: 2015-08-25 09:26:10

simple DP but don't forget to consider negative values.

kimo: 2015-08-20 07:55:44

There is negative input, beware of it!!

Diksha Jaiswal: 2015-07-20 12:55:18

1 WA cos of wrong output format :D

Sulabh Kumar: 2015-07-08 09:03:36

Dp works but bellman ford gives TLE.

SangKuan: 2015-06-21 11:09:13

thanks @Haijun Deng


Added by:Omar ElAzazy
Date:2010-11-30
Time limit:0.262s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:ACPC 2010