oj.uz

답안 #793347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793347 2023-07-25T18:09:49 Z Valaki2 007 (CEOI14_007) C++14
0 / 100
 176 ms 17608 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[s] += to_add;
    db[s] += to_add;
    int closest_g = n + 1, closest_s = n + 1;
    for(int cur = 1; cur <= n; cur++) {
        int dab = max(da[cur], db[cur]);
        if(dab + closest_g == da[g]) {
            closest_g = min(closest_g, dab);
        }
        if(dab + closest_s == db[s]) {
            closest_s = min(closest_s, 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 4 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Incorrect 3 ms 4948 KB Output isn't correct
5 Incorrect 3 ms 4948 KB Output isn't correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Incorrect 3 ms 5016 KB Output isn't correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4952 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 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 3 ms 4948 KB Output isn't correct
17 Incorrect 3 ms 5024 KB Output isn't correct
18 Incorrect 3 ms 4948 KB Output isn't correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5024 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 3 ms 4952 KB Output is correct
24 Incorrect 3 ms 5024 KB Output isn't correct

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 7108 KB Output is correct
2 Incorrect 18 ms 8052 KB Output isn't correct
3 Correct 15 ms 7200 KB Output is correct
4 Incorrect 18 ms 8140 KB Output isn't correct
5 Correct 15 ms 7040 KB Output is correct
6 Correct 14 ms 7316 KB Output is correct
7 Correct 16 ms 7488 KB Output is correct
8 Correct 19 ms 7540 KB Output is correct
9 Incorrect 26 ms 7932 KB Output isn't correct
10 Correct 90 ms 12316 KB Output is correct
11 Incorrect 28 ms 9420 KB Output isn't correct
12 Correct 39 ms 10480 KB Output is correct
13 Incorrect 33 ms 9856 KB Output isn't correct
14 Correct 26 ms 9056 KB Output is correct
15 Correct 35 ms 10636 KB Output is correct
16 Correct 38 ms 10900 KB Output is correct
17 Correct 32 ms 10312 KB Output is correct
18 Incorrect 34 ms 10396 KB Output isn't correct
19 Correct 67 ms 11596 KB Output is correct
20 Incorrect 127 ms 14428 KB Output isn't correct
21 Incorrect 54 ms 12836 KB Output isn't correct
22 Correct 45 ms 11760 KB Output is correct
23 Correct 45 ms 12588 KB Output is correct
24 Correct 45 ms 12592 KB Output is correct
25 Incorrect 46 ms 12232 KB Output isn't correct
26 Correct 56 ms 11856 KB Output is correct
27 Correct 50 ms 12684 KB Output is correct
28 Correct 73 ms 12808 KB Output is correct
29 Correct 87 ms 13168 KB Output is correct
30 Incorrect 139 ms 15228 KB Output isn't correct
31 Incorrect 57 ms 13900 KB Output isn't correct
32 Correct 55 ms 12628 KB Output is correct
33 Correct 52 ms 12864 KB Output is correct
34 Incorrect 58 ms 13280 KB Output isn't correct
35 Incorrect 51 ms 13004 KB Output isn't correct
36 Incorrect 59 ms 13292 KB Output isn't correct
37 Correct 76 ms 14380 KB Output is correct
38 Correct 89 ms 14080 KB Output is correct
39 Correct 69 ms 14028 KB Output is correct
40 Incorrect 106 ms 15528 KB Output isn't correct
41 Correct 176 ms 17608 KB Output is correct