# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
645964 | beaconmc | Wall (IOI14_wall) | C++14 | 596 ms | 67268 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 <iostream>
typedef int ll;
using namespace std;
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
ll lazy[4194304][2];
ll N = 2097152;
ll ans[2097152];
void prop(ll pos, ll mini, ll maxi){
if (maxi>= lazy[pos][0]){
lazy[pos][0] = maxi;
lazy[pos][1] = maxi;
}else{
lazy[pos][1] = max(maxi, lazy[pos][1]);
}
if (mini<= lazy[pos][1]){
lazy[pos][0] = mini;
lazy[pos][1] = mini;
}else{
lazy[pos][0] = min(mini, lazy[pos][0]);
# | 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... |