# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499838 | aymanrs | Game (IOI13_game) | C++14 | 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.
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b){
if(a == 0 && b == 0) return 0;
return __gcd(a, b);
}
template<typename T>
struct node {
T v;
int l, r;
node<T> *left = nullptr, *right = nullptr;
node(){
l = 0;
r = 1e9-1;
}
node(int L, int R){
l = L;
r = R;
}
};
struct st {
node<long long> root;
st(){
root.v = 0;
}
void upd(node<long long>* i, int ind, long long v){
if(ind < i->l || ind > i->r) return;
if(i->l == i->r) {
i->v = v;
return;