poj---1511
2016-07-24 16:25
453 查看
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
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define N 1000010
#define Max 0x3f3f3f3f
int n, m;
int headlist[2]
, vis
;
long long d
, ans;
struct node
{
int e, next, w;
}edge[2]
;
void spfa(int cap)
{
int v, i, b;
queue<int>q;
for(i=1;i<=n;i++)
{
d[i]=Max;
vis[i]=0;
}
q.push(1);
vis[1]=1;
d[1]=0;
while(!q.empty())
{
v=q.front();
q.pop();
vis[v]=0;
for(i=headlist[cap][v];i!=-1;i=edge[cap][i].next)
{
b=edge[cap][i].e;
if(d[b]>d[v]+edge[cap][i].w)
{
d[b]=d[v]+edge[cap][i].w;
if(!vis[b])
{
vis[b]=1;
q.push(b);
}
}
}
}
}
int main()
{
int i, a, b, T, w;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
headlist[0][i]=-1;
headlist[1][i]=-1;
}
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&w);
edge[0][i].w=w;
edge[0][i].e=b;
edge[0][i].next=headlist[0][a];
headlist[0][a]=i;
edge[1][i].w=w;
edge[1][i].e=a;
edge[1][i].next=headlist[1][b];
headlist[1][b]=i;
}
ans=0;
spfa(0);
for(i=1;i<=n;i++)
ans+=d[i];
spfa(1);
for(i=1;i<=n;i++)
ans+=d[i];
printf("%I64d\n", ans);
}
return 0;
}
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
46210
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define N 1000010
#define Max 0x3f3f3f3f
int n, m;
int headlist[2]
, vis
;
long long d
, ans;
struct node
{
int e, next, w;
}edge[2]
;
void spfa(int cap)
{
int v, i, b;
queue<int>q;
for(i=1;i<=n;i++)
{
d[i]=Max;
vis[i]=0;
}
q.push(1);
vis[1]=1;
d[1]=0;
while(!q.empty())
{
v=q.front();
q.pop();
vis[v]=0;
for(i=headlist[cap][v];i!=-1;i=edge[cap][i].next)
{
b=edge[cap][i].e;
if(d[b]>d[v]+edge[cap][i].w)
{
d[b]=d[v]+edge[cap][i].w;
if(!vis[b])
{
vis[b]=1;
q.push(b);
}
}
}
}
}
int main()
{
int i, a, b, T, w;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
headlist[0][i]=-1;
headlist[1][i]=-1;
}
for(i=0;i<m;i++)
{
scanf("%d%d%d",&a,&b,&w);
edge[0][i].w=w;
edge[0][i].e=b;
edge[0][i].next=headlist[0][a];
headlist[0][a]=i;
edge[1][i].w=w;
edge[1][i].e=a;
edge[1][i].next=headlist[1][b];
headlist[1][b]=i;
}
ans=0;
spfa(0);
for(i=1;i<=n;i++)
ans+=d[i];
spfa(1);
for(i=1;i<=n;i++)
ans+=d[i];
printf("%I64d\n", ans);
}
return 0;
}
相关文章推荐
- 关于Cocos2d-x项目运行的过程和场景切换步骤
- Java对象的强、软、弱和虚引用原理+结合ReferenceQueue对象构造Java对象的高速缓存器
- HDOJ 5750 Dertouzos
- Android广播receiver
- List View(列表视图)
- Centos6.5搭建java、eclipse开发环境
- Bringing up interface eth0: Error: No suitable device found: no device found for connection ' Syste
- Android 6.0中添加硬件驱动程序
- Xcode 修改 c++ 模板文件
- Scala 模式匹配 match-case
- POJ 3761 (组合计数)
- Java异常处理-----Throwable类
- Java异常处理-----Throwable类
- Java中String对象的不可变性
- 基于WiFi信号应用的相关文献整理以及相关国内外团队介绍
- 面向对像六大设计原则
- java工程内部相对路径引用文件
- HDU 1509 Windows Message Queue (优先队列)
- mysql 表级修改字符集列级别不一定自动继承表级字符集
- hdoj1321 Reverse Text