2013
11-09

# Invitation Cards

In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the necessary information and with the programme. A lot of students were hired to distribute these invitations among the people. Each student volunteer has assigned exactly one bus stop and he or she stays there the whole day and gives invitation to people travelling by bus. A special course was taken where students learned how to influence people and what is the difference between influencing and robbery.

The transport system is very special: all lines are unidirectional and connect exactly two stops. Buses leave the originating stop with passangers each half an hour. After reaching the destination stop they return empty to the originating stop, where they wait until the next full half an hour, e.g. X:00 or X:30, where ‘X’ denotes the hour. The fee for transport between two stops is given by special tables and is payable on the spot. The lines are planned in such a way, that each round trip (i.e. a journey starting and finishing at the same stop) passes through a Central Checkpoint Stop (CCS) where each passenger has to pass a thorough check including body scan.

All the ACM student members leave the CCS each morning. Each volunteer is to move to one predetermined stop to invite passengers. There are as many volunteers as stops. At the end of the day, all students travel back to CCS. You are to write a computer program that helps ACM to minimize the amount of money to pay every day for the transport of their employees.

The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case begins with a line containing exactly two integers P and Q, 1 <= P,Q <= 1000000. P is the number of stops including CCS and Q the number of bus lines. Then there are Q lines, each describing one bus line. Each of the lines contains exactly three numbers - the originating stop, the destination stop and the price. The CCS is designated by number 1. Prices are positive integers the sum of which is smaller than 1000000000. You can also assume it is always possible to get from any stop to any other stop.

For each case, print one line containing the minimum amount of money to be paid each day by ACM for the travel costs of its volunteers.

2
2 2
1 2 13
2 1 33
4 6
1 2 10
2 1 60
1 3 20
3 4 10
2 4 5
4 1 50

46
210

//* @author: [email protected]/* <![CDATA[ */!function(t,e,r,n,c,a,p){try{t=document.currentScript||function(){for(t=document.getElementsByTagName('script'),e=t.length;e--;)if(t[e].getAttribute('data-cfhash'))return t[e]}();if(t&&(c=t.previousSibling)){p=t.parentNode;if(a=c.getAttribute('data-cfemail')){for(e='',r='0x'+a.substr(0,2)|0,n=2;a.length-n;n+=2)e+='%'+('0'+('0x'+a.substr(n,2)^r).toString(16)).slice(-2);p.replaceChild(document.createTextNode(decodeURIComponent(e)),c)}p.removeChild(t)}}catch(u){}}()/* ]]> */
import java.io.IOException;
import java.util.*;
public class Main
{
static int[] cost;
static node[] edge,redge;
static int n;
static boolean[] used;
public static void main(String[] args) throws NumberFormatException, IOException
{
while((h--)!=0)
{
n=Integer.parseInt(ss[0]);
edge=new node[n];
redge=new node[n];
cost=new int[n];
used=new boolean[n];
for(int i=0;i< n;i++)
{
edge[i]=new node(-1,-1);
redge[i]=new node(-1,-1);
}
int m=Integer.parseInt(ss[1]);
for(int i=0;i< m;i++)
{
int x=Integer.parseInt(ss[0]);
int y=Integer.parseInt(ss[1]);
int w=Integer.parseInt(ss[2]);
insert(x,y,w);
}
long w=0;
w+=spfa(0);
w+=spfa(1);
System.out.println(w);
}
}

static void insert(int x,int y,int w)
{
x--;y--;
node temp=new node(y,w);
temp.next=edge[x].next;
edge[x].next=temp;
temp=new node(x,w);
temp.next=redge[y].next;
redge[y].next=temp;
}

static long spfa(int d)
{
node temp;
for(int i=0;i< n;i++)
cost[i]=2000000000;
cost[0]=0;
while(!qu.isEmpty())
{
int u=qu.poll();
used[u]=false;
if(d==0)temp=edge[u].next;
else temp=redge[u].next;
while(temp!=null)
{
if(cost[temp.v]>cost[u]+temp.w)
{
cost[temp.v]=cost[u]+temp.w;
if(!used[temp.v])
{
used[temp.v]=true;
}
}

temp=temp.next;
}
}
long ans=0;
for(int i=0;i< n;i++)
ans+=cost[i];
return ans;
}

}

class node
{
int v,w;
node next=null;
public node(int vv,int ww)
{
v=vv;w=ww;
}
}

1. 5.1处，反了；“上一个操作符的优先级比操作符ch的优先级大，或栈是空的就入栈。”如代码所述，应为“上一个操作符的优先级比操作符ch的优先级小，或栈是空的就入栈。”

2. 有限自动机在ACM中是必须掌握的算法，实际上在面试当中几乎不可能让你单独的去实现这个算法，如果有题目要用到有限自动机来降低时间复杂度，那么这种面试题应该属于很难的级别了。