# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
656693 | TranGiaHuy1508 | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 480 ms | 262144 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;
void main_program();
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
main_program();
}
// #define int long long
struct MaxImplicitSegtree{
int lb, rb;
MaxImplicitSegtree *leftnode, *rightnode;
int mx;
MaxImplicitSegtree(int L, int R): lb(L), rb(R), leftnode(nullptr), rightnode(nullptr), mx(-1) {}
void extend(){
if (lb == rb) return;
if (leftnode) return;
int mid = (lb + rb) >> 1;
leftnode = new MaxImplicitSegtree(lb, mid);
rightnode = new MaxImplicitSegtree(mid+1, rb);
}
int get(int l, int r){
if (l <= lb && rb <= r) return mx;
if (lb > r || rb < l) return -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... |