| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 65057 |
2018-08-06T13:54:16 Z |
bazsi700 |
007 (CEOI14_007) |
C++14 |
|
439 ms |
17404 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,m,s,d,a,b;
cin >> n >> m >> s >> d >> a >> b;
vector<vector<int> > graph(n+1,vector<int>());
for(int i = 0; i < m; i++) {
int x,y;
cin >> x >> y;
graph[x].push_back(y);
graph[y].push_back(x);
}
vector<bool> wass(n+1,false);
vector<int> dists(n+1,0);
vector<bool> wasd(n+1,false);
vector<int> distd(n+1,0);
vector<bool> wasa(n+1,false);
vector<int> dista(n+1,0);
vector<bool> wasb(n+1,false);
vector<int> distb(n+1,0);
wass[s] = true;
queue<int> q;
q.push(s);
while(!q.empty()) {
int v = q.front();
q.pop();
for(int u : graph[v]) {
if(!wass[u]) {
wass[u] = true;
q.push(u);
dists[u] = dists[v]+1;
}
}
}
wasd[d] = true;
q.push(d);
while(!q.empty()) {
int v = q.front();
q.pop();
for(int u : graph[v]) {
if(!wasd[u]) {
wasd[u] = true;
q.push(u);
distd[u] = distd[v]+1;
}
}
}
wasa[a] = true;
q.push(a);
while(!q.empty()) {
int v = q.front();
q.pop();
for(int u : graph[v]) {
if(!wasa[u]) {
wasa[u] = true;
q.push(u);
dista[u] = dista[v]+1;
}
}
}
wasb[b] = true;
q.push(b);
while(!q.empty()) {
int v = q.front();
q.pop();
for(int u : graph[v]) {
if(!wasb[u]) {
wasb[u] = true;
q.push(u);
distb[u] = distb[v]+1;
}
}
}
if(dists[a] == dists[b] && distd[a] == distd[b]) {
int mxdistda = n;
int mxdistdb = n;
int mxdistsa = n;
int mxdistsb = n;
for(int i = 1; i <= n; i++) {
if(dista[i] == distb[i]) {
if(dista[i]+distd[i] == distd[a]) {
mxdistda = min(mxdistda,dista[i]);
}
if(distb[i]+distd[i] == distd[b]) {
mxdistdb = min(mxdistdb,distb[i]);
}
if(dista[i]+dists[i] == dists[a]) {
mxdistsa = min(mxdistsa,dista[i]);
}
if(distb[i]+dists[i] == dists[b]) {
mxdistsb = min(mxdistsb,distb[i]);
}
}
}
if(mxdistsa >= mxdistda && mxdistsb >= mxdistdb) {
cout << max(min(distd[a]-dists[a],distd[b]-dists[b])-1,-1);
} else {
cout << max(min(distd[a]-dists[a],distd[b]-dists[b]),-1);
}
} else {
cout << max(min(distd[a]-dists[a],distd[b]-dists[b]),-1);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Partially correct |
2 ms |
432 KB |
Partially correct |
| 4 |
Correct |
3 ms |
596 KB |
Output is correct |
| 5 |
Correct |
2 ms |
596 KB |
Output is correct |
| 6 |
Partially correct |
3 ms |
596 KB |
Partially correct |
| 7 |
Partially correct |
3 ms |
596 KB |
Partially correct |
| 8 |
Correct |
2 ms |
596 KB |
Output is correct |
| 9 |
Partially correct |
2 ms |
596 KB |
Partially correct |
| 10 |
Correct |
2 ms |
596 KB |
Output is correct |
| 11 |
Correct |
3 ms |
596 KB |
Output is correct |
| 12 |
Correct |
3 ms |
604 KB |
Output is correct |
| 13 |
Partially correct |
3 ms |
604 KB |
Partially correct |
| 14 |
Correct |
3 ms |
612 KB |
Output is correct |
| 15 |
Correct |
3 ms |
612 KB |
Output is correct |
| 16 |
Correct |
3 ms |
624 KB |
Output is correct |
| 17 |
Correct |
2 ms |
624 KB |
Output is correct |
| 18 |
Correct |
3 ms |
624 KB |
Output is correct |
| 19 |
Partially correct |
3 ms |
624 KB |
Partially correct |
| 20 |
Correct |
3 ms |
624 KB |
Output is correct |
| 21 |
Correct |
3 ms |
624 KB |
Output is correct |
| 22 |
Correct |
3 ms |
624 KB |
Output is correct |
| 23 |
Partially correct |
3 ms |
624 KB |
Partially correct |
| 24 |
Correct |
4 ms |
624 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
3436 KB |
Output is correct |
| 2 |
Correct |
55 ms |
4844 KB |
Output is correct |
| 3 |
Partially correct |
46 ms |
4844 KB |
Partially correct |
| 4 |
Correct |
51 ms |
4972 KB |
Output is correct |
| 5 |
Correct |
38 ms |
4972 KB |
Output is correct |
| 6 |
Correct |
39 ms |
4972 KB |
Output is correct |
| 7 |
Correct |
37 ms |
4972 KB |
Output is correct |
| 8 |
Correct |
39 ms |
4972 KB |
Output is correct |
| 9 |
Correct |
70 ms |
4972 KB |
Output is correct |
| 10 |
Partially correct |
311 ms |
9324 KB |
Partially correct |
| 11 |
Correct |
101 ms |
9324 KB |
Output is correct |
| 12 |
Partially correct |
146 ms |
9324 KB |
Partially correct |
| 13 |
Correct |
115 ms |
9324 KB |
Output is correct |
| 14 |
Correct |
100 ms |
9324 KB |
Output is correct |
| 15 |
Correct |
104 ms |
9324 KB |
Output is correct |
| 16 |
Correct |
109 ms |
9324 KB |
Output is correct |
| 17 |
Correct |
112 ms |
9324 KB |
Output is correct |
| 18 |
Correct |
164 ms |
9324 KB |
Output is correct |
| 19 |
Partially correct |
239 ms |
9604 KB |
Partially correct |
| 20 |
Correct |
293 ms |
12540 KB |
Output is correct |
| 21 |
Correct |
181 ms |
12540 KB |
Output is correct |
| 22 |
Partially correct |
181 ms |
12540 KB |
Partially correct |
| 23 |
Correct |
199 ms |
12540 KB |
Output is correct |
| 24 |
Partially correct |
212 ms |
12540 KB |
Partially correct |
| 25 |
Correct |
174 ms |
12540 KB |
Output is correct |
| 26 |
Correct |
164 ms |
12540 KB |
Output is correct |
| 27 |
Correct |
235 ms |
12540 KB |
Output is correct |
| 28 |
Correct |
187 ms |
12540 KB |
Output is correct |
| 29 |
Partially correct |
295 ms |
12540 KB |
Partially correct |
| 30 |
Correct |
362 ms |
13864 KB |
Output is correct |
| 31 |
Correct |
276 ms |
13864 KB |
Output is correct |
| 32 |
Partially correct |
244 ms |
13864 KB |
Partially correct |
| 33 |
Correct |
214 ms |
13864 KB |
Output is correct |
| 34 |
Correct |
233 ms |
13864 KB |
Output is correct |
| 35 |
Correct |
165 ms |
13864 KB |
Output is correct |
| 36 |
Correct |
211 ms |
13864 KB |
Output is correct |
| 37 |
Correct |
210 ms |
14460 KB |
Output is correct |
| 38 |
Correct |
270 ms |
14460 KB |
Output is correct |
| 39 |
Correct |
262 ms |
14460 KB |
Output is correct |
| 40 |
Correct |
312 ms |
15440 KB |
Output is correct |
| 41 |
Partially correct |
439 ms |
17404 KB |
Partially correct |
