Codeforces 666B World Tour 暴力最短路

B. World Tour

time limit per test

5 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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.

Input

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 uito the city vi. Note that ui and vi are not required to be distinct. Moreover, it can be several one-way roads between the same pair of cities.

Output

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.

Example

input

8 9
1 2
2 3
3 4
4 1
4 5
5 6
6 7
7 8
8 5

output

2 1 8 7

Note

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.

给出一个不一定连通的有向图，每条边的长度都为1.若选择四个不同的城市a,b,c,d，走a->b->c->d,路程中可以走重复的路，每两个城市之间走最短路，问怎么选择使得总路程最长。

首先bfs，O(n^2)预处理出所有点对间的最短路，顺便预处理出一个城市向前和向后的前三个最长距离。之后枚举中间两个城市b,c，总的最大距离就是b到前面的最长路、bc间最短路、c到后面的最长路的和。由于城市可能重复，所以预处理时需要求出向前向后各三个最长距离。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=3005,maxk=5005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
int head[maxn],d[maxn][maxn];
int num;

struct Edge {
	int from,to,pre;
};
Edge edge[maxk*2];

struct node{
	int d,to;
};
node pre[maxn][4],nxt[maxn][4];

void addedge(int from,int to) {
	edge[num]=(Edge){from,to,head[from]};
	head[from]=num++;
}

void bfs(int s) {
	d[s][s]=0;
	queue<int> q;
	q.push(s);
	while (!q.empty()) {
		int now=q.front();
		q.pop();
		if (d[s][now]>pre[now][1].d) {
			pre[now][3]=pre[now][2];pre[now][2]=pre[now][1];
			pre[now][1]=(node){d[s][now],s};
		} else if (d[s][now]>pre[now][2].d) {
			pre[now][3]=pre[now][2];
			pre[now][2]=(node){d[s][now],s};
		} else if (d[s][now]>pre[now][3].d) 
			pre[now][3]=(node){d[s][now],s};
		for (int i=head[now];i!=-1;i=edge[i].pre) {
			int to=edge[i].to;
			if (d[s][to]==inf) {
				d[s][to]=d[s][now]+1;
				nxt[s][3]=nxt[s][2];
				nxt[s][2]=nxt[s][1];
				nxt[s][1]=(node){d[s][to],to};
				q.push(to);
			}
		}
	}
} 

int main() {
	int n,m,i,j,k,l,x,y;
	meminf(d);mem0(nxt);mem0(pre);
	memset(head,-1,sizeof(head));
	num=0;
	scanf("%d%d",&n,&m);
	for (i=1;i<=m;i++) {
		scanf("%d%d",&x,&y);
		addedge(x,y);
	}
	for (i=1;i<=n;i++) 
		bfs(i);
	int ans=0,a,b,c,e;
	for (i=1;i<=n;i++) {
		for (j=1;j<=n;j++) {
			if (i==j) continue;
			if (d[i][j]==inf) continue;
			for (k=1;k<=3;k++) {
				if (pre[i][k].to==0||pre[i][k].to==j) continue;
				for (l=1;l<=3;l++) {
					if (nxt[j][l].to==0||nxt[j][l].to==i||nxt[j][l].to==pre[i][k].to) continue;
					int sum=pre[i][k].d+d[i][j]+nxt[j][l].d;
					if (sum>ans) {
						ans=sum;
						a=pre[i][k].to;b=i;c=j;e=nxt[j][l].to;
					}
				}
			}
		}
	}
	printf("%d %d %d %d\n",a,b,c,e);
	return 0;
}