Travel The country frog lives in has n towns which are conveniently numbered by 1,2,…,n . Among n(n−1)2 pairs of towns, m of them are connected by bidirectional highway, which needs a minutes to travel. The other pairs are connected by railway, which…

Travel The country frog lives in has n towns which are conveniently numbered by 1,2,…,n . Among n(n−1)2 pairs of towns, m of them are connected by bidirectional highway, which needs a minutes to travel. The other pairs are connected by railway, which…

Travel The country frog lives in has \(n\) towns which are conveniently numbered by \(1, 2, \dots, n\). Among \(\frac{n(n - 1)}{2}\) pairs of towns, \(m\) of them are connected by bidirectional highway, which needs \(a\) minutes to travel. The other…

题意: 一个完全图,有n个点,其中m条边是权值为a的无向边,其它是权值为b的无向边,问从1到n的最短路. 思路: 首先判断1和n被哪种边连通. 如果是被a连通,那么就需要全部走b的边到达n,选择最小的: 被b连通,需要走全部为a的边到达n,选择最小的. 第二种情况,用输入的边跑dijkstra: 但是第一种情况边太多,所以并不能单纯的用最短路. 可以想到的是,对于第二种情况,一个点只会经过一次. 所以用一个set来存还未访问过的点,进行bfs. 每次从队列中取出一个点x,把set中与x以a边相连…

给你一个一共由两种边的完全图 要求你求1到N的最短路 q队列为前沿队列(已探索过且最外围的点)  p队列为未探索队列(未探索过的点) depth这个数组的用法并不是代表实际上这个点在第几层 而是防止死循环 保证每次通过前沿的一个点都只会遍历p中每个点一次 #include <bits/stdc++.h> using namespace std; typedef long long ll; ; ; ; int n,m,a,b,nm,qwq; int head[maxn]; ll dis[maxn…

POJ 1511 Invitation Cards / UVA 721 Invitation Cards / SPOJ Invitation / UVAlive Invitation Cards / SCU 1132 Invitation Cards / ZOJ 2008 Invitation Cards / HDU 1535 (图论,最短路径) Description In the age of television, not many people attend theater perfor…

Travel The country frog lives in has nn towns which are conveniently numbered by 1,2,…,n. Among n(n−1) / 2 pairs of towns, m of them are connected by bidirectional highway, which needs aa minutes to travel. The other pairs are connected by railway, w…

SCU 4437  Carries Time Limit:0MS     Memory Limit:0KB     64bit IO Format:%lld & %llu  Practice  Description Carries frog has nn integers a1,a2,…,ana1,a2,…,an, and she wants to add them pairwise. Unfortunately, frog is somehow afraid of carries (进位).…

 SCU 4438 Censor Time Limit:0MS     Memory Limit:0KB     64bit IO Format:%lld & %llu  Practice Description Censor frog is now a editor to censor so-called sensitive words (敏感词). She has a long text pp. Her job is relatively simple -- just to find the…

 SCU 4440 Rectangle Time Limit:0MS     Memory Limit:0KB     64bit IO Format:%lld & %llu  Practice Description Rectangle frog has a piece of paper divided into nn rows and mm columns. Today, she would like to draw a rectangle whose perimeter is not gr…