답안 #65046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65046 2018-08-06T13:45:58 Z bazsi700 007 (CEOI14_007) C++14
30 / 100
504 ms 17508 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 < 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;
    }
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 4 ms 544 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Partially correct 3 ms 544 KB Partially correct
7 Partially correct 3 ms 544 KB Partially correct
8 Correct 3 ms 544 KB Output is correct
9 Partially correct 3 ms 548 KB Partially correct
10 Correct 3 ms 548 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Partially correct 5 ms 596 KB Partially correct
14 Correct 3 ms 596 KB Output is correct
15 Partially correct 3 ms 596 KB Partially correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 660 KB Output is correct
19 Partially correct 3 ms 660 KB Partially correct
20 Partially correct 2 ms 660 KB Partially correct
21 Correct 3 ms 660 KB Output is correct
22 Partially correct 2 ms 680 KB Partially correct
23 Partially correct 3 ms 680 KB Partially correct
24 Correct 3 ms 680 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 27 ms 3436 KB Partially correct
2 Correct 52 ms 4844 KB Output is correct
3 Partially correct 50 ms 4844 KB Partially correct
4 Correct 53 ms 4972 KB Output is correct
5 Correct 56 ms 4972 KB Output is correct
6 Correct 38 ms 4972 KB Output is correct
7 Partially correct 56 ms 4972 KB Partially correct
8 Partially correct 53 ms 4972 KB Partially correct
9 Correct 85 ms 4972 KB Output is correct
10 Partially correct 259 ms 9212 KB Partially correct
11 Correct 104 ms 9212 KB Output is correct
12 Partially correct 148 ms 9212 KB Partially correct
13 Correct 118 ms 9212 KB Output is correct
14 Correct 94 ms 9212 KB Output is correct
15 Partially correct 161 ms 9212 KB Partially correct
16 Correct 166 ms 9276 KB Output is correct
17 Partially correct 126 ms 9276 KB Partially correct
18 Correct 126 ms 9276 KB Output is correct
19 Partially correct 223 ms 9596 KB Partially correct
20 Correct 334 ms 12668 KB Output is correct
21 Correct 195 ms 12668 KB Output is correct
22 Partially correct 183 ms 12668 KB Partially correct
23 Correct 204 ms 12668 KB Output is correct
24 Partially correct 200 ms 12668 KB Partially correct
25 Correct 162 ms 12668 KB Output is correct
26 Correct 136 ms 12668 KB Output is correct
27 Partially correct 206 ms 12668 KB Partially correct
28 Partially correct 211 ms 12668 KB Partially correct
29 Partially correct 263 ms 12668 KB Partially correct
30 Correct 410 ms 13820 KB Output is correct
31 Correct 206 ms 13820 KB Output is correct
32 Partially correct 216 ms 13820 KB Partially correct
33 Correct 194 ms 13820 KB Output is correct
34 Correct 257 ms 13820 KB Output is correct
35 Correct 199 ms 13820 KB Output is correct
36 Correct 258 ms 13820 KB Output is correct
37 Correct 243 ms 14460 KB Output is correct
38 Partially correct 261 ms 14460 KB Partially correct
39 Partially correct 310 ms 14460 KB Partially correct
40 Correct 324 ms 15356 KB Output is correct
41 Partially correct 504 ms 17508 KB Partially correct