# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
385597 | patrikpavic2 | Segments (IZhO18_segments) | C++17 | 3358 ms | 13000 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 <cstdio>
#include <vector>
#include <algorithm>
#define PB push_back
using namespace std;
const int N = 2e5 + 500;
const int INF = 0x3f3f3f3f;
const int BUK = 2000;
const int UPD = 2000;
int un[N], n, vel, L[N], R[N], lg2[N];
int br_buk = 0, mi[N], mx[N], q;
int po_L[N], po_R[N], sz[N];
bool cmp_len(int x, int y){
return R[x] - L[x] < R[y] - L[y];
}
bool cmpL(int x, int y){
return L[x] > L[y];
}
bool cmpR(int x, int y){
return R[x] < R[y];
}
int losihL(int *v, int x, int vel){
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... |