結果

問題 No.1332 Range Nearest Query
ユーザー hotman78hotman78
提出日時 2021-01-08 22:56:11
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,626 ms / 2,500 ms
コード長 11,392 bytes
コンパイル時間 4,217 ms
コンパイル使用メモリ 244,384 KB
実行使用メモリ 152,152 KB
最終ジャッジ日時 2023-08-10 11:16:33
合計ジャッジ時間 59,907 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
146,052 KB
testcase_01 AC 65 ms
146,088 KB
testcase_02 AC 67 ms
146,264 KB
testcase_03 AC 1,430 ms
151,320 KB
testcase_04 AC 1,476 ms
151,184 KB
testcase_05 AC 1,422 ms
151,420 KB
testcase_06 AC 1,313 ms
152,004 KB
testcase_07 AC 1,288 ms
152,120 KB
testcase_08 AC 1,305 ms
152,068 KB
testcase_09 AC 1,313 ms
152,140 KB
testcase_10 AC 1,314 ms
151,940 KB
testcase_11 AC 1,334 ms
152,112 KB
testcase_12 AC 1,332 ms
152,092 KB
testcase_13 AC 1,357 ms
151,956 KB
testcase_14 AC 1,364 ms
151,964 KB
testcase_15 AC 1,348 ms
152,076 KB
testcase_16 AC 1,511 ms
152,112 KB
testcase_17 AC 1,528 ms
151,960 KB
testcase_18 AC 1,526 ms
152,000 KB
testcase_19 AC 1,508 ms
151,980 KB
testcase_20 AC 1,528 ms
152,152 KB
testcase_21 AC 1,489 ms
151,944 KB
testcase_22 AC 1,507 ms
151,964 KB
testcase_23 AC 1,523 ms
151,928 KB
testcase_24 AC 1,626 ms
152,144 KB
testcase_25 AC 1,528 ms
152,124 KB
testcase_26 AC 833 ms
152,012 KB
testcase_27 AC 819 ms
152,148 KB
testcase_28 AC 440 ms
146,200 KB
testcase_29 AC 464 ms
146,284 KB
testcase_30 AC 486 ms
146,376 KB
testcase_31 AC 409 ms
146,312 KB
testcase_32 AC 490 ms
146,048 KB
testcase_33 AC 484 ms
146,020 KB
testcase_34 AC 409 ms
146,292 KB
testcase_35 AC 424 ms
146,264 KB
testcase_36 AC 419 ms
146,292 KB
testcase_37 AC 458 ms
146,212 KB
testcase_38 AC 1,193 ms
149,296 KB
testcase_39 AC 890 ms
146,460 KB
testcase_40 AC 1,501 ms
151,816 KB
testcase_41 AC 995 ms
147,344 KB
testcase_42 AC 1,140 ms
149,116 KB
testcase_43 AC 1,041 ms
147,920 KB
testcase_44 AC 1,338 ms
150,700 KB
testcase_45 AC 1,269 ms
150,160 KB
testcase_46 AC 1,156 ms
148,668 KB
testcase_47 AC 1,236 ms
149,836 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)

// #define rep(i,...) for(auto i:range(__VA_ARGS__)) 
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#line 5 "cpplib/math/mod_int.hpp"

/**
 * @brief ModInt
 */

