oj.uz

Submission #244239

# Submission time Handle Problem Language Result Execution time Memory
244239 2020-07-03T09:52:25 Z tleontest1 Wall (IOI14_wall) C++17
8 / 100
 3000 ms 13304 KB 
#include "wall.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< int,int > PII;
 
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const int inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 2000005;
const lo mod = 1000000007;
 
int flag,t,m,tree[li*4],tree1[li*4],lazy1[li*4],tree2[li*4],lazy2[li*4];
int cev;
PII lazy[li];

inline void push1(int node,int start,int end){
	
	//~ if(lazy[node]!=-1){
		
		//~ tree[node]=max(tree[node],lazy[node]);
		//~ if(start==end)cout<<lazy[node]<<" () "<<start<<endl;
		//~ if(start!=end){
			//~ lazy[node*2]=max(lazy[node*2],lazy[node]);
			//~ lazy[node*2+1]=max(lazy[node*2+1],lazy[node]);
		//~ }
		//~ lazy[node]=-1;
	//~ }
	if(lazy1[node]==inf)return ;
	
	tree1[node]=min(tree1[node],lazy1[node]);
	if(start!=end){
		lazy1[node*2]=min(lazy1[node*2],lazy1[node]);
		lazy1[node*2+1]=min(lazy1[node*2+1],lazy1[node]);
		
	}
	lazy1[node]=inf;
	
}
 
inline void update1(int node,int start,int end,int l,int r,int val){
	push1(node,start,end);
	if(start>end || start>r || end<l)return ;
	if(start>=l && end<=r){
		lazy1[node]=min(lazy1[node],val);
		push1(node,start,end);
		return ;
	}
	update1(node*2,start,mid,l,r,val);
	update1(node*2+1,mid+1,end,l,r,val);
	tree1[node]=min(tree1[node*2],tree1[node*2+1]);
}
 
inline int query1(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return inf;
	push1(node,start,end);
	if(start>=l && end<=r)return tree1[node];
	return min(query1(node*2,start,mid,l,r),query1(node*2+1,mid+1,end,l,r));
}

inline void push2(int node,int start,int end){
	if(lazy2[node]==inf)return ;
	tree2[node]=min(tree2[node],lazy2[node]);
	if(start!=end){
		lazy2[node*2]=min(lazy2[node*2],lazy2[node]);
		lazy2[node*2+1]=min(lazy2[node*2+1],lazy2[node]);
	}
	lazy2[node]=inf;
}
 
inline void update2(int node,int start,int end,int l,int r,int val){
	push2(node,start,end);
	if(start>end || start>r || end<l)return ;
	if(start>=l && end<=r){
		lazy2[node]=min(lazy2[node],val);
		push2(node,start,end);
		return ;
	}
	update2(node*2,start,mid,l,r,val);
	update2(node*2+1,mid+1,end,l,r,val);
	tree2[node]=min(tree2[node*2],tree2[node*2+1]);
}
 
inline int query2(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return inf;
	push2(node,start,end);
	if(start>=l && end<=r)return tree2[node];
	return min(query2(node*2,start,mid,l,r),query2(node*2+1,mid+1,end,l,r));
}
 
inline void push(int node,int start,int end){
	if(lazy[node].se==0)return ;
	if(lazy[node].se==1){
		tree[node]=max(tree[node],lazy[node].fi);
	}
	if(lazy[node].se==2){
		tree[node]=min(tree[node],lazy[node].fi);
	}
	if(start!=end){
		push(node*2,start,mid),push(node*2+1,mid+1,end);
		lazy[node*2]=lazy[node];
		lazy[node*2+1]=lazy[node];
	}
	lazy[node]={0,0};
}
 
inline void update(int node,int start,int end,int l,int r,int val,int ty){
	//~ push1(node,start,end);
	push(node,start,end);
	if(start>end || start>r || end<l)return ;
	
	if(start>=l && end<=r){
		//~ cout<<query1(1,1,m,start,start)<<" : : "<<query1(1,1,m,end,end)<<" : : "<<start<<" ; : "<<end<<endl;;
		lazy[node]={val,ty};
		//~ push1(node,start,end);
		push(node,start,end);
		return ;
	}
	update(node*2,start,mid,l,r,val,ty);
	update(node*2+1,mid+1,end,l,r,val,ty);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}
 
inline int query(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return 0;
	push(node,start,end);
	//~ push1(node,start,end);
	if(start>=l && end<=r)return tree[node];
	return max(query(node*2,start,mid,l,r),query(node*2+1,mid+1,end,l,r));
}
 
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	m=n;
	for(int i=1;i<=4*n;i++){
		tree1[i]=inf;
		lazy1[i]=inf;
		//~ tree[i]=-1;
		//~ lazy[i]=-1;
		tree2[i]=inf;
		lazy2[i]=inf;
	}
	//~ int mn=inf;
	//~ for(int i=k-1;i>=0;i--){
		//~ if(op[i]==1)
		//~ update2(1,1,n,left[i],right[i],i);
	//~ }
	//~ FOR{
		//~ int at=query2(1,1,n,i,i);
		//~ cout<<i<<" : : "<<at<<endl;
		//~ if(at==inf)continue;
		//~ v[at].pb(i);
	//~ }
	for(int i=0;i<k;i++){
		//~ cout<<height[i]<<endl;
		//~ if(op[i]==2){
			//~ update1(1,1,n,left[i]+1,right[i]+1,height[i]);
			//~ continue;
		//~ }
		//~ cout<<"**\n";
		update(1,1,n,left[i]+1,right[i]+1,height[i],op[i]);
		//~ for(int j=0;j<(int)v[i].size();j++){
			//~ cout<<v[i][j]<<endl;
		//~ }
		//~ if(op[i]==2)update1(1,1,n,left[i]+1,right[i]+1,height[i]);
		//~ update2(1,1,n,left[i]+1,right[i]+1,i);
	}
	FOR finalHeight[i-1]=query(1,1,n,i,i);
	return;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 9 ms 256 KB Output is correct
4 Correct 214 ms 1656 KB Output is correct
5 Correct 166 ms 1652 KB Output is correct
6 Correct 156 ms 1656 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 172 ms 9976 KB Output is correct
3 Execution timed out 3088 ms 6488 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 9 ms 416 KB Output is correct
4 Correct 203 ms 1660 KB Output is correct
5 Correct 161 ms 1660 KB Output is correct
6 Correct 161 ms 1656 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 174 ms 13304 KB Output is correct
9 Execution timed out 3081 ms 9464 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 204 ms 1656 KB Output is correct
5 Correct 152 ms 1656 KB Output is correct
6 Correct 156 ms 1656 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 172 ms 13304 KB Output is correct
9 Execution timed out 3079 ms 9284 KB Time limit exceeded
10 Halted 0 ms 0 KB -