結果

問題 No.1496 不思議な数え上げ
ユーザー 👑 tute7627tute7627
提出日時 2021-04-30 22:24:09
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 162 ms / 3,000 ms
コード長 6,893 bytes
コンパイル時間 2,524 ms
コンパイル使用メモリ 210,480 KB
実行使用メモリ 12,632 KB
最終ジャッジ日時 2023-09-26 06:33:10
合計ジャッジ時間 11,315 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 159 ms
12,480 KB
testcase_04 AC 162 ms
12,556 KB
testcase_05 AC 160 ms
12,540 KB
testcase_06 AC 100 ms
12,600 KB
testcase_07 AC 99 ms
12,556 KB
testcase_08 AC 98 ms
12,584 KB
testcase_09 AC 99 ms
12,564 KB
testcase_10 AC 98 ms
12,632 KB
testcase_11 AC 99 ms
12,508 KB
testcase_12 AC 138 ms
12,468 KB
testcase_13 AC 108 ms
12,544 KB
testcase_14 AC 102 ms
12,492 KB
testcase_15 AC 110 ms
12,524 KB
testcase_16 AC 109 ms
12,520 KB
testcase_17 AC 136 ms
12,580 KB
testcase_18 AC 135 ms
12,456 KB
testcase_19 AC 134 ms
12,464 KB
testcase_20 AC 157 ms
12,540 KB
testcase_21 AC 155 ms
12,556 KB
testcase_22 AC 159 ms
12,472 KB
testcase_23 AC 155 ms
12,536 KB
testcase_24 AC 160 ms
12,584 KB
testcase_25 AC 109 ms
12,580 KB
testcase_26 AC 109 ms
12,556 KB
testcase_27 AC 156 ms
12,476 KB
testcase_28 AC 155 ms
12,540 KB
testcase_29 AC 160 ms
12,560 KB
testcase_30 AC 159 ms
12,556 KB
testcase_31 AC 154 ms
12,536 KB
testcase_32 AC 138 ms
11,220 KB
testcase_33 AC 70 ms
7,736 KB
testcase_34 AC 64 ms
7,192 KB
testcase_35 AC 3 ms
4,380 KB
testcase_36 AC 140 ms
11,480 KB
testcase_37 AC 75 ms
7,980 KB
testcase_38 AC 68 ms
7,440 KB
testcase_39 AC 101 ms
9,308 KB
testcase_40 AC 54 ms
6,856 KB
testcase_41 AC 105 ms
9,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v,w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template<typename T>
struct BIT{
  ll n;
  ll k=1;
  vector<T>data;
  BIT() = default;
  BIT(ll size):n(size){
    data.assign(n,0);
    while(k*2<=n)k*=2;
  }
  void add(ll a,T w){
    for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w;
  }
  T sum(ll a){//[0,a)
	  if(a<=0)return 0;
    T ret = 0;
    for(ll i=a;i>0;i-=i&-i)ret+=data[i-1];
    return ret;
  }
  //[a,b)
  T sum(ll a,ll b){return a>=b?0:sum(b)-sum(a);}
  T operator[](ll pos){
    return sum(pos,pos+1);
  }
  ll lower_bound(ll x){
    ll ret=0;    
    for(ll i=k;i>0;i/=2){
      if(ret+i<=n&&data[ret+i-1]<x){
        x-=data[ret+i-1];
        ret+=i;
      }
    }
    return ret;
  }
  void print(){
    for(ll i=0;i<n;i++){
      if(i!=0)cout<<" ";
      cout<<(*this)[i];
    }
    cout<<endl;
  }
};
template<typename T>
pair<vector<int>,vector<int>>val_range(const vector<T>&v, bool isMin){
  pair<vector<int>,vector<int>>ret;
  ret.first.assign(v.size(),-1);
  ret.second.assign(v.size(),v.size());
  stack<int>st;
  st.push(-1);
  for(int i=0;i<v.size();i++){
    while(st.top()!=-1){
      if(isMin^(v[st.top()]<v[i])){
        ret.second[st.top()]=i;
        st.pop();
      }
      else break;
    }
    ret.first[i]=st.top();
    st.push(i);
  }
  return ret;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>p(n),a(n);
  rep(i,0,n)cin>>p[i];
  rep(i,0,n)cin>>a[i];
  auto [l,r]=val_range(p,true);
  BIT<ll>bl(n),br(n);
  rep(i,0,n){
    bl.add(i,p[i]);
    br.add(n-i-1,p[i]);
  }
  vector<ll>ans(n);
  rep(i,0,n){
    ll ret=0;
    if(i-l[i]<r[i]-i){
      ll sum=bl.sum(i+1);
      rrep(j,l[i]+1,i+1){
        sum-=p[j];
        ll idx=bl.lower_bound(a[p[i]-1]+sum+1);
        ret+=max(0LL,min<ll>(r[i],idx)-i);
      }
    }
    else{
      ll sum=br.sum(n-i);
      rep(j,i,r[i]){
        sum-=p[j];
        ll idx=br.lower_bound(a[p[i]-1]+sum+1);
        ret+=max(0LL,min(n-l[i]-1,idx)-(n-i-1));
      }
      //cout<<i spa ret<<endl;
    }
    ans[p[i]-1]=ret;
  }
  rep(i,0,n)cout<<ans[i]<<endl;
  return 0;
}
0