# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168231 | abil | Monkey and Apple-trees (IZhO12_apple) | C++14 | 483 ms | 159772 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 fr first
#define sc second
#define pb push_bacak
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long
using namespace std;
const int N = (1e6 + 12);
const int n = (1e9);
const int INF = (0x3f3f3f3f);
struct node{
int sum, val, l, r;
node(){
sum = val = l = r = 0;
}
};
node t[N * 10];
int cnt = 1;
void push(int v,int l,int r){
if(!t[v].l){
t[v].l = ++cnt;
}
if(!t[v].r){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |