# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258226 | Haunted_Cpp | Monkey and Apple-trees (IZhO12_apple) | C++17 | 323 ms | 59384 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 <iostream>
#include <vector>
#include <cstring>
#include <cassert>
#include <bitset>
#include <iomanip>
#include <algorithm>
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int N = 1e9;
struct Node {
Node *l, *r;
int sum;
bool lazy_left;
bool lazy_right;
Node () {
l = r = nullptr;
sum = 0;
lazy_left = lazy_right = false;
}
};
Node *root;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |