Submission #65039

# Submission time Handle Problem Language Result Execution time Memory
65039 2018-08-06T13:31:34 Z bazsi700 007 (CEOI14_007) C++14
30 / 100
459 ms 15980 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);
    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;
            }
        }
    }
    if(dists[a] == dists[b] && distd[a] == distd[b]) {
        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);
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Partially correct 2 ms 460 KB Partially correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Partially correct 2 ms 472 KB Partially correct
7 Partially correct 2 ms 472 KB Partially correct
8 Correct 3 ms 520 KB Output is correct
9 Partially correct 3 ms 596 KB Partially correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 704 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Partially correct 2 ms 704 KB Partially correct
14 Correct 2 ms 704 KB Output is correct
15 Partially correct 2 ms 704 KB Partially correct
16 Correct 3 ms 704 KB Output is correct
17 Correct 2 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Partially correct 2 ms 704 KB Partially correct
20 Partially correct 2 ms 704 KB Partially correct
21 Correct 2 ms 704 KB Output is correct
22 Partially correct 3 ms 704 KB Partially correct
23 Partially correct 3 ms 704 KB Partially correct
24 Correct 3 ms 704 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 27 ms 3156 KB Partially correct
2 Correct 63 ms 4316 KB Output is correct
3 Partially correct 39 ms 4316 KB Partially correct
4 Correct 44 ms 4444 KB Output is correct
5 Correct 52 ms 4444 KB Output is correct
6 Correct 29 ms 4444 KB Output is correct
7 Partially correct 43 ms 4444 KB Partially correct
8 Partially correct 63 ms 4444 KB Partially correct
9 Correct 66 ms 4444 KB Output is correct
10 Partially correct 262 ms 8748 KB Partially correct
11 Correct 86 ms 8748 KB Output is correct
12 Partially correct 122 ms 8748 KB Partially correct
13 Correct 98 ms 8748 KB Output is correct
14 Correct 80 ms 8748 KB Output is correct
15 Partially correct 113 ms 8748 KB Partially correct
16 Correct 101 ms 8748 KB Output is correct
17 Partially correct 78 ms 8748 KB Partially correct
18 Correct 141 ms 8748 KB Output is correct
19 Partially correct 147 ms 8748 KB Partially correct
20 Correct 258 ms 11692 KB Output is correct
21 Correct 167 ms 11692 KB Output is correct
22 Partially correct 153 ms 11692 KB Partially correct
23 Correct 123 ms 11692 KB Output is correct
24 Partially correct 122 ms 11692 KB Partially correct
25 Correct 121 ms 11692 KB Output is correct
26 Correct 109 ms 11692 KB Output is correct
27 Partially correct 160 ms 11692 KB Partially correct
28 Partially correct 151 ms 11692 KB Partially correct
29 Partially correct 195 ms 11692 KB Partially correct
30 Correct 295 ms 12716 KB Output is correct
31 Correct 242 ms 12716 KB Output is correct
32 Partially correct 158 ms 12716 KB Partially correct
33 Correct 150 ms 12716 KB Output is correct
34 Correct 193 ms 12716 KB Output is correct
35 Correct 183 ms 12716 KB Output is correct
36 Correct 170 ms 12716 KB Output is correct
37 Correct 249 ms 12908 KB Output is correct
38 Partially correct 215 ms 12908 KB Partially correct
39 Partially correct 206 ms 12908 KB Partially correct
40 Correct 343 ms 14060 KB Output is correct
41 Partially correct 459 ms 15980 KB Partially correct