# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920421 | NotLinux | Meteors (POI11_met) | C++17 | 0 ms | 0 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 7;
struct SEGT{
vector < long long > t;
int tree_size;
const int identity_element = 0;
long long merge(long long x , long long y){
return min(inf , x + y);
}
void init(int x){
tree_size = x+3;
t.assign(2*tree_size , identity_element);
}
void modify(int p, int value) { // set value at position p
for (t[p += tree_size] += value; p > 1; p >>= 1){
t[p>>1] = merge(t[p] , t[p^1]);
}
}
int _query(int l, int r) { // sum on interval [l, r]
long long res = identity_element;
for (r+=1 , l += tree_size, r += tree_size; l < r; l >>= 1, r >>= 1) {
if (l&1) res = merge(res , t[l++]);
if (r&1) res = merge(res , t[--r]);
}
return res;
}
void rangeupdate(int l , int r , int val){