답안 #43405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
43405 2018-03-15T20:32:23 Z XmtosX 007 (CEOI14_007) C++14
3 / 100
588 ms 18928 KB
#include <bits/stdc++.h>
using namespace std;
int n,m,st1,st2,a,b;
vector <int> v[300005];
int lvl[300005][2];
void bs (int x,int y)
{
    queue<int> q;
    lvl[x][y]=1;
    q.push(x);
    while (!q.empty())
    {
        int node=q.front();
        q.pop();
        for (int i=0;i<v[node].size();i++)
        {
            if (!lvl[v[node][i]][y])
            {
                lvl[v[node][i]][y]=lvl[node][y]+1;
                q.push(v[node][i]);
            }
        }
    }
}
int main()
{
    cin >>n>>m>>st1>>st2>>a>>b;
    for (int i=0;i<m;i++)
    {
        int x,y;
        cin >>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    bs(st1,1);
    bs(st2,0);
    vector <int> v1;
    for (int i=0;i<v[a].size();i++)
    {
        if (v[a][i]!=b&&lvl[v[a][i]][0]<lvl[a][0])
            v1.push_back(v[a][i]);
    }
    for (int i=0;i<v[b].size();i++)
    {
        if (v[b][i]!=a&&lvl[v[b][i]][0]<lvl[b][0])
            v1.push_back(v[b][i]);
    }
    int ans=-1;
    for (int i=0;i<v1.size();i++)
    {
        ans=max(ans,lvl[v1[i]][0]-lvl[v1[i]][1]);
    }
    lvl[a][1]++;
    lvl[b][1]++;
    ans=max(ans,lvl[a][0]-lvl[a][1]);
    ans=max(ans,lvl[b][0]-lvl[b][1]);
    cout <<ans;
    return 0;
}

Compilation message

007.cpp: In function 'void bs(int, int)':
007.cpp:15:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<v[node].size();i++)
                       ^
007.cpp: In function 'int main()':
007.cpp:38:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v[a].size();i++)
                   ^
007.cpp:43:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v[b].size();i++)
                   ^
007.cpp:49:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v1.size();i++)
                   ^
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7288 KB Output is correct
2 Partially correct 7 ms 7392 KB Partially correct
3 Partially correct 6 ms 7464 KB Partially correct
4 Correct 8 ms 7536 KB Output is correct
5 Correct 7 ms 7552 KB Output is correct
6 Correct 7 ms 7552 KB Output is correct
7 Partially correct 8 ms 7588 KB Partially correct
8 Correct 7 ms 7640 KB Output is correct
9 Partially correct 7 ms 7640 KB Partially correct
10 Correct 7 ms 7748 KB Output is correct
11 Incorrect 7 ms 7748 KB Output isn't correct
12 Correct 7 ms 7748 KB Output is correct
13 Partially correct 7 ms 7748 KB Partially correct
14 Incorrect 7 ms 7748 KB Output isn't correct
15 Correct 7 ms 7748 KB Output is correct
16 Correct 7 ms 7772 KB Output is correct
17 Correct 7 ms 7772 KB Output is correct
18 Correct 7 ms 7772 KB Output is correct
19 Partially correct 7 ms 7772 KB Partially correct
20 Partially correct 7 ms 7772 KB Partially correct
21 Incorrect 7 ms 7772 KB Output isn't correct
22 Correct 8 ms 7772 KB Output is correct
23 Correct 7 ms 7772 KB Output is correct
24 Correct 8 ms 7772 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 46 ms 9200 KB Partially correct
2 Correct 63 ms 9964 KB Output is correct
3 Partially correct 51 ms 9964 KB Partially correct
4 Correct 64 ms 9964 KB Output is correct
5 Incorrect 50 ms 9964 KB Output isn't correct
6 Incorrect 48 ms 9964 KB Output isn't correct
7 Correct 75 ms 9964 KB Output is correct
8 Correct 55 ms 9964 KB Output is correct
9 Correct 87 ms 9964 KB Output is correct
10 Partially correct 360 ms 14316 KB Partially correct
11 Correct 96 ms 14316 KB Output is correct
12 Partially correct 135 ms 14316 KB Partially correct
13 Correct 134 ms 14316 KB Output is correct
14 Correct 96 ms 14316 KB Output is correct
15 Partially correct 122 ms 14316 KB Partially correct
16 Incorrect 134 ms 14316 KB Output isn't correct
17 Correct 116 ms 14316 KB Output is correct
18 Incorrect 143 ms 14316 KB Output isn't correct
19 Partially correct 227 ms 14316 KB Partially correct
20 Correct 431 ms 16064 KB Output is correct
21 Correct 178 ms 16064 KB Output is correct
22 Partially correct 162 ms 16064 KB Partially correct
23 Partially correct 178 ms 16064 KB Partially correct
24 Partially correct 182 ms 16064 KB Partially correct
25 Correct 192 ms 16064 KB Output is correct
26 Partially correct 160 ms 16064 KB Partially correct
27 Correct 184 ms 16064 KB Output is correct
28 Correct 196 ms 16064 KB Output is correct
29 Partially correct 279 ms 16064 KB Partially correct
30 Correct 483 ms 16620 KB Output is correct
31 Correct 202 ms 16620 KB Output is correct
32 Partially correct 192 ms 16620 KB Partially correct
33 Partially correct 184 ms 16620 KB Partially correct
34 Correct 204 ms 16620 KB Output is correct
35 Correct 177 ms 16620 KB Output is correct
36 Correct 190 ms 16620 KB Output is correct
37 Incorrect 230 ms 16620 KB Output isn't correct
38 Correct 216 ms 16620 KB Output is correct
39 Correct 236 ms 16620 KB Output is correct
40 Correct 385 ms 16772 KB Output is correct
41 Partially correct 588 ms 18928 KB Partially correct