Codeforces Round #349 (Div. 2) D. World Tour 暴力最短路
A famous sculptor Cicasso goes to a world tour!
Well, it is not actually a world-wide. But not everyone should have the opportunity to see works of sculptor, shouldn't he? Otherwise there will be no any exclusivity. So Cicasso will entirely hold the world tour in his native country — Berland.
Cicasso is very devoted to his work and he wants to be distracted as little as possible. Therefore he will visit only four cities. These cities will be different, so no one could think that he has "favourites". Of course, to save money, he will chose the shortest paths between these cities. But as you have probably guessed, Cicasso is a weird person. Although he doesn't like to organize exhibitions, he likes to travel around the country and enjoy its scenery. So he wants the total distance which he will travel to be as large as possible. However, the sculptor is bad in planning, so he asks you for help.
There are n cities and m one-way roads in Berland. You have to choose four different cities, which Cicasso will visit and also determine the order in which he will visit them. So that the total distance he will travel, if he visits cities in your order, starting from the first city in your list, and ending in the last, choosing each time the shortest route between a pair of cities — will be the largest.
Note that intermediate routes may pass through the cities, which are assigned to the tour, as well as pass twice through the same city. For example, the tour can look like that: . Four cities in the order of visiting marked as overlines:[1, 5, 2, 4].
Note that Berland is a high-tech country. So using nanotechnologies all roads were altered so that they have the same length. For the same reason moving using regular cars is not very popular in the country, and it can happen that there are such pairs of cities, one of which generally can not be reached by car from the other one. However, Cicasso is very conservative and cannot travel without the car. Choose cities so that the sculptor can make the tour using only the automobile. It is guaranteed that it is always possible to do.
In the first line there is a pair of integers n and m (4 ≤ n ≤ 3000, 3 ≤ m ≤ 5000) — a number of cities and one-way roads in Berland.
Each of the next m lines contains a pair of integers ui, vi (1 ≤ ui, vi ≤ n) — a one-way road from the city ui to the city vi. Note that uiand vi are not required to be distinct. Moreover, it can be several one-way roads between the same pair of cities.
Print four integers — numbers of cities which Cicasso will visit according to optimal choice of the route. Numbers of cities should be printed in the order that Cicasso will visit them. If there are multiple solutions, print any of them.
8 9
1 2
2 3
3 4
4 1
4 5
5 6
6 7
7 8
8 5
2 1 8 7
Let d(x, y) be the shortest distance between cities x and y. Then in the example d(2, 1) = 3, d(1, 8) = 7, d(8, 7) = 3. The total distance equals 13.
题意:
给你一个有向图,有环,让你找出四个不同点,使得d[a,b]+d[b,c]+d[c,d]之值最大
题解:
#include<bits/stdc++.h>
using namespace std;
const int N = 3e3+, M = 1e6+, mod = 1e9+, inf = 1e9+;
typedef long long ll; int dist[N][N], vis[N], a , b ,n , m ,a1,a2,a3,a4;
vector<int > G[N];
vector<pair<int,int > > fd[N],d[N];
void add(int x,int y) {G[x].push_back(y);}
int main() {
scanf("%d%d",&n,&m);
for(int i=;i<=m;i++) scanf("%d%d",&a,&b), add(a,b);
for(int i=;i<=n;i++) {
for(int j=;j<=n;j++) dist[i][j] = inf, vis[j] = ;
queue<int >q;
q.push(i);
vis[i] = ;
dist[i][i] = ;
while(!q.empty()) {
int k = q.front();
q.pop();
vis[k] = ;
for(int j=;j<G[k].size();j++) {
int to = G[k][j];
if(dist[i][to]>dist[i][k] + ) {
dist[i][to] = dist[i][k] + ;
if(!vis[to]) {
q.push(to);
vis[to] = ;
}
}
}
}
for(int j=;j<=n;j++) {
if(dist[i][j]>=inf) continue;
d[i].push_back(make_pair(dist[i][j],j));
fd[j].push_back(make_pair(dist[i][j],i));
}
sort(d[i].begin(),d[i].end());
} for(int i=;i<=n;i++) sort(fd[i].begin(),fd[i].end());
int sum = ,ans1,ans2,ans3,ans4;
for(int i=;i<=n;i++) {
for(int j=;j<=n;j++) {
if(i == j) continue;
ans2 = i;
ans3 = j;
int tmp = dist[ans2][ans3];//cout<<1<<endl;
if(tmp>=inf) continue;
int siz = d[ans3].size();
if(siz==) continue;
if(d[ans3][siz-].second == ans2||d[ans3][siz-].second==ans3) {
if(siz==) continue;
ans4 = d[ans3][siz-].second;
tmp += d[ans3][siz-].first;
}
else {
ans4 = d[ans3][siz-].second;
tmp += d[ans3][siz-].first;
}
int f = ;
siz = fd[ans2].size();
for(int k=siz-;k>=;k--) {
int now = fd[ans2][k].second;
int value = fd[ans2][k].first;
if(ans4!=now&&ans2!=now&&ans3!=now) {
ans1 = now;
tmp += value;f = ;
break;
}
} if(tmp>sum&&f) {
a1 = ans1;
a2 = ans2;
a3 = ans3;
a4 = ans4;
sum = tmp;
}
}
}
// cout<<dist[2][1]<<" "<<dist[1][8]<<" "<<dist[8][7]<<endl;
// cout<<dist[a1][a2]<<" "<<dist[a2][a3]<<" "<<dist[a3][a4]<<endl;
// cout<<sum<<endl;
cout<<a1<<" "<<a2<<" "<<a3<<" "<<a4<<endl;
return ;
}
Codeforces Round #349 (Div. 2) D. World Tour 暴力最短路的更多相关文章
- Codeforces Round #349 (Div. 1) B. World Tour 暴力最短路
B. World Tour 题目连接: http://www.codeforces.com/contest/666/problem/B Description A famous sculptor Ci ...
- Codeforces Round #349 (Div. 1) B. World Tour 最短路+暴力枚举
题目链接: http://www.codeforces.com/contest/666/problem/B 题意: 给你n个城市,m条单向边,求通过最短路径访问四个不同的点能获得的最大距离,答案输出一 ...
- Codeforces Round #349 (Div. 2) D. World Tour (最短路)
题目链接:http://codeforces.com/contest/667/problem/D 给你一个有向图,dis[i][j]表示i到j的最短路,让你求dis[u][i] + dis[i][j] ...
- Codeforces Round #349 (Div. 1) A. Reberland Linguistics 动态规划
A. Reberland Linguistics 题目连接: http://www.codeforces.com/contest/666/problem/A Description First-rat ...
- Codeforces Round #349 (Div. 1) A. Reberland Linguistics dp
题目链接: 题目 A. Reberland Linguistics time limit per test:1 second memory limit per test:256 megabytes 问 ...
- Codeforces Round #349 (Div. 2) C. Reberland Linguistics (DP)
C. Reberland Linguistics time limit per test 1 second memory limit per test 256 megabytes input stan ...
- Codeforces Round #349 (Div. 1)E. Forensic Examination
题意:给一个初始串s,和m个模式串,q次查询每次问你第l到第r个模式串中包含\(s_l-s_r\)子串的最大数量是多少 题解:把初始串和模式串用分隔符间隔然后建sam,我们需要找到在sam中表示\(s ...
- Codeforces Round #349 (Div. 2)
第一题直接算就行了为了追求手速忘了输出yes导致wa了一发... 第二题技巧题,直接sort,然后把最大的和其他的相减就是构成一条直线,为了满足条件就+1 #include<map> #i ...
- Codeforces Round #349 (Div. 2) C. Reberland Linguistics DP+set
C. Reberland Linguistics First-rate specialists graduate from Berland State Institute of Peace a ...
随机推荐
- struts2标签(五)
标签体系结构 jsp出现目的是为了取代servlet,结果逻辑代码,数据库代码都放到了jsp页面中. 为了解决jsp中代码过多的问题,struts2标签分为普通标签和UI标签. 使用struts2标签 ...
- CSS3之 transform和animation区别
CSS3 有3种和动画相关的属性:transform, transition, animation.其中 transform 描述了元素静态样式.而transition 和 animation 却都能 ...
- Android学习——动态注册监听网络变化
新建一个BroadcastTest项目,然后修改MainActivity中的代码,如下: public class MainActivity extends AppCompatActivity { p ...
- 使用CImage类 显示图片
在不适用openCv的一种时候,使用CImage显示图片数据,并且直接嵌入DC框中. 使用CImage 在pic控件里显示图片 void CMyCalLawsDlg::MyShowImage( CIm ...
- php xss 函数
function xss($string) { if (is_array($string)||is_object($string)||is_resource($string)) { return '' ...
- (转)基于Metronic的Bootstrap开发框架经验总结(7)--数据的导入、导出及附件的查看处理
http://www.cnblogs.com/wuhuacong/p/4777720.html 在很多系统模块里面,我们可能都需要进行一定的数据交换处理,也就是数据的导入或者导出操作,这样的批量处理能 ...
- vue-router同路由地址切换无效解决
本来还想写的,一搜就有现成的,算了: http://blog.csdn.net/peng_guan/article/details/59702699
- vue中需要注意的问题总结(上)
React 与其说是一种框架,倒不如说是一种开发范式.它的核心理念非常简单: 界面/视图就是数据结构的可视化表达UI = f(data) 而界面/视图由组件组合而来UI = f1(data) + f2 ...
- TensorFlow实战笔记(17)---TFlearn
目录: 分布式Estimator 自定义模型 建立自己的机器学习Estimator 调节RunConfig运行时的参数 Experiment和LearnRunner 深度学习Estimator 深度神 ...
- eas之常用源码整理
//查看是否有相关权限 boolean hasAllotPermission= PermissionFactory.getRemoteInstance().hasFunctionPer ...