oj.uz

답안 #117062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117062 2019-06-14T14:38:42 Z JohnTitor Wall (CEOI14_wall) C++11
0 / 100
 9 ms 5132 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "007"
int n, m;
int s, d, a, b;
int sa, sb, da, db;
int wa, wb;
int fa[200001];
bool donea[200001];
int fb[200001];
bool doneb[200001];
vector <int> g[200001];
queue <int> q;
void bfs(int s, int *f, bool *done){
    FOR(i, 1, n) done[i]=0;
    f[s]=0;
    done[s]=1;
    q.push(s);
    while(!q.empty()){
        s=q.front();
        q.pop();
        for(int v: g[s]) if(!done[v]){
            done[v]=1;
            f[v]=f[s]+1;
            q.push(v);
        }
    }
}
int main(){
    #ifdef Aria
        if(fopen(taskname".in", "r"))
            freopen(taskname".in", "r", stdin);
    #endif // Aria
    read(n);
    read(m);
    read(s);
    read(d);
    read(a);
    read(b);
    {
        int u, v;
        FOR(i, 1, m){
            read(u);
            read(v);
            g[u].pb(v);
            g[v].pb(u);
        }
    }
    bfs(a, fa, donea);
    bfs(b, fb, doneb);
    sa=fa[s];
    da=fa[d];
    sb=fb[s];
    db=fb[d];
    wa=da-sa;
    wb=db-sb;
    if(wa<0||wb<0){
        puts("-1");
        return 0;
    }
    else if(wa!=wb){
        writeln(min(wa, wb));
    }
    else{
        writeln(wa-1);
    }
}

Subtask #1
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 4992 KB Output isn't correct
2 Incorrect 6 ms 4992 KB Output isn't correct
3 Incorrect 5 ms 4992 KB Output isn't correct
4 Incorrect 6 ms 5120 KB Output isn't correct
5 Incorrect 7 ms 4992 KB Output isn't correct
6 Incorrect 8 ms 4864 KB Output isn't correct
7 Incorrect 6 ms 5120 KB Output isn't correct
8 Incorrect 6 ms 5120 KB Output isn't correct
9 Incorrect 6 ms 5120 KB Output isn't correct
10 Incorrect 6 ms 5120 KB Output isn't correct
11 Incorrect 6 ms 4992 KB Output isn't correct
12 Incorrect 6 ms 5120 KB Output isn't correct
13 Incorrect 8 ms 5120 KB Output isn't correct
14 Incorrect 7 ms 4992 KB Output isn't correct
15 Incorrect 7 ms 5120 KB Output isn't correct

Subtask #2
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 5120 KB Output isn't correct
2 Incorrect 6 ms 5116 KB Output isn't correct
3 Incorrect 6 ms 5120 KB Output isn't correct
4 Incorrect 7 ms 5120 KB Output isn't correct
5 Incorrect 9 ms 5120 KB Output isn't correct
6 Incorrect 8 ms 5120 KB Output isn't correct
7 Incorrect 8 ms 4992 KB Output isn't correct
8 Incorrect 7 ms 4992 KB Output isn't correct
9 Incorrect 6 ms 5120 KB Output isn't correct
10 Incorrect 7 ms 5120 KB Output isn't correct
11 Incorrect 9 ms 5120 KB Output isn't correct
12 Incorrect 7 ms 4992 KB Output isn't correct
13 Incorrect 6 ms 5120 KB Output isn't correct
14 Incorrect 9 ms 5120 KB Output isn't correct
15 Incorrect 6 ms 5120 KB Output isn't correct
16 Incorrect 6 ms 5120 KB Output isn't correct
17 Incorrect 7 ms 5120 KB Output isn't correct
18 Incorrect 6 ms 5120 KB Output isn't correct

Subtask #3
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Incorrect 7 ms 5120 KB Output isn't correct
3 Incorrect 7 ms 5120 KB Output isn't correct
4 Incorrect 7 ms 5120 KB Output isn't correct
5 Incorrect 6 ms 5120 KB Output isn't correct
6 Incorrect 6 ms 4992 KB Output isn't correct
7 Incorrect 6 ms 5132 KB Output isn't correct
8 Incorrect 6 ms 5120 KB Output isn't correct
9 Incorrect 6 ms 5120 KB Output isn't correct
10 Incorrect 5 ms 4992 KB Output isn't correct
11 Incorrect 5 ms 4992 KB Output isn't correct
12 Incorrect 7 ms 5120 KB Output isn't correct
13 Incorrect 7 ms 5120 KB Output isn't correct
14 Incorrect 6 ms 4992 KB Output isn't correct
15 Incorrect 6 ms 5120 KB Output isn't correct
16 Incorrect 6 ms 4992 KB Output isn't correct
17 Incorrect 6 ms 4992 KB Output isn't correct
18 Incorrect 7 ms 4992 KB Output isn't correct
19 Incorrect 6 ms 4992 KB Output isn't correct
20 Incorrect 7 ms 5120 KB Output isn't correct