template<int MOD>
struct mod_int {
    using mint=mod_int<MOD>;
    using u64 = std::uint_fast64_t;
    u64 a;
    constexpr mod_int(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){}
    constexpr u64 &value()noexcept{return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;}
    constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;}
    constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;}
    constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;}
    constexpr mint &operator+=(const mint rhs) noexcept {
        a += rhs.a;
        if (a >= get_mod())a -= get_mod();
        return *this;
    }
    constexpr mint &operator-=(const mint rhs) noexcept {
        if (a<rhs.a)a += get_mod();
        a -= rhs.a;
        return *this;
    }
    constexpr mint &operator*=(const mint rhs) noexcept {
        a = a * rhs.a % get_mod();
        return *this;
    }
    constexpr mint operator++(int) noexcept {
        a += 1;
        if (a >= get_mod())a -= get_mod();
        return *this;
    }
    constexpr mint operator--(int) noexcept {
        if (a<1)a += get_mod();
        a -= 1;
        return *this;
    }
    constexpr mint &operator/=(mint rhs) noexcept {
        u64 exp=get_mod()-2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    constexpr bool operator==(mint x) noexcept {
        return a==x.a;
    }
    constexpr bool operator!=(mint x) noexcept {
        return a!=x.a;
    }
    constexpr bool operator<(mint x) noexcept {
        return a<x.a;
    }
    constexpr bool operator>(mint x) noexcept {
        return a>x.a;
    }
    constexpr bool operator<=(mint x) noexcept {
        return a<=x.a;
    }
    constexpr bool operator>=(mint x) noexcept {
        return a>=x.a;
    }
    constexpr static int root(){
        mint root = 2;
        while(root.pow((get_mod()-1)>>1).a==1)root++;
        return root.a;
    }
    constexpr mint pow(long long n)const{
        long long x=a;
        mint ret = 1;
        while(n>0) {
            if(n&1)(ret*=x);
            (x*=x)%=get_mod();
            n>>=1;
        }
        return ret;
    }
    constexpr mint inv(){
        return pow(get_mod()-2);
    }
    static std::vector<mint> fac;
    static std::vector<mint> ifac;
    static bool init;
    constexpr static int mx=10000001;
    void build()const{
        init=0;
        fac.resize(mx);
        ifac.resize(mx);
        fac[0]=1,ifac[0]=1;
        for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i;
        ifac[mx-1]=fac[mx-1].inv();
        for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1);
    }
    mint comb(long long b){
        if(init)build();
        if(a<0||b<0)return 0;
        if(a==0&&b==0)return 1;
        if((long long)a<b)return 0;
        return fac[a]*ifac[a-b]*ifac[b];
    }
    mint fact()const{
        if(init)build();
        return fac[a];
    }
    mint fact_inv()const{
        if(init)build();
        return ifac[a];
    }
    friend std::ostream& operator<<(std::ostream& lhs, const mint& rhs) noexcept {
        lhs << rhs.a;
        return lhs;
    }
    friend std::istream& operator>>(std::istream& lhs,mint& rhs) noexcept {
        lhs >> rhs.a;
        return lhs;
    }
    constexpr static u64 get_mod(){
        return MOD;
    }
};
template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::fac;
template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::ifac;
template<int MOD>bool mod_int<MOD>::init=1;
#line 3 "cpplib/math/mod_int1000000007.hpp"
using mint=mod_int<1'000'000'007>;
constexpr int MOD=1'000'000'007;
/**
 * @brief ModInt(1'000'000'007)
 */
#line 2 "cpplib/data_structure/bit_vector.hpp"

/**
 * @brief BitVector
 */

class bitvec{
	using u32=unsigned int;
	using u8=unsigned char;
    using lint=long long;
	//4*10^6対応
	//ブロック幅8,チャンク幅256
	const int bw=8,cw=256;
	const int len=15625,sz=4000000;
	bool data[4000000]={0};
	u32 chunk[15626];
	u8 block[15625][33];
	public:
	bitvec(){}
	void build(){
		chunk[0]=0;
		for(int i=0;i<15625;i++){
			block[i][0]=0;
			for(int j=0;j<31;j++){
				block[i][j+1]=block[i][j];
				for(int k=0;k<8;k++)block[i][j+1]+=data[i*cw+j*bw+k];
			}
			chunk[i+1]=chunk[i]+block[i][31];
			for(int k=0;k<8;k++)chunk[i+1]+=data[i*cw+31*bw+k];
		}
	}
	inline void set(int idx,bool b){data[idx]=b;}
	inline bool get(int idx){return data[idx];}
    inline int rank(int idx,bool b)const{
        if(b)return rank1(idx);
        else return idx-rank1(idx);
	}
	inline int rank1(int idx)const{
		int a=idx/cw,b=idx%cw/bw,c=idx%bw;
		int res=chunk[a]+block[a][b];
		for(int i=1;i<c+1;i++)res+=data[idx-i];
		return res;
	}
	inline int select(int num){
		if (num==0)return 0;
        if (rank1(sz)<num)return -1;
        int ok=sz,ng=0;
		while (ok-ng>1) {
			int mid=(ok+ng)/2;
			if (rank1(mid)>=num)ok =mid;
			else ng=mid;
		}
		return ok;
	}
};
#line 5 "cpplib/data_structure/wavelet_matrix.hpp"

