# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758416 | Jarif_Rahman | Cat Exercise (JOI23_ho_t4) | C++17 | 383 ms | 52248 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>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
struct segtree{
int k;
vector<int> v;
segtree(int n){
k = 1;
while(k < n) k*=2;
k*=2;
v.resize(k, -1);
}
void upd(int in, int x){
in+=k/2;
v[in] = x;
in/=2;
while(in > 0){
v[in] = max(v[2*in], v[2*in+1]);
in/=2;
}
}
int get(int l, int r, int nd, int a, int b){
if(b < l || a > r) return -1;
if(a >= l && b <= r) return v[nd];
int c = (a+b)/2;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |