oj.uz

답안 #65052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65052 2018-08-06T13:51:13 Z bazsi700 007 (CEOI14_007) C++14
0 / 100
 480 ms 17516 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;
}

Subtask #1
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Incorrect 3 ms 436 KB Output isn't correct
5 Incorrect 2 ms 488 KB Output isn't correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Incorrect 2 ms 620 KB Output isn't correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 2 ms 624 KB Output is correct
12 Incorrect 2 ms 624 KB Output isn't correct
13 Correct 3 ms 624 KB Output is correct
14 Incorrect 3 ms 624 KB Output isn't correct
15 Correct 3 ms 624 KB Output is correct
16 Incorrect 3 ms 624 KB Output isn't correct
17 Incorrect 3 ms 624 KB Output isn't correct
18 Incorrect 3 ms 624 KB Output isn't correct
19 Correct 3 ms 624 KB Output is correct
20 Correct 3 ms 624 KB Output is correct
21 Correct 4 ms 624 KB Output is correct
22 Correct 3 ms 624 KB Output is correct
23 Correct 3 ms 624 KB Output is correct
24 Incorrect 3 ms 688 KB Output isn't correct

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3436 KB Output is correct
2 Incorrect 58 ms 4844 KB Output isn't correct
3 Correct 88 ms 4844 KB Output is correct
4 Incorrect 54 ms 4972 KB Output isn't correct
5 Correct 34 ms 4972 KB Output is correct
6 Correct 41 ms 4972 KB Output is correct
7 Correct 54 ms 4972 KB Output is correct
8 Correct 45 ms 4972 KB Output is correct
9 Incorrect 72 ms 4972 KB Output isn't correct
10 Correct 293 ms 9196 KB Output is correct
11 Incorrect 96 ms 9196 KB Output isn't correct
12 Correct 140 ms 9196 KB Output is correct
13 Incorrect 113 ms 9196 KB Output isn't correct
14 Correct 85 ms 9196 KB Output is correct
15 Correct 119 ms 9196 KB Output is correct
16 Correct 137 ms 9256 KB Output is correct
17 Correct 115 ms 9256 KB Output is correct
18 Incorrect 98 ms 9256 KB Output isn't correct
19 Correct 201 ms 9580 KB Output is correct
20 Incorrect 283 ms 12652 KB Output isn't correct
21 Incorrect 173 ms 12652 KB Output isn't correct
22 Correct 175 ms 12652 KB Output is correct
23 Correct 143 ms 12652 KB Output is correct
24 Correct 165 ms 12652 KB Output is correct
25 Incorrect 174 ms 12652 KB Output isn't correct
26 Correct 159 ms 12652 KB Output is correct
27 Correct 161 ms 12652 KB Output is correct
28 Correct 243 ms 12652 KB Output is correct
29 Correct 216 ms 12652 KB Output is correct
30 Incorrect 343 ms 13804 KB Output isn't correct
31 Incorrect 180 ms 13804 KB Output isn't correct
32 Correct 172 ms 13804 KB Output is correct
33 Correct 201 ms 13804 KB Output is correct
34 Incorrect 186 ms 13804 KB Output isn't correct
35 Incorrect 167 ms 13804 KB Output isn't correct
36 Incorrect 188 ms 13804 KB Output isn't correct
37 Correct 266 ms 14388 KB Output is correct
38 Correct 324 ms 14388 KB Output is correct
39 Correct 223 ms 14388 KB Output is correct
40 Incorrect 306 ms 15472 KB Output isn't correct
41 Correct 480 ms 17516 KB Output is correct