oj.uz

Submission #90795

# Submission time Handle Problem Language Result Execution time Memory
90795 2018-12-24T12:55:10 Z FutymyClone 007 (CEOI14_007) C++14
0 / 100
 291 ms 17500 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

int n, m, s, d, a, b, d1[N], d2[N];
vector <int> g[N];

void bfs1(){
    memset(d1, 0x3f, sizeof(d1)); queue <int> q;
    d1[a] = 0; q.push(a);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (auto v: g[u]) {
            if (d1[v] > d1[u] + 1) {
                d1[v] = d1[u] + 1;
                q.push(v);
            }
        }
    }
}

void bfs2(){
    memset(d2, 0x3f, sizeof(d2)); queue <int> q;
    d2[b] = 0; q.push(b);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (auto v: g[u]) {
            if (d2[v] > d2[u] + 1) {
                d2[v] = d2[u] + 1;
                q.push(v);
            }
        }
    }
}

int main(){
    scanf("%d %d", &n, &m);
    scanf("%d %d %d %d", &s, &d, &a, &b);
    for (int i = 1; i <= m; i++) {
        int u, v;
        scanf("%d %d", &u, &v);
        g[u].push_back(v); g[v].push_back(u);
    }

    bfs1(); bfs2();
    printf("%d", max(min(d1[d] - d1[s], d2[d] - d2[s]), -1));
    return 0;
}
/*
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:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
007.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &s, &d, &a, &b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
007.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 30.0

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

Subtask #2
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8536 KB Output is correct
2 Incorrect 38 ms 9420 KB Output isn't correct
3 Correct 27 ms 9420 KB Output is correct
4 Incorrect 37 ms 9432 KB Output isn't correct
5 Correct 29 ms 9432 KB Output is correct
6 Correct 27 ms 9432 KB Output is correct
7 Correct 30 ms 9432 KB Output is correct
8 Correct 30 ms 9432 KB Output is correct
9 Incorrect 43 ms 9564 KB Output isn't correct
10 Correct 159 ms 13792 KB Output is correct
11 Incorrect 50 ms 13792 KB Output isn't correct
12 Correct 65 ms 13792 KB Output is correct
13 Incorrect 62 ms 13792 KB Output isn't correct
14 Correct 48 ms 13792 KB Output is correct
15 Correct 68 ms 13792 KB Output is correct
16 Correct 71 ms 13792 KB Output is correct
17 Correct 64 ms 13792 KB Output is correct
18 Incorrect 57 ms 13792 KB Output isn't correct
19 Correct 98 ms 13792 KB Output is correct
20 Incorrect 185 ms 15020 KB Output isn't correct
21 Incorrect 82 ms 15020 KB Output isn't correct
22 Correct 76 ms 15020 KB Output is correct
23 Correct 84 ms 15020 KB Output is correct
24 Correct 91 ms 15020 KB Output is correct
25 Incorrect 82 ms 15020 KB Output isn't correct
26 Correct 76 ms 15020 KB Output is correct
27 Correct 87 ms 15020 KB Output is correct
28 Correct 100 ms 15020 KB Output is correct
29 Correct 144 ms 15020 KB Output is correct
30 Incorrect 233 ms 15416 KB Output isn't correct
31 Incorrect 128 ms 15416 KB Output isn't correct
32 Correct 108 ms 15416 KB Output is correct
33 Correct 108 ms 15416 KB Output is correct
34 Incorrect 141 ms 15416 KB Output isn't correct
35 Incorrect 109 ms 15416 KB Output isn't correct
36 Incorrect 87 ms 15416 KB Output isn't correct
37 Correct 102 ms 15416 KB Output is correct
38 Correct 104 ms 15416 KB Output is correct
39 Correct 222 ms 15416 KB Output is correct
40 Incorrect 204 ms 15416 KB Output isn't correct
41 Correct 291 ms 17500 KB Output is correct