# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920627 | danikoynov | 무지개나라 (APIO17_rainbow) | C++14 | 931 ms | 423508 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 "rainbow.h"
#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int maxn = 2e5 + 10;
struct node
{
int lc, rc, sum;
node()
{
lc = rc = -1;
sum = 0;
}
};
struct persistent_segment_tree
{
node tree[30 * maxn];
int roots[maxn], last_used;
vector < int > data[maxn];
int update(int root, int left, int right, int pos, int val)
{
int new_node = ++ last_used;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |