#include <bits/stdc++.h>
using namespace std;
/*#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif*/
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
#define die(a) {cout<<a<<endl;return 0;}
#define dier(a) {return a;}
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
void cincout(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout<< fixed << setprecision(15);
}
struct segtree{
vector<ll> node;
ll n;
segtree(ll _n){
n=1;
while(n<_n) n*=2;
node.resize(2*n);
}
void set(ll i,ll v){
i+=n;
node[i]=v;
while(i){
i/=2;
node[i]=node[2*i]+node[2*i+1];
}
}
ll prod(ll l,ll r,ll a,ll b,ll k){
if(r<=a||b<=l) return 0;
if(l<=a&&b<=r) return node[k];
return prod(l,r,a,(a+b)/2,2*k)+prod(l,r,(a+b)/2,b,2*k+1);
}
ll prod(ll l,ll r){
return prod(l,r,0,n,1);
}
};
struct segtreem{
vector<P> node;
ll n;
segtreem(ll _n){
n=1;
while(n<_n) n*=2;
node.resize(2*n);
for(int i=0;i<n;i++) node[i+n].se=i;
}
void set(ll i,ll v){
i+=n;
node[i].fi=v;
while(i){
i/=2;
if(node[2*i].fi>node[2*i+1].fi) node[i]=node[2*i];
else node[i]=node[2*i+1];
}
}
P prod(ll l,ll r,ll a,ll b,ll k){
if(r<=a||b<=l) return {-inf,-inf};
if(l<=a&&b<=r) return node[k];
P u=prod(l,r,a,(a+b)/2,2*k),v=prod(l,r,(a+b)/2,b,2*k+1);
if(u.fi>v.fi) return u;
else v;
}
P prod(ll l,ll r){
return prod(l,r,0,n,1);
}
};
int main(){
cincout();
ll n,q;
cin>>n>>q;
n/=2;
vector<ll> a(2*n);
vcin(a);
for(auto &e:a) e--;
vector<vector<P>> t(2*n+1);
for(int i=0;i<q;i++){
ll tm,x;
cin>>tm>>x;
chmin(tm,2*n);
t[tm].pb({x,i});
}
vector<ll> ans(q);
vector<ll> rev(2*n);
for(int i=0;i<2*n;i++) rev[a[i]]=i;
ll now=1,id=0;
segtree seg(2*n);
for(int i=1;i<2*n;i++){
if(a[id]<a[i]){
seg.set(a[id],now);
now=1;
id=i;
}
else now++;
}
segtreem sem(2*n);
for(int i=0;i<2*n;i++) sem.set(i,a[i]);
seg.set(a[id],now);
for(int _=0;_<=2*n;_++){
if(_){
for(auto e:t[_]){
ll sm=0;
ll ok=2*n-1,ng=-1;
while(abs(ok-ng)>1){
ll mid=(ok+ng)/2;
if(seg.prod(0,mid+1)>=e.fi) ok=mid;
else ng=mid;
}
ans[e.se]=a[rev[ok]+e.fi-seg.prod(0,ok)-1]+1;
}
}
else{
for(auto e:t[_]){
ans[e.se]=a[e.fi-1]+1;
}
}
ll sm=0;
ll ok=2*n-1,ng=-1;
while(abs(ok-ng)>1){
ll mid=(ok+ng)/2;
if(seg.prod(0,mid+1)>=n) ok=mid;
else ng=mid;
}
ll l=rev[ok]+n-seg.prod(0,ok),r=rev[ok]+seg.prod(ok,ok+1)-1;
seg.set(ok,n-seg.prod(0,ok));
if(l>r) continue;
ll now=1,id=l;
while(true){
P v=sem.prod(id+1,r+1);
if(v.fi<a[id]){
seg.set(a[id],r+1-id);
break;
}
seg.set(a[id],v.se-id);
id=v.se;
}
}
for(auto e:ans) cout<<e<<endl;
}
Compilation message
Main.cpp: In member function 'std::pair<long long int, long long int> segtreem::prod(ll, ll, ll, ll, ll)':
Main.cpp:126:10: warning: statement has no effect [-Wunused-value]
126 | else v;
| ^
Main.cpp: In function 'int main()':
Main.cpp:166:12: warning: unused variable 'sm' [-Wunused-variable]
166 | ll sm=0;
| ^~
Main.cpp:181:8: warning: unused variable 'sm' [-Wunused-variable]
181 | ll sm=0;
| ^~
Main.cpp:191:8: warning: unused variable 'now' [-Wunused-variable]
191 | ll now=1,id=l;
| ^~~
Main.cpp: In member function 'std::pair<long long int, long long int> segtreem::prod(ll, ll, ll, ll, ll)':
Main.cpp:127:3: warning: control reaches end of non-void function [-Wreturn-type]
127 | }
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
453 ms |
38352 KB |
Output is correct |
| 2 |
Correct |
465 ms |
36076 KB |
Output is correct |
| 3 |
Correct |
488 ms |
35128 KB |
Output is correct |
| 4 |
Correct |
418 ms |
32288 KB |
Output is correct |
| 5 |
Correct |
468 ms |
38348 KB |
Output is correct |
| 6 |
Correct |
426 ms |
36440 KB |
Output is correct |
| 7 |
Incorrect |
455 ms |
40804 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1195 ms |
64912 KB |
Output is correct |
| 2 |
Correct |
1217 ms |
63928 KB |
Output is correct |
| 3 |
Correct |
982 ms |
55864 KB |
Output is correct |
| 4 |
Correct |
1068 ms |
56208 KB |
Output is correct |
| 5 |
Correct |
1146 ms |
57012 KB |
Output is correct |
| 6 |
Correct |
1040 ms |
55452 KB |
Output is correct |
| 7 |
Incorrect |
1234 ms |
64184 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
283 ms |
16232 KB |
Output is correct |
| 2 |
Correct |
247 ms |
16136 KB |
Output is correct |
| 3 |
Correct |
263 ms |
15856 KB |
Output is correct |
| 4 |
Correct |
198 ms |
15820 KB |
Output is correct |
| 5 |
Correct |
241 ms |
16208 KB |
Output is correct |
| 6 |
Correct |
182 ms |
15732 KB |
Output is correct |
| 7 |
Incorrect |
206 ms |
15956 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
453 ms |
38352 KB |
Output is correct |
| 2 |
Correct |
465 ms |
36076 KB |
Output is correct |
| 3 |
Correct |
488 ms |
35128 KB |
Output is correct |
| 4 |
Correct |
418 ms |
32288 KB |
Output is correct |
| 5 |
Correct |
468 ms |
38348 KB |
Output is correct |
| 6 |
Correct |
426 ms |
36440 KB |
Output is correct |
| 7 |
Incorrect |
455 ms |
40804 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
