# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487246 | ala2 | Rainforest Jumps (APIO21_jumps) | C++14 | 276 ms | 39552 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 "jumps.h"
#include <vector>
#include <queue>
using namespace std;
int n; vector<int>h; vector<int>v[10100]; int vi[2100][2100]; int d[2010][2010]; int g[1000100];
queue<int>q; int mn=1000000023;
void bfs(int node)
{
vi[node][node]=1;
q.push(node);
while(!q.empty()){
int u=q.front();
q.pop();// cout<<" "<<u<<endl;
d[node][node]=0;
for(int i=0;i<v[u].size();i++)
{
if(!vi[node][v[u][i]]){
q.push(v[u][i]);
d[node][v[u][i]]=d[node][u]+1;
vi[node][v[u][i]]=1;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |