# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362620 | ngpin04 | Wall (IOI14_wall) | C++14 | 1557 ms | 69612 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>
#include "wall.h"
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 2e6 + 5;
pair <int, int> st[4 * N];
int ans[N];
int op[N];
int l[N];
int r[N];
int h[N];
int n,k;
void dolazy(int id)
{
for (int i = (id << 1); i <= (id << 1 | 1); i++)
{
st[i].fi = max(st[i].fi, st[id].fi);
st[i].se = min(st[i].se, st[id].se);
if (st[i].fi > st[i].se)
{
if (st[i].fi == st[id].fi)
st[i].se = st[i].fi;
# | 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... |