| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 471384 | MohamedFaresNebili | 벽 (IOI14_wall) | C++14 | 0 ms | 0 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"
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<long long>;
#define mp make_pair
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin() , (x).end()
const int N = 2*100005;
const long long MOD = 1e9+7;
const long double EPS = 0.000000001;
const double PI = 3.14159265358979323846;
const int nx[4]={1, -1, 0, 0}, ny[4]={0, 0, 1, -1};
long long gcd(int a, int b) { return (b==0?a:gcd(b, a%b)); }
long long lcm(int a, int b) { return a*(b/gcd(a, b)); }
long long fact(int a) { return (a==1?1:a*fact(a-1)); }
int st[4*200005], lazy[4*200005], dlt[4*200005]; bitset<4*200005>add, del;
void prop0(int v, int l, int r) {
if(l==r||!add[v]) return;
st[v*2]=max(st[v*2], lazy[v]);
st[v*2+1]=max(st[v*2+1], lazy[v]);
lazy[v*2]=max(lazy[v*2], lazy[v]);
lazy[v*2]=max(lazy[v*2+1], lazy[v]);
add[v*2]=add[v*2+1]=1; add[v]=0;
}
void prop(int v, int l, int r) {
if(l==r||!del[v]) return;
st[v*2]=min(st[v*2], dlt[v]);
st[v*2+1]=min(st[v*2+1], dlt[v]);
dlt[v*2]=min(dlt[v*2], dlt[v]);
dlt[v*2]=min(dlt[v*2+1], dlt[v]);
del[v*2]=del[v*2+1]=1; del[v]=0;
}
void update0(int v, int l, int r, int lo, int hi, int val) {
prop0(v, l, r); prop(v, l, r);
if(l>hi||r<lo) return;
if(l>=lo&&r<=hi) {
lazy[v]=max(lazy[v], val); add[v]=1;
st[v]=max(st[v], val); prop0(v, l, r);
return;
}
update0(v*2, l, (l+r)/2, lo, hi, val);
update0(v*2+1, (l+r)/2+1, r, lo, hi, val);
}
void update(int v, int l, int r, int lo, int hi, int val) {
prop0(v, l, r); prop(v, l, r);
if(l>hi||r<lo) return;
if(l>=lo&&r<=hi) {
dlt[v]=min(dlt[v], val); del[v]=1;
st[v]=min(st[v], val); prop(v, l, r);
return;
}
update(v*2, l, (l+r)/2, lo, hi, val);
update(v*2+1, (l+r)/2+1, r, lo, hi, val);
}
ll query(int v, int l, int r, int ind) {
prop0(v, l, r); prop(v, l, r);
if(l==r) return st[v];
int mid=(l+r)/2;
if(ind<=mid) return query(v*2, l, mid, ind);
else return query(v*2+1, mid+1, r, ind);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
memset(lazy, INT_MIN, sizeof lazy);
memset(dlt, INT_MAX, sizeof dlt)
for(int l=0;l<k;l++) {
int t=op[l], a=left[l], b=right[l], w=height[l];
if(t==1) update0(1, 0, n-1, a, b, w);
else if(t==2) update(1, 0, n-1, a, b, w);
}
for(int l=0;l<n;l++) finalHeight[l]=query(1, 0, n-1, l);
return;
}