# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234572 | pedy4000 | Tenis (COI19_tenis) | C++14 | 292 ms | 7800 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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int N = 1e5 + 5;
int n, q;
int rann[N][3];
int mn[N << 2];
int lf[N << 2];
int lazy[N << 2];
int getRankMin (int v) {
return min({rann[v][0], rann[v][1], rann[v][2]});
}
int getRankMax (int v) {
return max({rann[v][0], rann[v][1], rann[v][2]});
}
void build (int s = 0, int e = n + 1, int id = 1) {
lf[id] = s;
if (e - s == 1)
return ;
int mid = e + s >> 1;
build(s, mid, id << 1);
build(mid, e, id << 1 | 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... |