Submission #43408

# Submission time Handle Problem Language Result Execution time Memory
43408 2018-03-15T20:37:39 Z XmtosX 007 (CEOI14_007) C++14
0 / 100
613 ms 18948 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]+=2;
    lvl[b][1]+=2;
    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++)
                   ^
# Verdict Execution time Memory Grader output
1 Correct 7 ms 7288 KB Output is correct
2 Incorrect 7 ms 7392 KB Output isn't correct
3 Partially correct 7 ms 7464 KB Partially correct
4 Correct 6 ms 7536 KB Output is correct
5 Partially correct 7 ms 7552 KB Partially correct
6 Correct 6 ms 7552 KB Output is correct
7 Partially correct 7 ms 7588 KB Partially correct
8 Partially correct 7 ms 7588 KB Partially correct
9 Partially correct 7 ms 7588 KB Partially correct
10 Partially correct 9 ms 7588 KB Partially correct
11 Incorrect 7 ms 7588 KB Output isn't correct
12 Correct 7 ms 7588 KB Output is correct
13 Partially correct 7 ms 7588 KB Partially correct
14 Incorrect 7 ms 7588 KB Output isn't correct
15 Correct 7 ms 7644 KB Output is correct
16 Partially correct 8 ms 7756 KB Partially correct
17 Correct 10 ms 7756 KB Output is correct
18 Partially correct 10 ms 7756 KB Partially correct
19 Incorrect 7 ms 7756 KB Output isn't correct
20 Partially correct 9 ms 7756 KB Partially correct
21 Incorrect 7 ms 7756 KB Output isn't correct
22 Correct 7 ms 7756 KB Output is correct
23 Correct 7 ms 7756 KB Output is correct
24 Partially correct 8 ms 7756 KB Partially correct
# Verdict Execution time Memory Grader output
1 Partially correct 46 ms 9196 KB Partially correct
2 Correct 63 ms 9868 KB Output is correct
3 Partially correct 50 ms 9868 KB Partially correct
4 Correct 65 ms 10068 KB Output is correct
5 Incorrect 46 ms 10068 KB Output isn't correct
6 Incorrect 49 ms 10068 KB Output isn't correct
7 Correct 56 ms 10068 KB Output is correct
8 Correct 53 ms 10068 KB Output is correct
9 Partially correct 89 ms 10068 KB Partially correct
10 Incorrect 381 ms 14352 KB Output isn't correct
11 Correct 98 ms 14352 KB Output is correct
12 Partially correct 134 ms 14352 KB Partially correct
13 Partially correct 117 ms 14352 KB Partially correct
14 Correct 91 ms 14352 KB Output is correct
15 Partially correct 134 ms 14352 KB Partially correct
16 Incorrect 139 ms 14352 KB Output isn't correct
17 Correct 118 ms 14352 KB Output is correct
18 Incorrect 118 ms 14352 KB Output isn't correct
19 Incorrect 214 ms 14352 KB Output isn't correct
20 Partially correct 431 ms 16096 KB Partially correct
21 Correct 179 ms 16096 KB Output is correct
22 Partially correct 189 ms 16096 KB Partially correct
23 Partially correct 174 ms 16096 KB Partially correct
24 Partially correct 180 ms 16096 KB Partially correct
25 Correct 171 ms 16096 KB Output is correct
26 Partially correct 168 ms 16096 KB Partially correct
27 Correct 179 ms 16096 KB Output is correct
28 Correct 215 ms 16096 KB Output is correct
29 Incorrect 301 ms 16096 KB Output isn't correct
30 Partially correct 501 ms 16692 KB Partially correct
31 Correct 208 ms 16692 KB Output is correct
32 Partially correct 187 ms 16692 KB Partially correct
33 Partially correct 191 ms 16692 KB Partially correct
34 Correct 211 ms 16692 KB Output is correct
35 Partially correct 188 ms 16692 KB Partially correct
36 Partially correct 190 ms 16692 KB Partially correct
37 Incorrect 218 ms 16692 KB Output isn't correct
38 Correct 224 ms 16692 KB Output is correct
39 Correct 239 ms 16692 KB Output is correct
40 Partially correct 395 ms 16836 KB Partially correct
41 Incorrect 613 ms 18948 KB Output isn't correct