Submission #65048

# Submission time Handle Problem Language Result Execution time Memory
65048 2018-08-06T13:46:57 Z bazsi700 007 (CEOI14_007) C++14
24 / 100
509 ms 17532 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 mxdistd = -1;
            int mxdists = -1;
            for(int i = 1; i <= n; i++) {
                if(dista[i] == distb[i]) {
                    if(dista[i]+distd[i] == distd[a]) {
                        mxdistd = max(mxdistd,dista[i]);
                    }
                    if(dista[i]+dists[i] == dists[a]) {
                        mxdists = max(mxdists,dista[i]);
                    }
                }
            }
            if(mxdists+1 < mxdistd) {
                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 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 392 KB Output is correct
4 Incorrect 3 ms 468 KB Output isn't correct
5 Incorrect 3 ms 468 KB Output isn't correct
6 Partially correct 3 ms 468 KB Partially correct
7 Partially correct 4 ms 580 KB Partially correct
8 Incorrect 3 ms 580 KB Output isn't correct
9 Partially correct 3 ms 592 KB Partially correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Partially correct 3 ms 596 KB Partially correct
14 Correct 3 ms 596 KB Output is correct
15 Partially correct 2 ms 596 KB Partially correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Partially correct 3 ms 596 KB Partially correct
20 Partially correct 3 ms 596 KB Partially correct
21 Correct 3 ms 596 KB Output is correct
22 Partially correct 3 ms 596 KB Partially correct
23 Partially correct 3 ms 612 KB Partially correct
24 Incorrect 4 ms 612 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Partially correct 30 ms 3428 KB Partially correct
2 Correct 64 ms 4892 KB Output is correct
3 Partially correct 44 ms 4892 KB Partially correct
4 Correct 74 ms 4976 KB Output is correct
5 Correct 40 ms 4976 KB Output is correct
6 Correct 46 ms 4976 KB Output is correct
7 Partially correct 36 ms 4976 KB Partially correct
8 Partially correct 74 ms 4976 KB Partially correct
9 Correct 59 ms 4976 KB Output is correct
10 Partially correct 198 ms 9236 KB Partially correct
11 Correct 128 ms 9236 KB Output is correct
12 Partially correct 164 ms 9236 KB Partially correct
13 Correct 123 ms 9236 KB Output is correct
14 Correct 92 ms 9236 KB Output is correct
15 Partially correct 169 ms 9236 KB Partially correct
16 Correct 175 ms 9288 KB Output is correct
17 Partially correct 137 ms 9288 KB Partially correct
18 Correct 89 ms 9288 KB Output is correct
19 Partially correct 150 ms 9584 KB Partially correct
20 Correct 360 ms 12576 KB Output is correct
21 Correct 171 ms 12576 KB Output is correct
22 Partially correct 190 ms 12576 KB Partially correct
23 Correct 216 ms 12576 KB Output is correct
24 Partially correct 146 ms 12576 KB Partially correct
25 Correct 200 ms 12576 KB Output is correct
26 Correct 203 ms 12576 KB Output is correct
27 Partially correct 248 ms 12576 KB Partially correct
28 Partially correct 190 ms 12576 KB Partially correct
29 Partially correct 227 ms 12576 KB Partially correct
30 Correct 323 ms 13692 KB Output is correct
31 Correct 168 ms 13768 KB Output is correct
32 Partially correct 187 ms 13768 KB Partially correct
33 Correct 215 ms 13768 KB Output is correct
34 Correct 185 ms 13768 KB Output is correct
35 Correct 218 ms 13768 KB Output is correct
36 Correct 257 ms 13768 KB Output is correct
37 Correct 343 ms 14460 KB Output is correct
38 Partially correct 182 ms 14460 KB Partially correct
39 Partially correct 295 ms 14460 KB Partially correct
40 Correct 394 ms 15472 KB Output is correct
41 Partially correct 509 ms 17532 KB Partially correct