Submission #730168

#	Time	Username	Problem	Language	Result	Execution time	Memory
730168		shadow_sami	Bitaro's travel (JOI23_travel)	C++17	15 / 100	211 ms	98684 KiB

travel

#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)============================================================================================== //

#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;
ll l,r,q,mid,p,st,en,mm;
ll a[mx];
ll maxl[mx][30];
ll maxr[mx][30];
ll logg[mx];

ll best(ll k){
	l = 1,r = n;
	ll res = -1;
	while(l<=r){
		mid = l + (r-l)/2;
		if(a[mid]>=k){
			res = mid;
			r = mid - 1;
		}else
			l = mid + 1;
	}
	if(res==1)
		return res;
	if(res==-1)
		return n;
	if(a[res] - k < k - a[res-1])
		return res;
	else
		return (res-1);
}

ll get_left(ll ss,ll ee){
	ll range = ee-ss+1;
	range = logg[range];
	return (max(maxl[ss][range],maxl[ee-(1<<range)+1][range]));
}

ll get_right(ll ss,ll ee){
	ll range = ee-ss+1;
	range = logg[range];
	return (max(maxr[ss][range],maxr[ee-(1<<range)+1][range]));
}

void initializer(){
	fip(0,mx){
		a[i] = logg[i] = 0;
	}
	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;
        initializer();
        fip(2,mx)
        	logg[i] = logg[i>>1] + 1;
        fip(1,n+1)
        	cin>>a[i];
        fip(2,n+1)
        	maxl[i][0] = 2*a[i] - a[i-1];
        fin(n,1)
        	maxr[i][0] = a[i+1] - 2*a[i];
        
        fjp(1,30)
        	for(ll i = 2; i + (1<<j) - 1 <= n;i++)
        		maxl[i][j] = max(maxl[i][j-1],maxl[i+(1<<(j-1))][j-1]);
        fjp(1,30)
        	for(ll i = 1; i + (1<<j) - 1 < n;i++)
        		maxr[i][j] = max(maxr[i][j-1],maxr[i+(1<<(j-1))][j-1]);
        cin>>q;
        while(q--){
        	ans = 0;
        	cin>>tp;
        	p = best(tp);
        	ans += abs(a[p]-tp);
        	l = r = p;
        	while(1){
        		if(l==1){
        			ans += abs(a[p] - a[n]);
        			r = n;
        			break;
        		}
        		if(r==n){
        			ans += abs(a[1] - a[p]);
        			l = 1;
        			break;
        		}
        		if(l==p){
        			st = 2, en = l, res = l;
        			while(st<=en){
        				mm = st + (en-st)/2;
        				if(get_left(mm,l)-a[r+1] <= 0){
        					res = mm - 1;
        					en = mm - 1;
        				}else
        					st = mm + 1;
        			}
        			ans += a[l] - a[res];
        			l = res;
        			ans += a[r+1] - a[res];
        			p = r + 1;
        			r = p;
        		}
        		else{
        			st = r, en = n-1, res = r;
        			while(st<=en){
        				mm = st + (en-st)/2;
        				if(get_right(r,mm) + a[l-1] < 0){
        					res = mm + 1;
        					st = mm + 1;
        				}else
        					en = mm - 1;
        			}
        			debug(res);
        			ans += a[res] - a[r];
        			r = res;
        			ans += a[res] - a[l-1];
        			p = l - 1;
        			l = p;
        		}
        	}
        	cout<<ans<<nli;
        }
        
    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 30
• Subtask 4: 0 / 55