oj.uz

Submission #101474

# Submission time Handle Problem Language Result Execution time Memory
101474 2019-03-19T02:57:33 Z dwsc 007 (CEOI14_007) C++14
90 / 100
 563 ms 26752 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin >> n >> m;
    vector<int> adj[m];
    int s,d,a,b;
    cin >> s >> d >> a >> b;
    s--;
    d--;
    a--;
    b--;
    for (int i = 0; i < m; i++){
        int x,y;
        cin >> x >> y;
        x--;
        y--;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    queue<int> q;
    int p1[n],p2[n];
    int dist1[n],dist2[n];
    memset(dist1,-1,sizeof(dist1));
    memset(dist2,-1,sizeof(dist2));
    dist1[s] = 0;
    dist2[d] = 0;
    q.push(s);
    while (!q.empty()){
        int u = q.front();
        q.pop();
        for (int i = 0; i < adj[u].size(); i++){
            int v = adj[u][i];
            if (dist1[v] == -1){
                dist1[v] = dist1[u]+1;
                q.push(v);
                p1[v] = u;
            }
        }
    }
    q.push(d);
    while (!q.empty()){
        int u = q.front();
        q.pop();
        for (int i = 0; i < adj[u].size(); i++){
            int v = adj[u][i];
            if (dist2[v] == -1){
                dist2[v] = dist2[u]+1;
                q.push(v);
                p2[v] = u;
            }
        }
    }
   // cout << dist1[a] << " " << dist1[b] << "\n";
   // cout << dist2[a] << " " << dist2[b] << "\n";
    if (dist2[a] < dist1[a] && dist2[b] < dist1[b]) cout << -1;
    else{
        if (dist1[a] > dist1[b]){
            swap(dist1[a],dist1[b]);
            swap(dist2[a],dist2[b]);
        }
        if (dist1[a] == dist1[b]){
            if (dist2[a] == dist2[b]){
                int fin1s = a,fin2s = b;
                int fin1d = a,fin2d = b;
                int num1 = 0,num2 = 0;
                while (fin1s != fin2s){
                    fin1s = p1[fin1s];
                    fin2s = p1[fin2s];
                    num1++;
                }
                while (fin1d != fin2d){
                    fin1d = p2[fin1d];
                    fin2d = p2[fin2d];
                    num2++;
                }
                cout << dist2[a]-dist1[a]-(num2<num1);
            }
            else if (dist2[a]+1 == dist2[b]) cout << dist2[a] - dist1[a];
            else cout << dist2[b] - dist1[b];
        }
        else if (dist1[a]+1 == dist1[b]){
            if (dist2[a] == dist2[b]) cout << dist2[b] - dist1[b];
            else if (dist2[a] +1 == dist2[b]) cout << dist2[a] - dist1[a];
            else cout << dist2[b] - dist1[b];
        }
    }
}/*
6 6
1 2 3 4
1 5
5 6
6 3
6 4
1 2
3 4

6 7
5 6 1 2
6 3
1 2
1 3
2 3
1 5
2 4
5 4
*/

Compilation message

007.cpp: In function 'int main()':
007.cpp:32:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < adj[u].size(); i++){
                         ~~^~~~~~~~~~~~~~~
007.cpp:45:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < adj[u].size(); i++){
                         ~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 3188 KB Output is correct
2 Correct 57 ms 4472 KB Output is correct
3 Correct 52 ms 3448 KB Output is correct
4 Correct 79 ms 4688 KB Output is correct
5 Correct 47 ms 3196 KB Output is correct
6 Correct 46 ms 3448 KB Output is correct
7 Correct 74 ms 3832 KB Output is correct
8 Correct 50 ms 3832 KB Output is correct
9 Correct 78 ms 5112 KB Output is correct
10 Correct 397 ms 18424 KB Output is correct
11 Correct 92 ms 6780 KB Output is correct
12 Correct 138 ms 8540 KB Output is correct
13 Correct 127 ms 7416 KB Output is correct
14 Correct 89 ms 6264 KB Output is correct
15 Correct 111 ms 8568 KB Output is correct
16 Correct 139 ms 8952 KB Output is correct
17 Correct 126 ms 8056 KB Output is correct
18 Correct 116 ms 8184 KB Output is correct
19 Correct 239 ms 11740 KB Output is correct
20 Correct 563 ms 20588 KB Output is correct
21 Correct 196 ms 11712 KB Output is correct
22 Correct 183 ms 10220 KB Output is correct
23 Correct 193 ms 11512 KB Output is correct
24 Correct 171 ms 11384 KB Output is correct
25 Correct 166 ms 10860 KB Output is correct
26 Correct 187 ms 10348 KB Output is correct
27 Correct 204 ms 11644 KB Output is correct
28 Correct 216 ms 11712 KB Output is correct
29 Correct 328 ms 14920 KB Output is correct
30 Correct 491 ms 21776 KB Output is correct
31 Correct 274 ms 13468 KB Output is correct
32 Correct 217 ms 11668 KB Output is correct
33 Correct 185 ms 11972 KB Output is correct
34 Correct 226 ms 12536 KB Output is correct
35 Correct 222 ms 12024 KB Output is correct
36 Correct 194 ms 12408 KB Output is correct
37 Correct 238 ms 14072 KB Output is correct
38 Correct 255 ms 13816 KB Output is correct
39 Correct 273 ms 13816 KB Output is correct
40 Correct 416 ms 19388 KB Output is correct
41 Correct 559 ms 26752 KB Output is correct