# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
805202 | vjudge1 | Index (COCI21_index) | C++17 | 1274 ms | 56144 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;
const int maxn=2e5+5;
int n, q, cnt=1, mx=0;
int ver[maxn];
struct T
{
int x, no;
} a[maxn];
struct Node
{
int l, r, v;
Node() {};
Node(int x, int y, int z)
{
l=x; r=y; v=z;
}
} d[22*maxn];
bool lf(const T& i, const T& j)
{
return i.x>j.x;
}
void build(int i, int l, int r)
{
if (l==r) return;
d[i].l=++cnt; d[i].r=++cnt;
int mid=(l+r)/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |