Submission #725690

#	Time	Username	Problem	Language	Result	Execution time	Memory
725690		shadow_sami	Wall (IOI14_wall)	C++17	0 / 100	1 ms	296 KiB

wall

#include<bits/stdc++.h>
#include "wall.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;

typedef struct SEGMENT_TREE{
	vi arr;
	ll range;
	void init(ll k){
		range = log2(k);
		range = 1 << (range + 3);
		arr.resize(range,0);
		return;
	}
	void update(ll ptr,ll l,ll r,ll st,ll en,ll val){
		if(arr[ptr]!=0){
			if(l!=r){
				arr[2*ptr] = max(arr[2*ptr],arr[ptr]);
				arr[2*ptr+1] = max(arr[2*ptr+1],arr[ptr]);
				arr[ptr] = 0;
			}
		}
		if(l>en || r<st){
			return;
		}
		if(l>=st && r<=en){
			if(l==r){
				arr[ptr] = max(arr[ptr],val);
			}else{
				arr[2*ptr] = max(arr[2*ptr],val);
				arr[2*ptr+1] = max(arr[2*ptr+1],val);
			}
			return;
		}
		ll mid = l + (r-l) / 2;
		update(2*ptr,l,mid,st,en,val);
		update(2*ptr+1,mid+1,r,st,en,val);
		return;
	}
	ll query(ll ptr,ll l,ll r,ll pos){
		if(l!=r){
				arr[2*ptr] = max(arr[2*ptr],arr[ptr]);
				arr[2*ptr+1] = max(arr[2*ptr+1],arr[ptr]);
				arr[ptr] = 0;
			}
		if(l>pos || r<pos)
			return 0;
		if(l==r && r==pos)
			return arr[ptr];
		ll mid = l + (r-l) / 2;
		return (query(2*ptr,l,mid,pos) + query(2*ptr+1,mid+1,r,pos));
	}
}SGT;

SGT sgt;

typedef struct SEGMENT_TREE2{
	vi arr;
	ll range;
	void init(ll k){
		range = log2(k);
		range = 1 << (range + 3);
		arr.resize(range,1e9);
		return;
	}
	void construct(ll ptr,ll l,ll r,int finalHeight[]){
		if(l==r){
			arr[ptr] = finalHeight[l];
			return;
		}
		ll mid = l + (r-l) / 2;
		construct(2*ptr,l,mid,finalHeight);
		construct(2*ptr+1,mid+1,r,finalHeight);
	}
	void update(ll ptr,ll l,ll r,ll st,ll en,ll val){
		if(arr[ptr]!=0){
			if(l!=r){
				arr[2*ptr] = min(arr[2*ptr],arr[ptr]);
				arr[2*ptr+1] = min(arr[2*ptr+1],arr[ptr]);
				arr[ptr] = 0;
			}
		}
		if(l>en || r<st){
			return;
		}
		if(l>=st && r<=en){
			if(l==r){
				arr[ptr] = min(arr[ptr],val);
			}else{
				arr[2*ptr] = min(arr[2*ptr],val);
				arr[2*ptr+1] = min(arr[2*ptr+1],val);
			}
			return;
		}
		ll mid = l + (r-l) / 2;
		update(2*ptr,l,mid,st,en,val);
		update(2*ptr+1,mid+1,r,st,en,val);
		return;
	}
	ll query(ll ptr,ll l,ll r,ll pos){
		if(arr[ptr]!=0){
			if(l!=r){
				arr[2*ptr] = min(arr[2*ptr],arr[ptr]);
				arr[2*ptr+1] = min(arr[2*ptr+1],arr[ptr]);
				arr[ptr] = 0;
			}
		}
		if(l>pos || r<pos)
			return 0;
		if(l==r && r==pos)
			return arr[ptr];
		ll mid = l + (r-l) / 2;
		return (query(2*ptr,l,mid,pos) + query(2*ptr+1,mid+1,r,pos));
	}
}SGT2;

SGT2 sgt2;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	sgt.init(n);
	cnt = 0;
	fip(0,k){
		if(op[i]==2)
			break;
		sgt.update(1,0,n-1,left[i],right[i],height[i]);
		cnt++;
	}
	fip(0,n)
		finalHeight[i] = sgt.query(1,0,n-1,i);
	fip(0,n)
       	cout<<finalHeight[i]<<" ";
    cout<<nli;
	sgt2.init(n);
	sgt2.construct(1,0,n-1,finalHeight);
	fip(cnt,k){
		sgt2.update(1,0,n-1,left[i],right[i],height[i]);
	}
	fip(0,n)
		finalHeight[i] = sgt2.query(1,0,n-1,i);
	fip(0,n)
       	cout<<finalHeight[i]<<" ";
    cout<<nli;
  	return;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         cin>>n>>m;
//         int op[m],left[m],right[m],height[m],finalHeight[n];
//         fip(0,m)
//         	cin>>op[i]>>left[i]>>right[i]>>height[i];
//         buildWall(n,m,op,left,right,height,finalHeight);
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

• Subtask 1: 0 / 8
• Subtask 2: 0 / 24
• Subtask 3: 0 / 29
• Subtask 4: 0 / 39