oj.uz

답안 #58252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58252 2018-07-17T09:17:38 Z evpipis 007 (CEOI14_007) C++14
30 / 100
 990 ms 16616 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;

const int len = 2e5+5, inf = 1e9;
int dis[len], tim[len];
int n, m, s1, s2, t1, t2;
queue<int> myq;
vector<int> adj[len];
bool check(int x){
    for (int i = 1; i <= n; i++)
        dis[i] = inf;

    if (0 < tim[s2]+x)
        dis[s2] = 0, myq.push(s2);
    while (!myq.empty()){
        int u = myq.front();
        myq.pop();

        for (int j = 0; j < adj[u].size(); j++){
            int v = adj[u][j];
            if (dis[v] == inf)// && dis[u]+1 < tim[v]+x)
                dis[v] = dis[u]+1, myq.push(v);
        }
    }

    return !(dis[t1] < tim[t1]+x || dis[t2] < tim[t2]+x);
}

int bs(){
    int l = 0, r = n, ans = -1;
    while (l <= r){
        int mid = (l+r)/2;
        if (check(mid))
            l = mid+1, ans = mid;
        else
            r = mid-1;
    }

    return ans;
}

int main(){
    scanf("%d %d %d %d %d %d", &n, &m, &s1, &s2, &t1, &t2);
    for (int i = 0; i < m; i++){
        int a, b;
        scanf("%d %d", &a, &b);
        adj[a].pb(b);
        adj[b].pb(a);
    }

    for (int i = 1; i <= n; i++)
        tim[i] = -1;

    tim[s1] = 0, myq.push(s1);
    while (!myq.empty()){
        int u = myq.front();
        myq.pop();

        for (int j = 0; j < adj[u].size(); j++){
            int v = adj[u][j];
            if (tim[v] == -1)
                tim[v] = tim[u]+1, myq.push(v);
        }
    }

    printf("%d\n", bs() - 1);
    return 0;
}

/*
9 10
9 8 1 2
1 2
2 3
3 1
2 4
4 5
5 2
5 7
7 6
7 8
7 9
*/

Compilation message

007.cpp: In function 'bool check(int)':
007.cpp:26:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < adj[u].size(); j++){
                         ~~^~~~~~~~~~~~~~~
007.cpp: In function 'int main()':
007.cpp:66:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < adj[u].size(); j++){
                         ~~^~~~~~~~~~~~~~~
007.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d %d %d", &n, &m, &s1, &s2, &t1, &t2);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
007.cpp:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 6 ms 4984 KB Partially correct
2 Partially correct 7 ms 5092 KB Partially correct
3 Partially correct 6 ms 5296 KB Partially correct
4 Correct 8 ms 5296 KB Output is correct
5 Correct 7 ms 5296 KB Output is correct
6 Partially correct 5 ms 5300 KB Partially correct
7 Partially correct 6 ms 5300 KB Partially correct
8 Correct 7 ms 5300 KB Output is correct
9 Partially correct 7 ms 5300 KB Partially correct
10 Partially correct 5 ms 5300 KB Partially correct
11 Partially correct 7 ms 5300 KB Partially correct
12 Correct 6 ms 5300 KB Output is correct
13 Partially correct 6 ms 5432 KB Partially correct
14 Correct 6 ms 5432 KB Output is correct
15 Partially correct 5 ms 5432 KB Partially correct
16 Correct 6 ms 5432 KB Output is correct
17 Correct 7 ms 5432 KB Output is correct
18 Correct 6 ms 5432 KB Output is correct
19 Partially correct 7 ms 5432 KB Partially correct
20 Partially correct 7 ms 5432 KB Partially correct
21 Partially correct 6 ms 5432 KB Partially correct
22 Partially correct 7 ms 5432 KB Partially correct
23 Partially correct 6 ms 5432 KB Partially correct
24 Correct 7 ms 5432 KB Output is correct

Subtask #2
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 69 ms 6900 KB Partially correct
2 Correct 99 ms 7524 KB Output is correct
3 Partially correct 49 ms 7524 KB Partially correct
4 Correct 64 ms 7692 KB Output is correct
5 Partially correct 48 ms 7692 KB Partially correct
6 Partially correct 69 ms 7692 KB Partially correct
7 Partially correct 100 ms 7692 KB Partially correct
8 Partially correct 92 ms 7692 KB Partially correct
9 Correct 129 ms 7692 KB Output is correct
10 Partially correct 506 ms 12048 KB Partially correct
11 Correct 234 ms 12048 KB Output is correct
12 Partially correct 283 ms 12048 KB Partially correct
13 Correct 207 ms 12048 KB Output is correct
14 Partially correct 120 ms 12048 KB Partially correct
15 Partially correct 293 ms 12048 KB Partially correct
16 Partially correct 244 ms 12048 KB Partially correct
17 Partially correct 232 ms 12048 KB Partially correct
18 Correct 199 ms 12048 KB Output is correct
19 Partially correct 285 ms 12048 KB Partially correct
20 Correct 506 ms 13584 KB Output is correct
21 Correct 317 ms 13584 KB Output is correct
22 Partially correct 245 ms 13584 KB Partially correct
23 Partially correct 430 ms 13584 KB Partially correct
24 Partially correct 251 ms 13584 KB Partially correct
25 Correct 268 ms 13584 KB Output is correct
26 Partially correct 221 ms 13584 KB Partially correct
27 Partially correct 480 ms 13584 KB Partially correct
28 Partially correct 536 ms 13584 KB Partially correct
29 Partially correct 553 ms 13584 KB Partially correct
30 Correct 761 ms 14212 KB Output is correct
31 Correct 386 ms 14212 KB Output is correct
32 Partially correct 434 ms 14212 KB Partially correct
33 Partially correct 409 ms 14212 KB Partially correct
34 Correct 492 ms 14212 KB Output is correct
35 Correct 343 ms 14212 KB Output is correct
36 Correct 519 ms 14212 KB Output is correct
37 Partially correct 550 ms 14212 KB Partially correct
38 Partially correct 469 ms 14212 KB Partially correct
39 Partially correct 716 ms 14212 KB Partially correct
40 Correct 625 ms 14332 KB Output is correct
41 Partially correct 990 ms 16616 KB Partially correct