oj.uz

답안 #58241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58241 2018-07-17T08:48:24 Z evpipis 007 (CEOI14_007) C++14
0 / 100
 1000 ms 16512 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] == -1 && dis[t2] == -1);
    return (tim[t1]+x <= dis[t1] && tim[t2]+x <= dis[t2]);
}

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());
    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:27: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:68:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < adj[u].size(); j++){
                         ~~^~~~~~~~~~~~~~~
007.cpp:52: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:55: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
0.0 / 30.0

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

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 6832 KB Output is correct
2 Incorrect 145 ms 7600 KB Output isn't correct
3 Correct 62 ms 7600 KB Output is correct
4 Incorrect 85 ms 7780 KB Output isn't correct
5 Correct 62 ms 7780 KB Output is correct
6 Correct 73 ms 7780 KB Output is correct
7 Correct 84 ms 7780 KB Output is correct
8 Correct 103 ms 7780 KB Output is correct
9 Incorrect 91 ms 7780 KB Output isn't correct
10 Correct 322 ms 11888 KB Output is correct
11 Incorrect 211 ms 11888 KB Output isn't correct
12 Correct 192 ms 11888 KB Output is correct
13 Incorrect 156 ms 11888 KB Output isn't correct
14 Correct 113 ms 11888 KB Output is correct
15 Correct 212 ms 11888 KB Output is correct
16 Correct 262 ms 11888 KB Output is correct
17 Correct 180 ms 11888 KB Output is correct
18 Incorrect 270 ms 11888 KB Output isn't correct
19 Correct 356 ms 11888 KB Output is correct
20 Incorrect 641 ms 13608 KB Output isn't correct
21 Incorrect 285 ms 13608 KB Output isn't correct
22 Correct 422 ms 13608 KB Output is correct
23 Correct 305 ms 13608 KB Output is correct
24 Correct 398 ms 13608 KB Output is correct
25 Incorrect 317 ms 13608 KB Output isn't correct
26 Correct 524 ms 13608 KB Output is correct
27 Correct 343 ms 13608 KB Output is correct
28 Correct 528 ms 13608 KB Output is correct
29 Correct 444 ms 13608 KB Output is correct
30 Incorrect 560 ms 14392 KB Output isn't correct
31 Incorrect 485 ms 14392 KB Output isn't correct
32 Correct 659 ms 14392 KB Output is correct
33 Correct 377 ms 14392 KB Output is correct
34 Incorrect 563 ms 14392 KB Output isn't correct
35 Incorrect 411 ms 14392 KB Output isn't correct
36 Incorrect 517 ms 14392 KB Output isn't correct
37 Correct 600 ms 14392 KB Output is correct
38 Correct 710 ms 14392 KB Output is correct
39 Execution timed out 1054 ms 14392 KB Time limit exceeded
40 Incorrect 779 ms 14392 KB Output isn't correct
41 Correct 784 ms 16512 KB Output is correct