# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43411 | XmtosX | 007 (CEOI14_007) | C++14 | 567 ms | 18888 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |