# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426949 | snasibov05 | RMQ (NOI17_rmq) | C++14 | 142 ms | 12996 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 <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cassert>
using namespace std;
#define oo 1000000000
#define pb push_back
#define pii pair<int, int>
#define f first
#define s second
struct range{
int l, r;
int val;
bool operator<(range r1) const{
return val < r1.val;
}
};
struct SegmentTree{
vector<int> t;
vector<int> lazy;
SegmentTree(int n){
t.resize(n * 4 + 5);
t.assign(n * 4 + 5, -1);
lazy.resize(n * 4 + 5);
lazy.assign(n * 4 + 5, -1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |