oj.uz

답안 #613899

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

using namespace std;
typedef long long ll;
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]+1,dist[1][s]+1))
                    good=1;
            }
            if(dist[2][i]>=dist[2][s])
            {
                if(dist[1][i]+1>=min(dist[1][s]+1,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 3 ms 4948 KB Output is correct
2 Partially correct 3 ms 4948 KB Partially correct
3 Partially correct 3 ms 4948 KB Partially correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Partially correct 3 ms 4948 KB Partially correct
8 Correct 3 ms 4948 KB Output is correct
9 Partially correct 3 ms 4948 KB Partially correct
10 Correct 4 ms 4968 KB Output is correct
11 Partially correct 3 ms 5064 KB Partially correct
12 Correct 3 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 Partially correct 3 ms 4948 KB Partially correct
16 Correct 3 ms 4948 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 5076 KB Partially correct
21 Correct 2 ms 5076 KB Output is 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 6956 KB Partially correct
2 Correct 25 ms 7840 KB Output is correct
3 Partially correct 28 ms 7056 KB Partially correct
4 Correct 34 ms 7824 KB Output is correct
5 Correct 20 ms 6868 KB Output is correct
6 Correct 22 ms 7124 KB Output is correct
7 Partially correct 24 ms 7288 KB Partially correct
8 Partially correct 23 ms 7252 KB Partially correct
9 Correct 32 ms 7692 KB Output is correct
10 Partially correct 113 ms 12088 KB Partially correct
11 Correct 53 ms 9300 KB Output is correct
12 Partially correct 70 ms 10304 KB Partially correct
13 Correct 58 ms 9548 KB Output is correct
14 Correct 46 ms 8792 KB Output is correct
15 Partially correct 61 ms 10460 KB Partially correct
16 Correct 69 ms 10728 KB Output is correct
17 Partially correct 75 ms 10080 KB Partially correct
18 Correct 74 ms 10120 KB Output is correct
19 Partially correct 96 ms 11336 KB Partially correct
20 Correct 155 ms 14208 KB Output is correct
21 Correct 104 ms 12604 KB Output is correct
22 Partially correct 96 ms 11488 KB Partially correct
23 Partially correct 97 ms 12504 KB Partially correct
24 Partially correct 86 ms 12364 KB Partially correct
25 Correct 102 ms 11916 KB Output is correct
26 Partially correct 83 ms 11540 KB Partially correct
27 Partially correct 113 ms 12564 KB Partially correct
28 Partially correct 123 ms 12576 KB Partially correct
29 Partially correct 131 ms 13008 KB Partially correct
30 Correct 168 ms 14972 KB Output is correct
31 Correct 115 ms 13588 KB Output is correct
32 Partially correct 123 ms 12488 KB Partially correct
33 Partially correct 98 ms 12736 KB Partially correct
34 Correct 116 ms 13028 KB Output is correct
35 Correct 103 ms 12800 KB Output is correct
36 Correct 122 ms 13000 KB Output is correct
37 Correct 174 ms 14252 KB Output is correct
38 Partially correct 130 ms 13944 KB Partially correct
39 Partially correct 140 ms 13976 KB Partially correct
40 Correct 214 ms 15496 KB Output is correct
41 Partially correct 236 ms 17600 KB Partially correct