# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31734 | trath | Monkey and Apple-trees (IZhO12_apple) | C++14 | 63 ms | 2016 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;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ieps (int) 1e6
#define eps (int) 1e9
#define pii pair<int,int>
int n , x, y;
struct node{
int soma = 0LL;
struct node *left , *right;
node() : left(NULL) , right(NULL) {}
void pleft(){
if(!left) left = new node();
}
void pright(){
if(!right) right = new node();
}
};
node *st = new node();
void update(int x , int y , node *curr = st , int l = 1 , int r = (int) 1e9){
if(curr->soma == r - l + 1) return;
if(l == x && r == y){
curr->soma = y - x + 1;
return;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |