oj.uz

답안 #793388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793388 2023-07-25T18:57:02 Z Valaki2 007 (CEOI14_007) C++14
0 / 100
 169 ms 17460 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;
    for(int i = 1; i <= n; i++) {
        if(i != g) {
            dg[i] += 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 2 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 2 ms 4948 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 3 ms 4948 KB Output is correct
12 Incorrect 2 ms 4948 KB Output isn't correct
13 Correct 2 ms 4948 KB Output is correct
14 Incorrect 2 ms 4948 KB Output isn't correct
15 Correct 2 ms 4988 KB Output is correct
16 Incorrect 2 ms 4948 KB Output isn't correct
17 Incorrect 2 ms 4932 KB Output isn't correct
18 Incorrect 2 ms 4948 KB Output isn't correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 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 3 ms 4948 KB Output isn't correct

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6848 KB Output is correct
2 Incorrect 17 ms 7756 KB Output isn't correct
3 Correct 19 ms 7028 KB Output is correct
4 Incorrect 18 ms 7892 KB Output isn't correct
5 Correct 15 ms 6740 KB Output is correct
6 Correct 16 ms 7124 KB Output is correct
7 Correct 16 ms 7252 KB Output is correct
8 Correct 17 ms 7208 KB Output is correct
9 Incorrect 26 ms 7660 KB Output isn't correct
10 Correct 112 ms 12144 KB Output is correct
11 Incorrect 38 ms 9252 KB Output isn't correct
12 Correct 53 ms 10316 KB Output is correct
13 Incorrect 34 ms 9480 KB Output isn't correct
14 Correct 26 ms 8816 KB Output is correct
15 Correct 40 ms 10400 KB Output is correct
16 Correct 52 ms 10772 KB Output is correct
17 Correct 32 ms 10140 KB Output is correct
18 Incorrect 36 ms 10140 KB Output isn't correct
19 Correct 61 ms 11328 KB Output is correct
20 Incorrect 144 ms 14136 KB Output isn't correct
21 Incorrect 57 ms 12568 KB Output isn't correct
22 Correct 54 ms 11436 KB Output is correct
23 Correct 82 ms 12464 KB Output is correct
24 Correct 55 ms 12272 KB Output is correct
25 Incorrect 46 ms 11980 KB Output isn't correct
26 Correct 43 ms 11600 KB Output is correct
27 Correct 50 ms 12516 KB Output is correct
28 Correct 59 ms 12532 KB Output is correct
29 Correct 79 ms 12912 KB Output is correct
30 Incorrect 141 ms 14904 KB Output isn't correct
31 Incorrect 57 ms 13584 KB Output isn't correct
32 Correct 63 ms 12392 KB Output is correct
33 Correct 54 ms 12728 KB Output is correct
34 Incorrect 62 ms 12988 KB Output isn't correct
35 Incorrect 52 ms 12752 KB Output isn't correct
36 Incorrect 53 ms 13004 KB Output isn't correct
37 Correct 81 ms 14048 KB Output is correct
38 Correct 63 ms 13868 KB Output is correct
39 Correct 80 ms 13928 KB Output is correct
40 Incorrect 111 ms 15452 KB Output isn't correct
41 Correct 169 ms 17460 KB Output is correct