oj.uz

Submission #82368

# Submission time Handle Problem Language Result Execution time Memory
82368 2018-10-30T10:05:17 Z minhtung0404 007 (CEOI14_007) C++17
0 / 100
 640 ms 15916 KB 
#include<bits/stdc++.h>
const int N = 2e5 + 5;
using namespace std;

vector <int> adj[N];
int n, m, s, d, a, b;
int ck[N];

bool check(int num){
    for (int i = 1; i <= n; i++) ck[i] = 0;
    queue <int> mq, mq2; mq.push(d); ck[d] = 1;
    while (mq.size()){
        int u = mq.front();
        if (ck[u] == num+1) break;
        mq.pop();
        for (auto v : adj[u]){
            if (ck[v]) continue;
            ck[v] = ck[u] + 1;
            mq.push(v);
        }
    }
    if (ck[a] || ck[b]) return false;
    mq2.push(s); ck[s] = -1; int cnt = 1;
    while (mq2.size()){
        while (mq.size()){
            int u = mq.front();
            if (ck[u] == num+cnt+1) break;
            mq.pop();
            if (ck[u] < 0) continue;
            for (auto v : adj[u]){
                if (ck[v]) continue;
                ck[v] = ck[u] + 1;
                mq.push(v);
            }
        }

        while (mq2.size()){
            int u = mq2.front();
            if (-ck[u] == cnt+1) break;
            mq2.pop();
            for (auto v : adj[u]){
                if (ck[v] < 0) continue;
                ck[v] = ck[u] - 1;
                mq2.push(v);
            }
        }
        if (ck[a] > 0 || ck[b] > 0) return false;
        cnt++;
    }
    return true;
}

int main(){
//    freopen("SPY.inp", "r", stdin);
//    freopen("SPY.out", "w", stdout);
    scanf("%d %d", &n, &m);
    scanf("%d %d %d %d", &s, &d, &a, &b);
    for (int i = 1; i <= m; i++){
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    int l = 0, r = n + 1, ans = -1;
    while (l != r){
        int mid = (l + r + 1) / 2;
        if (check(mid)){
            ans = mid;
            l = mid;
        }
        else{
            r = mid-1;
        }
    }
    if (check(l)) ans = l;
    printf("%d", ans);
}

Compilation message

007.cpp: In function 'int main()':
007.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
007.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &s, &d, &a, &b);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
007.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Incorrect 6 ms 5348 KB Output isn't correct
5 Incorrect 7 ms 5348 KB Output isn't correct
6 Correct 6 ms 5348 KB Output is correct
7 Correct 7 ms 5348 KB Output is correct
8 Incorrect 6 ms 5348 KB Output isn't correct
9 Correct 6 ms 5348 KB Output is correct
10 Correct 7 ms 5348 KB Output is correct
11 Correct 6 ms 5348 KB Output is correct
12 Incorrect 6 ms 5348 KB Output isn't correct
13 Correct 7 ms 5348 KB Output is correct
14 Incorrect 6 ms 5348 KB Output isn't correct
15 Correct 6 ms 5348 KB Output is correct
16 Incorrect 6 ms 5348 KB Output isn't correct
17 Incorrect 7 ms 5348 KB Output isn't correct
18 Incorrect 7 ms 5348 KB Output isn't correct
19 Correct 7 ms 5348 KB Output is correct
20 Correct 7 ms 5348 KB Output is correct
21 Correct 8 ms 5348 KB Output is correct
22 Correct 7 ms 5348 KB Output is correct
23 Correct 8 ms 5348 KB Output is correct
24 Incorrect 9 ms 5348 KB Output isn't correct

Subtask #2
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 6736 KB Output is correct
2 Incorrect 70 ms 7384 KB Output isn't correct
3 Correct 60 ms 7384 KB Output is correct
4 Incorrect 63 ms 7392 KB Output isn't correct
5 Correct 59 ms 7392 KB Output is correct
6 Correct 60 ms 7392 KB Output is correct
7 Correct 56 ms 7392 KB Output is correct
8 Correct 60 ms 7392 KB Output is correct
9 Incorrect 82 ms 7392 KB Output isn't correct
10 Correct 280 ms 11676 KB Output is correct
11 Incorrect 133 ms 11676 KB Output isn't correct
12 Correct 177 ms 11676 KB Output is correct
13 Incorrect 103 ms 11676 KB Output isn't correct
14 Correct 88 ms 11676 KB Output is correct
15 Correct 146 ms 11676 KB Output is correct
16 Correct 219 ms 11676 KB Output is correct
17 Correct 120 ms 11676 KB Output is correct
18 Incorrect 130 ms 11676 KB Output isn't correct
19 Correct 202 ms 11676 KB Output is correct
20 Incorrect 363 ms 13196 KB Output isn't correct
21 Incorrect 195 ms 13196 KB Output isn't correct
22 Correct 184 ms 13196 KB Output is correct
23 Correct 212 ms 13196 KB Output is correct
24 Correct 181 ms 13196 KB Output is correct
25 Incorrect 182 ms 13196 KB Output isn't correct
26 Correct 201 ms 13196 KB Output is correct
27 Correct 231 ms 13196 KB Output is correct
28 Correct 248 ms 13196 KB Output is correct
29 Correct 313 ms 13196 KB Output is correct
30 Incorrect 410 ms 13716 KB Output isn't correct
31 Incorrect 273 ms 13716 KB Output isn't correct
32 Correct 284 ms 13716 KB Output is correct
33 Correct 271 ms 13716 KB Output is correct
34 Incorrect 367 ms 13716 KB Output isn't correct
35 Incorrect 236 ms 13716 KB Output isn't correct
36 Incorrect 224 ms 13716 KB Output isn't correct
37 Correct 428 ms 13716 KB Output is correct
38 Correct 254 ms 13716 KB Output is correct
39 Correct 489 ms 13716 KB Output is correct
40 Incorrect 484 ms 13716 KB Output isn't correct
41 Correct 640 ms 15916 KB Output is correct