# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516616 | status_coding | Wall (IOI14_wall) | C++14 | 601 ms | 123980 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 "wall.h"
#include <bits/stdc++.h>
using namespace std;
struct segS
{
pair<int, int> val= {0, 1e9};
bool lazy = false;
};
vector<segS> seg;
void calc(int p, pair<int, int> val)
{
if(val.first > seg[p].val.second)
seg[p].val = {val.first, val.first};
else if(val.second < seg[p].val.first)
seg[p].val = {val.second, val.second};
else
{
seg[p].val.first = max(seg[p].val.first, val.first);
seg[p].val.second = min(seg[p].val.second, val.second);
}
seg[p].lazy = true;
}
# | 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... |