# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38717 | Talant | Monkey and Apple-trees (IZhO12_apple) | C++14 | 603 ms | 122328 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 OK puts("OK");
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
const int inf = (int)1e9 + 7;
const int N = (int)7e6 + 7e5;
int n;
int type,x,y,c;
int cnt = 1;
struct node {
int l,r,sum,add;
node () {
l = r = add = sum = 0;
}
}t[N];
void push (int v,int tl,int tr) {
if (t[v].add != 0) {
if (!t[v].l)
t[v].l = ++cnt;
if (!t[v].r)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |