oj.uz

답안 #793404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793404 2023-07-25T19:16:23 Z Valaki2 007 (CEOI14_007) C++14
37 / 100
 171 ms 17548 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*/true) {
            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 = min(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 + ds[cur] == max(da[s], db[s])) {
            if(min_dab + ds[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
16.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 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Partially correct 3 ms 4948 KB Partially correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4988 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is 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 Partially correct 3 ms 4948 KB Partially correct
23 Partially correct 2 ms 4948 KB Partially correct
24 Correct 3 ms 4948 KB Output is correct

Subtask #2
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 6880 KB Output is correct
2 Correct 18 ms 7696 KB Output is correct
3 Correct 15 ms 6976 KB Output is correct
4 Correct 18 ms 7820 KB Output is correct
5 Correct 15 ms 6740 KB Output is correct
6 Correct 13 ms 7036 KB Output is correct
7 Partially correct 16 ms 7252 KB Partially correct
8 Correct 17 ms 7272 KB Output is correct
9 Correct 26 ms 7764 KB Output is correct
10 Correct 91 ms 12100 KB Output is correct
11 Correct 29 ms 9172 KB Output is correct
12 Correct 43 ms 10332 KB Output is correct
13 Correct 37 ms 9504 KB Output is correct
14 Correct 27 ms 8836 KB Output is correct
15 Correct 36 ms 10444 KB Output is correct
16 Correct 38 ms 10700 KB Output is correct
17 Partially correct 34 ms 10100 KB Partially correct
18 Correct 35 ms 10080 KB Output is correct
19 Correct 86 ms 11296 KB Output is correct
20 Correct 128 ms 14088 KB Output is correct
21 Correct 49 ms 12468 KB Output is correct
22 Correct 45 ms 11520 KB Output is correct
23 Correct 46 ms 12352 KB Output is correct
24 Correct 47 ms 12336 KB Output is correct
25 Correct 46 ms 11864 KB Output is correct
26 Correct 55 ms 11672 KB Output is correct
27 Partially correct 50 ms 12536 KB Partially correct
28 Correct 55 ms 12476 KB Output is correct
29 Correct 78 ms 12876 KB Output is correct
30 Correct 168 ms 14972 KB Output is correct
31 Correct 57 ms 13680 KB Output is correct
32 Correct 61 ms 12456 KB Output is correct
33 Correct 51 ms 12736 KB Output is correct
34 Correct 59 ms 12988 KB Output is correct
35 Correct 70 ms 12748 KB Output is correct
36 Correct 52 ms 13004 KB Output is correct
37 Correct 74 ms 14172 KB Output is correct
38 Partially correct 62 ms 13824 KB Partially correct
39 Partially correct 94 ms 13984 KB Partially correct
40 Correct 109 ms 15428 KB Output is correct
41 Correct 171 ms 17548 KB Output is correct