oj.uz

답안 #793385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793385 2023-07-25T18:53:35 Z Valaki2 007 (CEOI14_007) C++14
0 / 100
 169 ms 17532 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int maxn = 2e5;

int n, m;
vector<int> graph[1 + maxn];
int g, s, a, b;
vector<int> dg, ds, da, db;

vector<int> bfs(int start) {
    vector<int> res(1 + n, -1);
    res[start] = 0;
    queue<int> q;
    q.push(start);
    while(!q.empty()) {
        int cur = q.front();
        q.pop();
        for(int nei : graph[cur]) {
            if(res[nei] == -1) {
                res[nei] = res[cur] + 1;
                q.push(nei);
            }
        }
    }
    return res;
}

void solve() {
    cin >> n >> m;
    cin >> g >> s >> a >> b;
    for(int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        graph[x].pb(y);
        graph[y].pb(x);
    }
    dg = bfs(g), ds = bfs(s), da = bfs(a), db = bfs(b);
    if((da[s] < da[g]) || (db[s] < db[g])) {
        cout << "-1\n";
        return;
    }
    int add_a = da[s] - 1 - da[g], add_b = db[s] - 1 - db[g];
    bool extra_case = true;
    if(add_a != add_b) {
        add_a++, add_b++;
        extra_case = false;
    }
    int to_add = min(add_a, add_b);
    if(!extra_case) {
        cout << to_add << "\n";
        return;
    }
    to_add++;
    da[g] += to_add;
    db[g] += to_add;
    int closest_g = n + 1, closest_s = n + 1;
    if(da[s] != db[s] || da[g] != db[g]) {
        //exit(1);
    }
    if(da[s] != da[g] || db[s] != db[g]) {
        exit(1);
    }
    for(int cur = 1; cur <= n; cur++) {
        /*int max_dab = max(da[cur], db[cur]), min_dab = min(da[cur], db[cur]);
        if((max_dab + closest_g == max(da[g], db[g])) && (min_dab + closest_g == min(da[g], db[g]))) {
            closest_g = min(closest_g, max_dab);
        }
        if((max_dab + closest_s == max(da[s], db[s]))) {
            closest_s = min(closest_s, max_dab);
        }*/
        int max_dab = max(da[cur], db[cur]);
        int min_dab = max(da[cur], db[cur]);
        if(max_dab + dg[cur] == max(da[g], db[g])) {
            if(min_dab + dg[cur] == min(da[g], db[g])) {
                closest_g = min(closest_g, max_dab);
            }
        }
        if(max_dab + dg[cur] == max(da[s], db[s])) {
            if(min_dab + dg[cur] == min(da[s], db[s])) {
                closest_s = min(closest_s, max_dab);
            }
        }
    }
    if(closest_s < closest_g) {
        to_add--;
    }
    cout << to_add << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
0.0 / 30.0

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

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6864 KB Output is correct
2 Incorrect 20 ms 7716 KB Output isn't correct
3 Correct 20 ms 6996 KB Output is correct
4 Incorrect 18 ms 7892 KB Output isn't correct
5 Correct 16 ms 6740 KB Output is correct
6 Correct 14 ms 7128 KB Output is correct
7 Correct 16 ms 7304 KB Output is correct
8 Correct 18 ms 7228 KB Output is correct
9 Incorrect 33 ms 7736 KB Output isn't correct
10 Correct 93 ms 12112 KB Output is correct
11 Incorrect 29 ms 9172 KB Output isn't correct
12 Correct 40 ms 10248 KB Output is correct
13 Incorrect 33 ms 9612 KB Output isn't correct
14 Correct 29 ms 8812 KB Output is correct
15 Correct 36 ms 10380 KB Output is correct
16 Correct 55 ms 10700 KB Output is correct
17 Correct 33 ms 10116 KB Output is correct
18 Incorrect 36 ms 10076 KB Output isn't correct
19 Correct 65 ms 11304 KB Output is correct
20 Incorrect 117 ms 14156 KB Output isn't correct
21 Incorrect 48 ms 12488 KB Output isn't correct
22 Correct 45 ms 11468 KB Output is correct
23 Correct 64 ms 12440 KB Output is correct
24 Correct 47 ms 12356 KB Output is correct
25 Incorrect 63 ms 11980 KB Output isn't correct
26 Correct 61 ms 11592 KB Output is correct
27 Correct 53 ms 12468 KB Output is correct
28 Correct 56 ms 12476 KB Output is correct
29 Correct 80 ms 13008 KB Output is correct
30 Incorrect 139 ms 15048 KB Output isn't correct
31 Incorrect 59 ms 13608 KB Output isn't correct
32 Correct 56 ms 12364 KB Output is correct
33 Correct 54 ms 12736 KB Output is correct
34 Incorrect 61 ms 13048 KB Output isn't correct
35 Incorrect 50 ms 12740 KB Output isn't correct
36 Incorrect 58 ms 13020 KB Output isn't correct
37 Correct 65 ms 14092 KB Output is correct
38 Correct 68 ms 13956 KB Output is correct
39 Correct 104 ms 13912 KB Output is correct
40 Incorrect 156 ms 15460 KB Output isn't correct
41 Correct 169 ms 17532 KB Output is correct