oj.uz

답안 #613893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613893 2022-07-30T12:31:40 Z andrei_boaca 007 (CEOI14_007) C++14
30 / 100
 219 ms 17616 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[4][i]<=1)
            good=1;
        else
        {
            good=0;
            if(dist[1][i]>=dist[1][s])
            {
                if(dist[2][i]+1>=min(dist[2][s],dist[1][s]+1))
                    good=1;
            }
            if(dist[2][i]>=dist[2][s])
            {
                if(dist[1][i]+1>=min(dist[1][s],dist[2][s]+1))
                    good=1;
            }
        }
        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 3 ms 5040 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Partially correct 3 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 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Partially correct 3 ms 5076 KB Partially correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 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 5052 KB Partially correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 3 ms 5076 KB Output is 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 22 ms 6868 KB Partially correct
2 Correct 27 ms 7812 KB Output is correct
3 Partially correct 24 ms 6996 KB Partially correct
4 Correct 30 ms 7836 KB Output is correct
5 Correct 22 ms 6884 KB Output is correct
6 Correct 25 ms 7112 KB Output is correct
7 Correct 22 ms 7268 KB Output is correct
8 Correct 29 ms 7284 KB Output is correct
9 Correct 32 ms 7644 KB Output is correct
10 Partially correct 112 ms 12092 KB Partially correct
11 Correct 42 ms 9292 KB Output is correct
12 Partially correct 68 ms 10360 KB Partially correct
13 Correct 54 ms 9608 KB Output is correct
14 Correct 47 ms 8908 KB Output is correct
15 Partially correct 74 ms 10356 KB Partially correct
16 Correct 74 ms 10704 KB Output is correct
17 Correct 55 ms 10116 KB Output is correct
18 Correct 62 ms 10116 KB Output is correct
19 Partially correct 95 ms 11464 KB Partially correct
20 Correct 186 ms 14208 KB Output is correct
21 Correct 108 ms 12532 KB Output is correct
22 Partially correct 76 ms 11468 KB Partially correct
23 Partially correct 82 ms 12364 KB Partially correct
24 Partially correct 119 ms 12324 KB Partially correct
25 Correct 94 ms 11988 KB Output is correct
26 Partially correct 83 ms 11536 KB Partially correct
27 Correct 109 ms 12436 KB Output is correct
28 Correct 127 ms 12512 KB Output is correct
29 Partially correct 114 ms 12880 KB Partially correct
30 Correct 170 ms 15092 KB Output is correct
31 Correct 103 ms 13588 KB Output is correct
32 Partially correct 119 ms 12416 KB Partially correct
33 Partially correct 98 ms 12716 KB Partially correct
34 Correct 117 ms 13096 KB Output is correct
35 Correct 100 ms 12804 KB Output is correct
36 Correct 117 ms 13104 KB Output is correct
37 Correct 146 ms 14164 KB Output is correct
38 Correct 131 ms 13896 KB Output is correct
39 Correct 158 ms 13860 KB Output is correct
40 Correct 176 ms 15416 KB Output is correct
41 Partially correct 219 ms 17616 KB Partially correct