oj.uz

답안 #65055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65055 2018-08-06T13:53:35 Z bazsi700 007 (CEOI14_007) C++14
30 / 100
 411 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 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
9.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Partially correct 2 ms 408 KB Partially correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Partially correct 3 ms 592 KB Partially correct
7 Partially correct 4 ms 592 KB Partially correct
8 Correct 2 ms 592 KB Output is correct
9 Partially correct 2 ms 592 KB Partially correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Partially correct 2 ms 596 KB Partially correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 3 ms 616 KB Output is correct
18 Correct 4 ms 616 KB Output is correct
19 Partially correct 3 ms 616 KB Partially correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 3 ms 620 KB Output is correct
23 Partially correct 3 ms 620 KB Partially correct
24 Correct 3 ms 620 KB Output is correct

Subtask #2
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 3436 KB Output is correct
2 Correct 74 ms 4844 KB Output is correct
3 Partially correct 51 ms 4844 KB Partially correct
4 Correct 68 ms 4920 KB Output is correct
5 Correct 34 ms 4920 KB Output is correct
6 Correct 44 ms 4920 KB Output is correct
7 Correct 59 ms 4920 KB Output is correct
8 Correct 41 ms 4920 KB Output is correct
9 Correct 67 ms 4920 KB Output is correct
10 Partially correct 213 ms 9196 KB Partially correct
11 Correct 106 ms 9196 KB Output is correct
12 Partially correct 146 ms 9196 KB Partially correct
13 Correct 138 ms 9196 KB Output is correct
14 Correct 111 ms 9196 KB Output is correct
15 Correct 142 ms 9196 KB Output is correct
16 Correct 148 ms 9196 KB Output is correct
17 Correct 168 ms 9196 KB Output is correct
18 Correct 118 ms 9196 KB Output is correct
19 Partially correct 189 ms 9580 KB Partially correct
20 Correct 370 ms 12528 KB Output is correct
21 Correct 180 ms 12528 KB Output is correct
22 Partially correct 143 ms 12528 KB Partially correct
23 Correct 199 ms 12528 KB Output is correct
24 Partially correct 155 ms 12528 KB Partially correct
25 Correct 151 ms 12528 KB Output is correct
26 Correct 150 ms 12528 KB Output is correct
27 Correct 239 ms 12528 KB Output is correct
28 Correct 268 ms 12528 KB Output is correct
29 Partially correct 289 ms 12528 KB Partially correct
30 Correct 397 ms 13800 KB Output is correct
31 Correct 212 ms 13800 KB Output is correct
32 Partially correct 178 ms 13800 KB Partially correct
33 Correct 162 ms 13800 KB Output is correct
34 Correct 197 ms 13800 KB Output is correct
35 Correct 168 ms 13800 KB Output is correct
36 Correct 207 ms 13800 KB Output is correct
37 Correct 193 ms 14460 KB Output is correct
38 Correct 237 ms 14460 KB Output is correct
39 Correct 236 ms 14460 KB Output is correct
40 Correct 322 ms 15548 KB Output is correct
41 Partially correct 411 ms 17532 KB Partially correct