oj.uz

답안 #58224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
58224 2018-07-17T08:23:11 Z evpipis 007 (CEOI14_007) C++14
0 / 100
 829 ms 16704 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;
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] = -1;

    //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] == -1)// && 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;
}

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 8 ms 4984 KB Output is correct
2 Correct 6 ms 5224 KB Output is correct
3 Correct 6 ms 5268 KB Output is correct
4 Incorrect 7 ms 5268 KB Output isn't correct
5 Incorrect 6 ms 5268 KB Output isn't correct
6 Correct 7 ms 5268 KB Output is correct
7 Correct 5 ms 5268 KB Output is correct
8 Incorrect 7 ms 5268 KB Output isn't correct
9 Correct 8 ms 5268 KB Output is correct
10 Correct 6 ms 5268 KB Output is correct
11 Correct 6 ms 5268 KB Output is correct
12 Incorrect 6 ms 5268 KB Output isn't correct
13 Correct 6 ms 5320 KB Output is correct
14 Incorrect 7 ms 5320 KB Output isn't correct
15 Correct 6 ms 5320 KB Output is correct
16 Incorrect 6 ms 5320 KB Output isn't correct
17 Incorrect 7 ms 5428 KB Output isn't correct
18 Incorrect 6 ms 5428 KB Output isn't correct
19 Correct 8 ms 5428 KB Output is correct
20 Correct 8 ms 5428 KB Output is correct
21 Correct 9 ms 5428 KB Output is correct
22 Correct 8 ms 5428 KB Output is correct
23 Correct 9 ms 5428 KB Output is correct
24 Incorrect 7 ms 5428 KB Output isn't correct

Subtask #2
0.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 6888 KB Output is correct
2 Incorrect 58 ms 7652 KB Output isn't correct
3 Correct 50 ms 7652 KB Output is correct
4 Incorrect 119 ms 7784 KB Output isn't correct
5 Correct 50 ms 7784 KB Output is correct
6 Correct 45 ms 7784 KB Output is correct
7 Correct 81 ms 7784 KB Output is correct
8 Correct 55 ms 7784 KB Output is correct
9 Incorrect 128 ms 7784 KB Output isn't correct
10 Correct 477 ms 12008 KB Output is correct
11 Incorrect 223 ms 12008 KB Output isn't correct
12 Correct 260 ms 12008 KB Output is correct
13 Incorrect 244 ms 12008 KB Output isn't correct
14 Correct 162 ms 12008 KB Output is correct
15 Correct 266 ms 12008 KB Output is correct
16 Correct 187 ms 12008 KB Output is correct
17 Correct 155 ms 12008 KB Output is correct
18 Incorrect 312 ms 12008 KB Output isn't correct
19 Correct 343 ms 12008 KB Output is correct
20 Incorrect 603 ms 13596 KB Output isn't correct
21 Incorrect 354 ms 13596 KB Output isn't correct
22 Correct 211 ms 13596 KB Output is correct
23 Correct 462 ms 13596 KB Output is correct
24 Correct 225 ms 13596 KB Output is correct
25 Incorrect 264 ms 13596 KB Output isn't correct
26 Correct 435 ms 13596 KB Output is correct
27 Correct 416 ms 13596 KB Output is correct
28 Correct 374 ms 13596 KB Output is correct
29 Correct 311 ms 13596 KB Output is correct
30 Incorrect 490 ms 14192 KB Output isn't correct
31 Incorrect 372 ms 14192 KB Output isn't correct
32 Correct 337 ms 14192 KB Output is correct
33 Correct 307 ms 14192 KB Output is correct
34 Incorrect 429 ms 14192 KB Output isn't correct
35 Incorrect 305 ms 14192 KB Output isn't correct
36 Incorrect 540 ms 14192 KB Output isn't correct
37 Correct 367 ms 14192 KB Output is correct
38 Correct 450 ms 14192 KB Output is correct
39 Correct 768 ms 14192 KB Output is correct
40 Incorrect 777 ms 14352 KB Output isn't correct
41 Correct 829 ms 16704 KB Output is correct