oj.uz

Submission #382231

# Submission time Handle Problem Language Result Execution time Memory
382231 2021-03-26T19:03:45 Z AmineWeslati Wall (IOI14_wall) C++14
100 / 100
 941 ms 89324 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 2e9;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

const int mxQ=5e5+10,mxN=2e6+10;

#ifndef LOCAL
#include "wall.h"
#endif

int N,Q; 
vpi t(mxN*4,{-INF,INF});

pi add(pi a, int op, int h){
	if(op==1){
		ckmax(a.fi,h);
		if(h>a.se) a.se=h; 
	}
	else{
		ckmin(a.se,h);
		if(h<a.fi) a.fi=h;
	}
	return a;
}

void push_down(int pos){
	if(t[pos].fi==-INF && t[pos].se==INF) return;
	t[pos*2]=add(t[pos*2],1,t[pos].fi);
	t[pos*2]=add(t[pos*2],2,t[pos].se);
	t[pos*2+1]=add(t[pos*2+1],1,t[pos].fi);
	t[pos*2+1]=add(t[pos*2+1],2,t[pos].se);
	t[pos]={-INF,INF};
}

void upd(int op, int l, int r, int h, int pos=1, int tl=0, int tr=N-1){
	if(l>r) return;

	if(l==tl && r==tr){
		t[pos]=add(t[pos],op,h);
		return;
	}

	push_down(pos);

	int tm=(tl+tr)/2;
	upd(op,l,min(r,tm),h,pos*2,tl,tm);
	upd(op,max(l,tm+1),r,h,pos*2+1,tm+1,tr);
}


int get(int idx, int pos=1, int tl=0, int tr=N-1){
	if(tl==tr){
		return min(t[pos].fi,t[pos].se);
	}

	push_down(pos);

	int tm=(tl+tr)/2;
	if(idx<=tm) return get(idx,pos*2,tl,tm);
	return get(idx,pos*2+1,tm+1,tr);
}

void buildWall(int N, int Q, int op[], int L[], int R[], int H[], int fH[]){
	::N=N; ::Q=Q;
	
	t[1]={0,0};

	FOR(i,0,Q){
		upd(op[i],L[i],R[i],H[i]);
	}
	FOR(i,0,N){
		fH[i]=get(i);
	}
	//FOR(i,0,N) cout << fH[i] << " "; cout << endl;

	return;
}


#ifdef LOCAL
int main() {
    boost; IO();

    int N,Q; cin>>N>>Q;
    int op[Q],l[Q],r[Q],h[Q],fH[N];
    FOR(i,0,Q) cin>>op[i]>>l[i]>>r[i]>>h[i];
    buildWall(N,Q,op,l,r,h,fH);
    
    

    return 0;
}
#endif
//Change your approach

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 62956 KB Output is correct
2 Correct 41 ms 62956 KB Output is correct
3 Correct 42 ms 62956 KB Output is correct
4 Correct 52 ms 63084 KB Output is correct
5 Correct 45 ms 63084 KB Output is correct
6 Correct 45 ms 63084 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 62956 KB Output is correct
2 Correct 199 ms 70764 KB Output is correct
3 Correct 254 ms 66380 KB Output is correct
4 Correct 635 ms 71584 KB Output is correct
5 Correct 359 ms 71916 KB Output is correct
6 Correct 375 ms 72044 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62956 KB Output is correct
2 Correct 39 ms 62956 KB Output is correct
3 Correct 39 ms 62956 KB Output is correct
4 Correct 51 ms 63084 KB Output is correct
5 Correct 60 ms 63212 KB Output is correct
6 Correct 43 ms 63232 KB Output is correct
7 Correct 46 ms 62956 KB Output is correct
8 Correct 212 ms 70820 KB Output is correct
9 Correct 241 ms 66284 KB Output is correct
10 Correct 630 ms 71404 KB Output is correct
11 Correct 341 ms 71864 KB Output is correct
12 Correct 328 ms 71916 KB Output is correct
13 Correct 43 ms 62956 KB Output is correct
14 Correct 204 ms 70776 KB Output is correct
15 Correct 72 ms 63596 KB Output is correct
16 Correct 665 ms 71624 KB Output is correct
17 Correct 342 ms 71660 KB Output is correct
18 Correct 339 ms 71660 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 62956 KB Output is correct
2 Correct 42 ms 62956 KB Output is correct
3 Correct 41 ms 62956 KB Output is correct
4 Correct 46 ms 63084 KB Output is correct
5 Correct 45 ms 63084 KB Output is correct
6 Correct 46 ms 63084 KB Output is correct
7 Correct 47 ms 62916 KB Output is correct
8 Correct 208 ms 70764 KB Output is correct
9 Correct 224 ms 66284 KB Output is correct
10 Correct 589 ms 71404 KB Output is correct
11 Correct 335 ms 71896 KB Output is correct
12 Correct 329 ms 71916 KB Output is correct
13 Correct 41 ms 62956 KB Output is correct
14 Correct 201 ms 70892 KB Output is correct
15 Correct 72 ms 63596 KB Output is correct
16 Correct 571 ms 71660 KB Output is correct
17 Correct 369 ms 71660 KB Output is correct
18 Correct 331 ms 71660 KB Output is correct
19 Correct 941 ms 89020 KB Output is correct
20 Correct 929 ms 86624 KB Output is correct
21 Correct 938 ms 89068 KB Output is correct
22 Correct 930 ms 86764 KB Output is correct
23 Correct 929 ms 86892 KB Output is correct
24 Correct 927 ms 86892 KB Output is correct
25 Correct 926 ms 86636 KB Output is correct
26 Correct 932 ms 89324 KB Output is correct
27 Correct 928 ms 89196 KB Output is correct
28 Correct 928 ms 86820 KB Output is correct
29 Correct 928 ms 86764 KB Output is correct
30 Correct 922 ms 86764 KB Output is correct