| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 740627 | asdf412 | Monkey and Apple-trees (IZhO12_apple) | C++14 | 1 ms | 340 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 ll long long
#define ii pair<ll, ll>
#define tp tuple<ll, ll, ll>
#define F first
#define S second
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define eb emplace_back
using namespace std;
const int n = 1e9;
int m;
struct Node
{
int id;
ll val, lazy, idl, idr;
Node(int v, int i, int l, int r)
{
val = v;
id = i;
idl = l;
idr = r;
lazy = 0;
};
};
vector<Node> seg;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||