제출 #1193823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1193823		shadow_sami	Abracadabra (CEOI22_abracadabra)	C++20	0 / 100	340 ms	44696 KiB

Main

#include<bits/stdc++.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)============================================================================================== //

#ifdef SAMI
	#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
	#define debg() cerr<<nli;
#else
	#define debug(x)
	#define debg() 
#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 mxn = 1e6 + 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;
ll a[mx];
vi b,c;
ll sr,de;
ll nas[mxn];
vector<pi> query[mx];
set<pair<ll,pi>> st;
ll nxt[mx];

ll l,r,mid;
ll pos[mx];

typedef struct binary_indexed_tree{
	vi arr;
	ll range,sm;
	void init(ll k){
		range = 4*k;
		arr.resize(range);
		fip(0,range)
			arr[i] = 0;
		return;
	}
	void add(ll k,ll val){		
		for(ll i = k; i <= n; i += i&(-i))
			arr[i] += val;
		return;
	}
	ll get(ll aa){		
		sm = 0;	
		if(!aa)	return sm;
		for(ll i = aa; i > 0; i -= i&(-i))
			sm += arr[i];
		return sm;
	}
}BIT;

BIT bit;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());	
    #ifdef SAMI
        freopen("input1.txt", "r", stdin);
        freopen("output1.txt", "w", stdout);
        freopen("error1.txt", "w", stderr);
    #endif // ONLINE_JUDGE

        cin>>n>>m;
        bit.init(n);
        fip(0,n+1){
        	query[i].clear();
        }
        fip(0,n){
        	cin>>a[i];
        	pos[a[i]] = i;
        }
        fip(0,m){
        	cin>>sr>>de;        
        	sr = min(n,sr);        	
        	assert(sr <= 2e5+2);      

        	query[sr].push_back({de,i});
        	if(sr == 26) {
        		debug((ll)query[sr].size());
        		debug(de)
        	}
        } 
        debug(query[26])       ;
        stack<ll> sck;
        a[n] = 1e18;
        sck.push(n);        
        fin(n-1,0){
        	while(a[sck.top()] < a[i])
        		sck.pop();
        	nxt[i] = sck.top();
        	sck.push(i);
        }        
        tptp = 0;        
        while(tp<n){        	
	        st.insert({a[tp],{tp,nxt[tp]-1}});
	        bit.add(a[tp],nxt[tp] - tp);
	        tptp += nxt[tp] - tp;
	        tp = nxt[tp];
	    }	    
	    // debug(query[26])       ;
	    // debug(st)	    ;
        fjp(0,n+1){        	        	
        	fx(query[j]){        		        		
        		l = 1;
        		r = n;
        		tp = 0;
        		while(l<=r){
        			mid = l + (r-l)/ 2;        			
        			if(bit.get(mid) >= x.ff){
        				tp = mid;
        				r = mid - 1;
        			}else
        				l = mid + 1;
        				
        		}                		
        		nas[x.ss] = a[pos[tp] + x.ff - bit.get(tp-1) - 1];
        	}        	
        	if(j==n)
        		continue;  
        	// debug(j);
        	// debug(query[26]);
        	while(1){
		    	auto it = *st.rbegin();
		    	if(tptp - (it.ss.ss-it.ss.ff+1) < n/2)
		    		break;
		    	tptp -= (it.ss.ss-it.ss.ff+1);
		    	st.erase(st.find(it));
		    }      	
		    // debug(st);
		    // debug(tptp)
        	if(tptp > n/2){
        		auto it = *st.rbegin();		    	
		    	
		    	
		    	tp2 = nxt[pos[it.ff]];
		    	tp = pos[it.ff] + n/2 - bit.get(it.ff-1);		    	
		    	// debug(tptp)		    	;		    	
		    	st.erase(st.find(it));
		    	bit.add(it.ff,-(it.ss.ss-it.ss.ff+1));
		    	tptp -= (it.ss.ss-it.ss.ff+1);		    			    	
		    	st.insert({it.ff,{pos[it.ff],tp-1}});		    		
		    	bit.add(it.ff,tp-pos[it.ff]);	
		    	tptp += tp-pos[it.ff];
		    	// debug(tp)
		    	// debug(tp2)	    	;
		    	// debug(tptp);
		    	while(tp != tp2){
		    		st.insert({a[tp],{tp,nxt[tp]-1}});		    		
			        bit.add(a[tp],nxt[tp] - tp);
			        tptp += nxt[tp] - tp;
			        tp = nxt[tp];		    		
		    	}		    		
        	}
        	// debug(st);
        	// debg();
        }
        fip(0,m){
        	cout<<nas[i];
        	if(i<m-1)cout<<nli;
        }
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25