# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824472 | Hanksburger | Rainforest Jumps (APIO21_jumps) | C++17 | 4061 ms | 15644 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 <bits/stdc++.h>
using namespace std;
int seg[800005], dist[200005], n;
vector<int> adj[200005];
queue<int> q;
void build(int i, int l, int r)
{
if (l==r)
{
seg[i]=-1;
return;
}
int mid=(l+r)/2;
build(i*2, l, mid);
build(i*2+1, mid+1, r);
seg[i]=-1;
}
void build2(int i, int l, int r)
{
if (l==r)
{
seg[i]=1e9;
return;
}
int mid=(l+r)/2;
build2(i*2, l, mid);
build2(i*2+1, mid+1, r);
seg[i]=1e9;
}
# | 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... |