# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901913 | Muhammad_Aneeq | Wall (IOI14_wall) | C++17 | 482 ms | 33248 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 <iostream>
#include <algorithm>
#include "wall.h"
using namespace std;
struct seg
{
int mi=0,ma=0,lazy=0;
int ty=-1;
};
int const MAXN=1e5;
seg St[4*MAXN];
void push(int i)
{
St[i*2].lazy=St[i*2+1].lazy=St[i].lazy;
St[i*2].ty=St[i*2+1].ty=St[i].ty;
St[i*2].mi=St[i*2+1].mi=St[i].lazy;
St[i*2].ma=St[i*2+1].ma=St[i].lazy;
St[i].ty=-1;
}
void add(int i,int st,int en,int l,int r,int val)
{
if (st>r||en<l)
return;
if (st>=l&&en<=r)
{
if (St[i].mi>=val)
return;
if (St[i].ma<=val)
{
St[i].mi=St[i].ma=val;
# | 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... |