# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55101 | spencercompton | Long Mansion (JOI17_long_mansion) | C++17 | 2698 ms | 263168 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;
class Node{
public:
int s, e, maxi;
Node *l, *r;
Node (int st, int en){
l = NULL;
r = NULL;
s = st;
e = en;
if(s!=e){
l = new Node(s,(s+e)/2);
r = new Node((s+e)/2+1,e);
}
maxi = 0;
}
int first (int bound){
if(s==e){
if(maxi>bound){
return s;
}
return 99999999;
}
if(l->maxi >bound){
return l->first(bound);
}
return r->first(bound);
}
int getmaxi(int st, int en){
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... |