# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58236 | evpipis | 007 (CEOI14_007) | C++14 | 1064 ms | 50036 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
const int len = 2e5+5;
int dis[len], tim[len];
int n, m, s1, s2, t1, t2;
queue<int> myq;
vector<int> adj[len];
bool check(int x){
for (int i = 1; i <= n; i++)
dis[i] = -1;
if (0 < tim[s2]+x)
dis[s2] = 0, myq.push(s2);
while (!myq.empty()){
int u = myq.front();
myq.pop();
for (int j = 0; j < adj[u].size(); j++){
int v = adj[u][j];
if (dis[v] == -1 && dis[u]+1 != tim[v]+x)
dis[v] = dis[u]+1, myq.push(v);
}
}
return (dis[t1] == -1 && dis[t2] == -1);
}
int bs(){
int l = 0, r = n, ans = -1;
while (l <= r){
int mid = (l+r)/2;
if (check(mid))
l = mid+1, ans = mid;
else
r = mid-1;
}
return ans;
}
int main(){
scanf("%d %d %d %d %d %d", &n, &m, &s1, &s2, &t1, &t2);
for (int i = 0; i < m; i++){
int a, b;
scanf("%d %d", &a, &b);
adj[a].pb(b);
adj[b].pb(a);
}
for (int i = 1; i <= n; i++)
tim[i] = -1;
tim[s1] = 0, myq.push(s1);
while (!myq.empty()){
int u = myq.front();
myq.pop();
for (int j = 0; j < adj[u].size(); j++){
int v = adj[u][j];
if (tim[v] == -1)
tim[v] = tim[u]+1, myq.push(v);
}
}
printf("%d\n", bs());
return 0;
}
/*
9 10
9 8 1 2
1 2
2 3
3 1
2 4
4 5
5 2
5 7
7 6
7 8
7 9
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |