题目如下：

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 Output
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

Input	Output
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

思路：

题目想要的是：

1点到各个点的最短路之和

再加上

各个点到1点的最短路之和

所有我们可以建反图 + 跑两边SPFA就可以解决了！

AC代码如下：（ps:关闭输入输出流也可能会T，建议直接C输入输出写法）

#include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
#define ll long long
#define buff                     \ios::sync_with_stdio(false); \cin.tie(0);                  \cout.tie(0)
#define endl "\n"
using namespace std;
const int N = 1000000 + 9;
int n, m;
int h[N], ne[N], e[N], idx;
int h2[N], ne2[N], e2[N], idx2;
ll w[N], w2[N];
int dist[N], dist2[N];
bool st[N];
void add(int a, int b, int c)
{e[idx] = b;w[idx] = c;ne[idx] = h[a];h[a] = idx++;
}
void add2(int a, int b, int c)
{e2[idx2] = b;w2[idx2] = c;ne2[idx2] = h2[a];h2[a] = idx2++;
}
void spfa()
{for (int i = 1; i <= n; i++){dist[i] = 0x3f3f3f3f;st[i] = 0;}queue<int> q;q.push(1);dist[1] = 0;st[1] = 1;while (!q.empty()){int t = q.front();q.pop();st[t] = 0;for (int i = h[t]; i != -1; i = ne[i]){int j = e[i];if (dist[j] > dist[t] + w[i]){dist[j] = dist[t] + w[i];if (!st[j]){st[j] = 1;q.push(j);}}}}
}
void spfa2()
{for (int i = 1; i <= n; i++){st[i] = 0;dist2[i] = 0x3f3f3f3f;}queue<int> q;q.push(1);dist2[1] = 0;st[1] = 1;while (!q.empty()){int t = q.front();q.pop();st[t] = 0;for (int i = h2[t]; i != -1; i = ne2[i]){int j = e2[i];if (dist2[j] > dist2[t] + w2[i]){dist2[j] = dist2[t] + w2[i];if (!st[j]){st[j] = 1;q.push(j);}}}}
}
void init()
{idx = 0;idx2 = 0;memset(h, -1, sizeof h);memset(h2, -1, sizeof h2);
}
void solve()
{cin >> n >> m;init();for (int i = 1; i <= m; i++){int a, b;ll c;//cin >> a >> b >> c;scanf("%d %d %lld",&a,&b,&c);add(a, b, c);add2(b, a, c);}spfa();spfa2();ll ans = 0;for (int i = 1; i <= n; i++){ans += dist[i] + dist2[i];}printf("%lld\n",ans);
}
signed main()
{//buff;int t;cin >> t;while (t--)solve();
}

Invitation Cards(建反图 + 跑两遍SPFA)相关推荐

Magic Potion(最大流，跑两遍网络流或者加一个中转点)
Magic Potion http://codeforces.com/gym/101981/attachments/download/7891/20182019-acmicpc-asia-nanjin ...
Luogu P1073 最优贸易【最短路/建反图】 By cellur925
题目传送门这么经典的题目,还是看了lyd的题解....唉难过. 一句话题意:在一张点有全都的图上找一条从1到n的路径,存在两个点p,q(p<q),使val[q]-val[p]最大. 给出的图是 ...
Codeforces Round #588 (Div. 2) F. Konrad and Company Evaluation 图论 + 建反图好题
传送门文章目录题意: 思路: 题意: 给你一张nnn个点mmm条边的图,其中每个点iii初始编号为iii,边是有向的,方向为从编号大的指向编号小的.定义一个贡献为存在某三个点a,b,ca,b,ca ...
洛谷：P3243 [HNOI2015]菜肴制作（拓扑序列、建反图、贪心）
美食家老嗨题意: 很容易读偏,以为是求满足限制下的最小字典序. 要求是在满足所有限制后,优先做 1,此外优先做 2 - -- 摘自xyz32768 C o d e : Code: Code: #in ...
POJ 1511 Invitation Cards——Dijkstra优先队列优化+反向建图
[题目描述] In the age of television, not many people attend theater performances. Antique Comedians of M ...
Invitation Cards POJ - 1511 SPFA（dijkstra+反向建图+邻接表（下标过大）+输入输出用stdio(iostream超时)）
题目大意: 有编号1-P的站点, 有Q条公交车路线,公交车路线只从一个起点站直接到达终点站,是单向的,每条路线有它自己的车费.有P个人早上从1出发 ,他们要到达每一个公交站点, 然后到了晚上再返回点 ...
【POJ - 1511】 Invitation Cards（Dijkstra + 反向建图多源到单源最短路的处理）
题干: In the age of television, not many people attend theater performances. Antique Comedians of Mali ...
2152 Balloons(两遍bfs求图的连通块)
2152 Balloons(两遍bfs求图的连通块) Problem Description Both Saya and Kudo like balloons. One day, they heard ...
lisp遍历表中所有顶点_三十张图片让你彻底弄明白图的两种遍历方式：DFS和BFS...
1 引言遍历是指从某个节点出发,按照一定的的搜索路线,依次访问对数据结构中的全部节点,且每个节点仅访问一次. 在二叉树基础中,介绍了对于树的遍历.树的遍历是指从根节点出发,按照一定的访问规则 ...

Invitation Cards(建反图 + 跑两遍SPFA)

题目如下：

思路：

AC代码如下：（ps:关闭输入输出流也可能会T，建议直接C输入输出写法）

Invitation Cards(建反图 + 跑两遍SPFA)相关推荐

最新文章

热门文章