# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90661 | 314rate | 007 (CEOI14_007) | C++14 | 531 ms | 16764 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;
typedef long long ll;
typedef long double ld;
const int N=200000+5;
int n,m;
int s,d,a,b;
vector<int>g[N];
int di[2][N];
void build(int k,int go)
{
for(int i=1;i<=n;i++)
{
di[k][i]=-1;
}
di[k][go]=0;
queue<int>q;
q.push(go);
while(!q.empty())
{
int nod=q.front();
q.pop();
for(auto &nou:g[nod])
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |