oj.uz

답안 #613861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613861 2022-07-30T12:11:41 Z andrei_boaca 007 (CEOI14_007) C++14
30 / 100
 220 ms 17540 KB 
#include <bits/stdc++.h>

using namespace std;
int n,m,s,d,a,b;
vector<int> muchii[200005];
int dist[5][200005];
void bfs(int start,int index)
{
    for(int i=1;i<=n;i++)
        dist[index][i]=1e9;
    dist[index][start]=0;
    queue<int> coada;
    coada.push(start);
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for(int i:muchii[nod])
            if(dist[index][i]>dist[index][nod]+1)
            {
                dist[index][i]=dist[index][nod]+1;
                coada.push(i);
            }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>s>>d>>a>>b;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        muchii[x].push_back(y);
        muchii[y].push_back(x);
    }
    bfs(a,1);
    bfs(b,2);
    bfs(d,3);
    bfs(s,4);
    int minim=1e9;
    for(int i=1;i<=n;i++)
    {
        bool good;
        if((dist[1][i]+1>=dist[1][s]&&dist[2][i]>=dist[2][s])||dist[4][i]<=1)
            good=1;
        else
            good=0;
        if(!good)
            minim=min(minim,dist[3][i]-2);
    }
    cout<<max(-1,minim);
    return 0;
}

Subtask #1
9.0 / 30.0

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

Subtask #2
21.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 20 ms 6932 KB Partially correct
2 Correct 26 ms 7732 KB Output is correct
3 Partially correct 20 ms 6988 KB Partially correct
4 Correct 26 ms 7844 KB Output is correct
5 Correct 19 ms 6860 KB Output is correct
6 Correct 19 ms 7048 KB Output is correct
7 Partially correct 23 ms 7360 KB Partially correct
8 Partially correct 26 ms 7252 KB Partially correct
9 Correct 33 ms 7660 KB Output is correct
10 Partially correct 115 ms 12176 KB Partially correct
11 Correct 42 ms 9228 KB Output is correct
12 Partially correct 76 ms 10252 KB Partially correct
13 Correct 58 ms 9548 KB Output is correct
14 Correct 38 ms 8812 KB Output is correct
15 Partially correct 58 ms 10396 KB Partially correct
16 Correct 64 ms 10728 KB Output is correct
17 Partially correct 55 ms 10140 KB Partially correct
18 Correct 66 ms 10160 KB Output is correct
19 Partially correct 90 ms 11296 KB Partially correct
20 Correct 144 ms 14156 KB Output is correct
21 Correct 84 ms 12592 KB Output is correct
22 Partially correct 82 ms 11476 KB Partially correct
23 Partially correct 88 ms 12392 KB Partially correct
24 Partially correct 83 ms 12364 KB Partially correct
25 Correct 86 ms 12032 KB Output is correct
26 Partially correct 75 ms 11648 KB Partially correct
27 Partially correct 92 ms 12444 KB Partially correct
28 Partially correct 108 ms 12464 KB Partially correct
29 Partially correct 112 ms 13004 KB Partially correct
30 Correct 168 ms 14924 KB Output is correct
31 Correct 97 ms 13688 KB Output is correct
32 Partially correct 97 ms 12360 KB Partially correct
33 Partially correct 91 ms 12760 KB Partially correct
34 Correct 115 ms 13064 KB Output is correct
35 Correct 82 ms 12780 KB Output is correct
36 Correct 90 ms 13148 KB Output is correct
37 Correct 121 ms 14144 KB Output is correct
38 Partially correct 122 ms 13900 KB Partially correct
39 Partially correct 137 ms 13904 KB Partially correct
40 Correct 158 ms 15380 KB Output is correct
41 Partially correct 220 ms 17540 KB Partially correct