oj.uz

Submission #90801

# Submission time Handle Problem Language Result Execution time Memory
90801 2018-12-24T13:09:10 Z FutymyClone 007 (CEOI14_007) C++14
100 / 100
 346 ms 18364 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

int n, m, s, d, a, b, ans1 = 0, ans2 = 0, d1[N], d2[N], d3[N], d4[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] > 1e9) {
                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] > 1e9) {
                d2[v] = d2[u] + 1;
                q.push(v);
            }
        }
    }
}

void bfs3(){
    memset(d3, 0x3f, sizeof(d3));
    queue <int> q; q.push(s); d3[s] = 0;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        ans1 = max(ans1, d3[u]);
        for (auto v: g[u]) {
            if (d3[v] > 1e9 && (d1[v] == d1[u] - 1 && d2[v] == d2[u] - 1)) {
                d3[v] = d3[u] + 1;
                q.push(v);
            }
        }
    }
}

void bfs4(){
    memset(d4, 0x3f, sizeof(d4));
    queue <int> q; q.push(d); d4[d] = 0;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        ans2 = max(ans2, d4[u]);
        for (auto v: g[u]) {
            if (d4[v] > 1e9 && (d1[v] == d1[u] - 1 && d2[v] == d2[u] - 1)) {
                d4[v] = d4[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();
    if (d1[d] - d1[s] != d2[d] - d2[s]) printf("%d", max(min(d1[d] - d1[s], d2[d] - d2[s]), -1));
    else {
        bfs3(); bfs4();
        printf("%d", max(d1[d] - d1[s] - ((d1[d] - d1[s] + ans1) < ans2), -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:69: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:70: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:73: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
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6648 KB Output is correct
2 Correct 8 ms 8188 KB Output is correct
3 Correct 10 ms 8248 KB Output is correct
4 Correct 8 ms 8376 KB Output is correct
5 Correct 8 ms 8380 KB Output is correct
6 Correct 8 ms 8456 KB Output is correct
7 Correct 8 ms 8460 KB Output is correct
8 Correct 8 ms 8460 KB Output is correct
9 Correct 8 ms 8460 KB Output is correct
10 Correct 7 ms 8460 KB Output is correct
11 Correct 7 ms 8460 KB Output is correct
12 Correct 8 ms 8460 KB Output is correct
13 Correct 8 ms 8460 KB Output is correct
14 Correct 8 ms 8460 KB Output is correct
15 Correct 8 ms 8460 KB Output is correct
16 Correct 9 ms 8460 KB Output is correct
17 Correct 8 ms 8460 KB Output is correct
18 Correct 8 ms 8468 KB Output is correct
19 Correct 8 ms 8468 KB Output is correct
20 Correct 8 ms 8468 KB Output is correct
21 Correct 7 ms 8468 KB Output is correct
22 Correct 8 ms 8468 KB Output is correct
23 Correct 9 ms 8468 KB Output is correct
24 Correct 8 ms 8468 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9656 KB Output is correct
2 Correct 40 ms 10240 KB Output is correct
3 Correct 28 ms 10240 KB Output is correct
4 Correct 37 ms 10336 KB Output is correct
5 Correct 25 ms 10336 KB Output is correct
6 Correct 27 ms 10336 KB Output is correct
7 Correct 29 ms 10336 KB Output is correct
8 Correct 34 ms 10336 KB Output is correct
9 Correct 49 ms 10336 KB Output is correct
10 Correct 167 ms 14516 KB Output is correct
11 Correct 56 ms 14516 KB Output is correct
12 Correct 79 ms 14516 KB Output is correct
13 Correct 65 ms 14516 KB Output is correct
14 Correct 52 ms 14516 KB Output is correct
15 Correct 72 ms 14516 KB Output is correct
16 Correct 82 ms 14516 KB Output is correct
17 Correct 78 ms 14516 KB Output is correct
18 Correct 68 ms 14516 KB Output is correct
19 Correct 140 ms 14516 KB Output is correct
20 Correct 257 ms 15712 KB Output is correct
21 Correct 112 ms 15712 KB Output is correct
22 Correct 97 ms 15712 KB Output is correct
23 Correct 106 ms 15712 KB Output is correct
24 Correct 105 ms 15712 KB Output is correct
25 Correct 105 ms 15712 KB Output is correct
26 Correct 96 ms 15712 KB Output is correct
27 Correct 106 ms 15712 KB Output is correct
28 Correct 108 ms 15712 KB Output is correct
29 Correct 155 ms 15712 KB Output is correct
30 Correct 248 ms 16204 KB Output is correct
31 Correct 122 ms 16204 KB Output is correct
32 Correct 117 ms 16204 KB Output is correct
33 Correct 115 ms 16204 KB Output is correct
34 Correct 142 ms 16204 KB Output is correct
35 Correct 112 ms 16204 KB Output is correct
36 Correct 131 ms 16204 KB Output is correct
37 Correct 133 ms 16204 KB Output is correct
38 Correct 144 ms 16204 KB Output is correct
39 Correct 166 ms 16204 KB Output is correct
40 Correct 235 ms 16204 KB Output is correct
41 Correct 346 ms 18364 KB Output is correct