# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
607493 | Pietra | Global Warming (CEOI18_glo) | C++14 | 2070 ms | 9608 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 int long long
#define esq (2*no)
#define dir ((2*no)+1)
#define meio ((i+j)>>1)
using namespace std ;
const int maxn = 2e5 + 5 ;
int n, x, v[maxn], tree[4*maxn] ;
vector<int> vec ;
struct SEG{
void build(int no, int i, int j){
if(i == j){
tree[no] = 0 ; return ;
}
build(esq, i, meio), build(dir, meio + 1, j) ;
tree[no] = 0 ;
}
int query(int no, int i, int j, int l, int r){
if(l > j || r < i) return 0 ;
if(r >= j && l <= i) return tree[no] ;
return max(query(esq, i, meio, l, r), query(dir, meio + 1, j, l, r)) ;
}
void upd(int no, int i, int j, int pos, int val){
if(i == j){
# | 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... |