Invitation Cards+POJ+有一道比较裸的最短路+spfa
2014-07-29 20:28
423 查看
Invitation Cards
Description
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.
Input
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.
Output
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.
Sample Input
Sample Output
Time Limit: 8000MS | Memory Limit: 262144K | |
Total Submissions: 19013 | Accepted: 6222 |
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.
Input
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.
Output
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.
Sample Input
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
Sample Output
46 210
解决方案:由于它要求的是去和回来的总价格,所以先原来的边来一遍spfa,然后把边反过来又来一遍spfa。
code:#include<iostream> #include<cstdio> #include<cstring> #include<queue> #define MMAX 1000006 using namespace std; typedef struct node { long long from,to,v; int next; } edge; const int inf=1<<30; edge E[2][MMAX]; long long P,Q,head[2][MMAX],d[2][MMAX]; bool inqueue[2][MMAX]; long long spfa(int cur) { queue<int > Q; Q.push(1); d[cur][1]=0; inqueue[cur][1]=true; while(!Q.empty()) { int temp=Q.front(); inqueue[cur][temp]=false; Q.pop(); for(int v=head[cur][temp]; v!=-1; v=E[cur][v].next) { if(d[cur][E[cur][v].to]>d[cur][temp]+E[cur][v].v) { d[cur][E[cur][v].to]=d[cur][temp]+E[cur][v].v; if(!inqueue[cur][E[cur][v].to]) { inqueue[cur][E[cur][v].to]=true; Q.push(E[cur][v].to); } } } } long long ans=0; for(int i=1; i<=P; i++)ans+=d[cur][i]; return ans; } int main() { int t; scanf("%d",&t); while(t--) { //cout<<inf<<endl; scanf("%lld%lld",&P,&Q); memset(head,-1,sizeof(head)); for(int i=0; i<=P; i++) d[0][i]=inf,d[1][i]=inf; memset(inqueue,false,sizeof(inqueue)); int k=0,s=0; for(int i=0; i<Q; i++) { long long a,b,c; scanf("%lld%lld%lld",&a,&b,&c); E[0][k].from=a; E[0][k].to=b; E[0][k].v=c; E[0][k].next=head[0][a]; head[0][a]=k++; E[1][s].from=b; E[1][s].to=a; E[1][s].v=c; E[1][s].next=head[1][b]; head[1][b]=s++; } long long ans=spfa(0); ans+=spfa(1); printf("%lld\n",ans); } return 0; }
相关文章推荐
- Invitation Cards POJ - 1511 最短路spfa
- 最短路spfaPOJInvitation Cardsj解题报告
- Invitation Cards POJ 1151 (SPFA)
- poj Invitation Cards(spfa)
- POJ 1511 Invitation Cards //spfa
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- POJ 3159 Candies差分约束系统 spfa 附:各种最短路比较
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- 最短路 Invitation Cards POJ - 1511
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)
- poj Invitation Cards(spfa)