# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487806 | Redhood | New Home (APIO18_new_home) | C++14 | 2464 ms | 336748 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 fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) (int)(x).size()
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = (int)1.5e6 + 10;
const int inf = 1e9;
struct seg{
int a[4*N];
int p[4*N];
void clr(int x = inf){
fill(a , a + 4 * N , x);
fill(p , p + 4 * N , x);
}
void push(int v){
int v1 = v << 1;
for(auto u : {v1 , v1|1}){
a[u] = min(a[u] , p[v]);
p[u] = min(p[u] , p[v]);
}
p[v] = inf;
}
int get(int v , int tl , int tr , int l , int r){
if(tl == l && tr == r){
# | 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... |