/**
 * @brief WaveletMatrix(WIP)
 */

class wavelet_matrix{
    using lint=long long;
    const lint MAXLOG=32;
	std::vector<bitvec> matrix;
    lint sz;
	public:
	wavelet_matrix(std::vector<lint> data){
        sz=data.size();
		matrix.resize(MAXLOG);
		for(int i=MAXLOG-1;i>=0;i--){
			for(int j=0;j<(int)data.size();j++){
				matrix[i].set(j,data[j]&(1LL<<i));
			}
			matrix[i].build();
			std::stable_sort(data.begin(),data.end(),[&](auto s,auto t){return (s&(1LL<<i))<(t&(1LL<<i));});
		}
	}
    lint rank(lint pos,lint x){
        lint s=0,e=pos;
        for(int i=MAXLOG-1;i>=0;i--){
            bool b=x&(1LL<<i);
            s=matrix[i].rank(s,b);
            e=matrix[i].rank(e,b);
            if(b==1){
                lint l=matrix[i].rank(sz,0);
                s+=l;
                e+=l;
            }
        }
        return e-s;
    }
	void select(){
		for(int i=MAXLOG;i>=0;i--){

		}
	}
    lint kth_element(lint l,lint r,lint k){
        lint ans=0;
        for(int i=MAXLOG-1;i>=0;i--){
            lint cnt=matrix[i].rank(r,0)-matrix[i].rank(l,0);
            lint b=cnt<=k;
            ans+=b<<i;
            l=matrix[i].rank(l,b);
            r=matrix[i].rank(r,b);
            if(b==1){
                lint t=matrix[i].rank(sz,0);
                k-=cnt;
                l+=t;
                r+=t;
            }
        }
        return ans;
    }
    lint lower_bound(lint l,lint r,lint k){
        lint ans=0;
        for(int i=MAXLOG-1;i>=0;i--){
            lint cnt=matrix[i].rank(r,0)-matrix[i].rank(l,0);
            lint b=(k>>i&1);
            if(b)ans+=cnt;
            l=matrix[i].rank(l,b);
            r=matrix[i].rank(r,b);
            if(b==1){
                lint t=matrix[i].rank(sz,0);
                l+=t;
                r+=t;
            }
        }
        return ans;
    }
};
#line 3 "cpplib/math/binary_search.hpp"
/**
 * @brief 二分探索
 */
template<typename F>
long long bs(long long mn,long long mx,F func){
    mn--;
    mx++;
	while(mx-mn>1){
		long long mid=(mn+mx)/2;
		if(!func(mid))mx=mid;
		else mn=mid;
	}
    return mn;
}
#line 5 "code.cpp"

int main(){
    lint n;
    cin>>n;
    vec a(n);
    rep(i,n)cin>>a[i];
    wavelet_matrix wm(a);
    lint q;
    cin>>q;
    rep(i,q){
        lint l,r,x;
        cin>>l>>r>>x;
        l--;
        lint idx=wm.lower_bound(l,r,x);
        cout<<min(abs(x-wm.kth_element(l,r,max(0LL,idx-1))),abs(x-wm.kth_element(l,r,idx)))<<endl;
    }
}
0