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.


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.


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.


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.


13 7 5
7 13 6
14 3 12
15 6 16

1. 22

hide comments
sahilsinghss: 2019-03-26 10:49:33

Wohoo 100 done

bloodgreed99: 2019-01-27 15:03:15

DP introductory question

gaurav1614: 2018-12-26 21:34:06

very easy problem.think in terms of reachable and unreachable nodes.

masterchef2209: 2018-10-11 23:29:50

simple dp with a small corner case

be1035016: 2018-06-19 12:39:46

define your own maxima if you are using it.dont rely on LONG_MAX in c++.

foool: 2018-06-17 00:54:12

top down AC....

ducky94tb: 2018-01-11 18:03:46

My careless, wasted too many time

Last edit: 2018-01-11 18:05:10
bani_raheja: 2018-01-02 20:14:10

easy af. Perfect example of "DP is nothing but brute force"

sdeven_0245: 2017-12-31 13:03:43

Easy one !!!!

dushyant7917: 2017-12-19 12:29:59

@karthik1997 why for testcase:
-1 -1 -1
-1 -1 -5
o/p: -3 shouldn't it be (-1-1=2)?

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