This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(v) (int)v.size()
#define all(x) begin(x),end(x)
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)
//--------------------------------------------//
int N,Q;
vi aa;
const int MX=5e5+10;
void ckmax(int &x, int y){x=max(x,y);}
vi t(MX,0);
void upd(int idx){
int i=idx;
for(;i<=N; i+=i&-i){
t[i]++;
}
}
int get(int idx){
int i=idx;
int ans=0;
for(;i;i-=i&-i) ans+=t[i];
return ans;
}
vi countScans(vi A,vi X,vi V){
N=sz(A); Q=sz(X);
aa.assign(all(A));
vi temp;
temp.assign(all(aa));
sort(all(temp));
int cnt=0;
unordered_map<int,int>mp;
for(int x: temp) if(!mp.count(x)) mp[x]=++cnt;
vi a(N);
FOR(i,0,N) a[i]=mp[aa[i]];
vi ans(Q);
FOR(idx,0,Q){
aa[X[idx]]=V[idx];
if(!mp.count(V[idx])) FOR(i,0,N) if(aa[i]>V[idx])
a[i]++;
vi st,vec(N);
ROF(i,0,N){
while(sz(st) && st.back()<a[i]) st.pop_back();
if(!sz(st)){
vec[i]=(i!=N-1);
}
else{
if(st.back()==i+1 && !vec[st.back()])
vec[i]=0;
else vec[i]=vec[st.back()]+1;
}
st.pb(i);
}
t.assign(N+1,0);
FOR(i,0,N){
ckmax(vec[i],i-get(a[i]));
upd(a[i]);
}
ans[idx]=0;
FOR(i,0,N) ckmax(ans[idx],vec[i]);
}
return ans;
}
/*
4 2
1 2 3 4
0 3
2 1
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |