POJ 题目1511 Invitation Cards(最短路)
2015-01-22 17:11
274 查看
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
Source
Central Europe 1998
题目大意:有1点向其他点送请帖,最后还返回1点问最短路
ac代码
#include<stdio.h>
#include<string.h>
#include<string>
#include<queue>
#include<iostream>
#define INF 1<<30
using namespace std;
int v[1000005],head[1000005];
int a[1000005],b[1000005],c[1000005];
__int64 dis[1000005];
struct s
{
int to,w,next;
}node[2000005];
int n,m,cot;
void add(int u,int v,int c)
{
//node[cot].st=u;
node[cot].to=v;
node[cot].w=c;
node[cot].next=head[u];
head[u]=cot++;
}
void spfa(int u)
{
int i;
queue<int>q;
for(i=0;i<n+1;i++)
{
v[i]=0;
dis[i]=INF;
}
v[u]=1;
dis[u]=0;
q.push(u);
while(!q.empty())
{
int cur=q.front();
q.pop();
v[cur]=0;
for(i=head[cur];i!=-1;i=node[i].next)
{
int to;
to=node[i].to;
if(dis[to]>dis[cur]+node[i].w)
{
dis[to]=dis[cur]+node[i].w;
if(!v[to])
{
v[to]=1;
q.push(to);
}
}
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i;
__int64 sum=0;
scanf("%d%d",&n,&m);
cot=0;
memset(head,-1,sizeof(head));
for(i=0;i<m;i++)
{
//int a,b,c;
scanf("%d%d%d",&a[i],&b[i],&c[i]);
add(a[i],b[i],c[i]);
}
spfa(1);
for(i=1;i<=n;i++)
{
sum+=dis[i];
}
memset(head,-1,sizeof(head));
cot=0;
for(i=0;i<m;i++)//反向建图,用spfa求有i点返回1点最短路
{
add(b[i],a[i],c[i]);
}
spfa(1);
for(i=1;i<=n;i++)
{
sum+=dis[i];
}
printf("%I64d\n",sum);
}
}
Time Limit: 8000MS | Memory Limit: 262144K | |
Total Submissions: 20224 | Accepted: 6608 |
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
Source
Central Europe 1998
题目大意:有1点向其他点送请帖,最后还返回1点问最短路
ac代码
#include<stdio.h>
#include<string.h>
#include<string>
#include<queue>
#include<iostream>
#define INF 1<<30
using namespace std;
int v[1000005],head[1000005];
int a[1000005],b[1000005],c[1000005];
__int64 dis[1000005];
struct s
{
int to,w,next;
}node[2000005];
int n,m,cot;
void add(int u,int v,int c)
{
//node[cot].st=u;
node[cot].to=v;
node[cot].w=c;
node[cot].next=head[u];
head[u]=cot++;
}
void spfa(int u)
{
int i;
queue<int>q;
for(i=0;i<n+1;i++)
{
v[i]=0;
dis[i]=INF;
}
v[u]=1;
dis[u]=0;
q.push(u);
while(!q.empty())
{
int cur=q.front();
q.pop();
v[cur]=0;
for(i=head[cur];i!=-1;i=node[i].next)
{
int to;
to=node[i].to;
if(dis[to]>dis[cur]+node[i].w)
{
dis[to]=dis[cur]+node[i].w;
if(!v[to])
{
v[to]=1;
q.push(to);
}
}
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i;
__int64 sum=0;
scanf("%d%d",&n,&m);
cot=0;
memset(head,-1,sizeof(head));
for(i=0;i<m;i++)
{
//int a,b,c;
scanf("%d%d%d",&a[i],&b[i],&c[i]);
add(a[i],b[i],c[i]);
}
spfa(1);
for(i=1;i<=n;i++)
{
sum+=dis[i];
}
memset(head,-1,sizeof(head));
cot=0;
for(i=0;i<m;i++)//反向建图,用spfa求有i点返回1点最短路
{
add(b[i],a[i],c[i]);
}
spfa(1);
for(i=1;i<=n;i++)
{
sum+=dis[i];
}
printf("%I64d\n",sum);
}
}
相关文章推荐
- POJ 1511 Invitation Cards (最短路)
- POJ_1511_Invitation Cards(最短路)
- POJ1511 SPFA模版 用边存的最短路
- 【POJ1062】昂贵的聘礼 最短路 题目描述还有数据都坑爹
- poj 1511 Invitation Cards 最短路SPFA(模板题)
- poj 1511 Invitation Cards(spfa最短路)
- POJ_1511_Invitation Cards【双向最短路】
- POJ-1511 Invitation Cards( 最短路,spfa )
- POJ 题目2240 Arbitrage(最短路变形)
- POJ1511 Invitation Cards 【最短路】
- POJ-1511 Invitation Cards(最短路)
- POJ 1511 Invitation Cards(最短路spfa算法)
- POJ 1511 Invitation Cards 求来回最短路(spfa)
- 最短路 Invitation Cards POJ - 1511
- POJ 1511——Invitation Cards(最短路)
- POJ-1511 Invitation Cards 最短路
- Invitation Cards POJ - 1511 最短路spfa
- POJ 1511 Invitation Cards-2016.12月计科院赛(最短路)
- (POJ 1511)Invitation Cards 有向图来回最短路 + SPFA (复习必看题)
- POJ 题目2253 Frogger(最短路变形)