# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
429809 | schse | Handcrafted Gift (IOI20_gift) | C++17 | 710 ms | 19112 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 "gift.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
struct node
{
int val = -1;
};
struct segtree
{
vector<int> tree = vector<int>(1 << 20, -1);
void lazzy(int index)
{
if (tree[index] != -1)
tree[index * 2] = tree[index * 2 + 1] = tree[index];
tree[index] = -1;
}
void updset(int index, int b, int e, int l, int r, int v)
{
if (l <= b && e <= r)
{
tree[index] = v;
return;
}
if (e <= l || r <= b)
Compilation message (stderr)
# | 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... |