# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101407 | rocketninja7 | 007 (CEOI14_007) | C++14 | 408 ms | 18152 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 <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int main(){
int N, M, s, d, a, b;
scanf("%d%d%d%d%d%d", &N, &M, &s, &d, &a, &b);
vector<int> adjList[N+1];
for(int i=0;i<M;i++){
int u, v;
scanf("%d%d", &u, &v);
adjList[u].push_back(v);
adjList[v].push_back(u);
}
queue<int> proc;
proc.push(s);
int dists[N+1];
for(int i=1;i<N+1;i++){
dists[i]=-1;
}
dists[s]=0;
while(!proc.empty()){
int node=proc.front();
proc.pop();
for(int i=0;i<adjList[node].size();i++){
if(dists[adjList[node][i]]==-1){
dists[adjList[node][i]]=dists[node]+1;
proc.push(adjList[node][i]);
}
}
}
proc.push(d);
int distd[N+1];
for(int i=1;i<N+1;i++){
distd[i]=-1;
}
distd[d]=0;
while(!proc.empty()){
int node=proc.front();
proc.pop();
for(int i=0;i<adjList[node].size();i++){
if(distd[adjList[node][i]]==-1){
distd[adjList[node][i]]=distd[node]+1;
proc.push(adjList[node][i]);
}
}
}
printf("%d", max(min(distd[a]-dists[a], distd[b]-dists[b]), 0)-1);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |