1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(5e18)+3;
constexpr ll mod=static_cast<ll>(1e9)+7;
ll N,Q,T,P[MAXN];
ll Pos[MAXN];
ll sufP[MAXN];
inline void solve(){
cin>>N>>Q;
FOR(i,0,N+5) {sufP[i]=0;}
FOR(i,1,N){
cin>>P[i];
Pos[P[i]]=i;
}
FOR(i,1,Q){
ll l,r,k;
cin>>l>>r>>k;
if(Pos[k]>r || Pos[k]<l){
cout<<"-1 ";
continue;
}
ll needRep_=0,needRep=0,useNum_=0,useNum=0;
ll idx=l+r>>1;
ll pk=Pos[k];
ll l_=l,r_=r;
while(idx!=pk){
if(idx<pk){
if(P[idx]>k) ++needRep_;
else ++useNum_;
l_=idx+1;
idx=(l_+r_)/2;
}else{
if(P[idx]<k) ++needRep;
else ++useNum;
r_=idx-1;
idx=(r_+l_)/2;
}
}
if(needRep==0 && needRep_==0) {cout<<"0 ";continue;}
if(N-k-useNum<needRep){
cout<<"-1 ";
continue;
}
if(k-1-useNum_<needRep_){
cout<<"-1 ";
continue;
}
cout<<needRep+needRep_+(max(needRep_,needRep)-min(needRep,needRep_))<<" ";
}
cout<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>T;
while(T--){
solve();
}
return 0;
}
|