結果

問題 No.1496 不思議な数え上げ
ユーザー PCTprobabilityPCTprobability
提出日時 2021-04-30 22:31:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,191 bytes
コンパイル時間 6,448 ms
コンパイル使用メモリ 304,580 KB
実行使用メモリ 15,360 KB
最終ジャッジ日時 2024-07-19 02:07:41
合計ジャッジ時間 21,263 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 317 ms
15,104 KB
testcase_07 AC 319 ms
15,132 KB
testcase_08 AC 322 ms
15,232 KB
testcase_09 AC 348 ms
15,232 KB
testcase_10 AC 368 ms
15,104 KB
testcase_11 AC 343 ms
15,232 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <unistd.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 = long long;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#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 se second
#define pb push_back
#define pll pair<ll,ll>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define in scanner.read_int()
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
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>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}
void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } }
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;}}
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...));}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
const ll t0=1,t1=10,t2=100,t3=1000,t4=10000,t5=100000,t6=1000000,t7=10000000,t8=t7*10,t9=t8*10,t10=t9*10,t11=t10*10,t12=t11*10,t13=t12*10,t14=t13*10,t15=t14*10,t16=t15*10,t17=t16*10,t18=t17*10;
void gbjsmzmfuuvdf(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
class Scanner {
    vector<char> buffer;
    ssize_t n_written;
    ssize_t n_read;

public:
    Scanner(): buffer(1024*1024) { do_read(); }

    int64_t read_int() {
        int64_t ret = 0, sgn = 1;
        int ch = current_char();
        while (isspace(ch)) { ch = next_char(); }
        if (ch == '-') { sgn = -1; ch = next_char(); }
        for (; isdigit(ch); ch = next_char())
            ret = (ret * 10) + (ch - '0');
        return sgn * ret;
    }

private:
    void do_read() {
        ssize_t r = read(0, &buffer[0], buffer.size());
        if (r < 0) {
            throw runtime_error(strerror(errno));
        }
        n_written = r;
        n_read = 0;
    }

    inline int next_char() {
        ++n_read;
        if (n_read == n_written) { do_read(); }
        return current_char();
    }

    inline int current_char() {
        return (n_read == n_written) ? EOF : buffer[n_read];
    }
};
//Scanner scanner;
//void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;}
ll op(ll a,ll b){
  return min(a,b);
}
ll e(){
  return 1000000000ll;
}
ll x;
bool f(ll u){
  return u>=x;
}
int main() {
  gbjsmzmfuuvdf();
  ll n;
  cin>>n;
  vector<ll> p(n);
  vcin(p);
  vector<ll> a(n);
  vcin(a);
  vector<ll> l(n+1);
  vector<ll> s(n);
  for(int i=0;i<n;i++){
    s[p[i]-1]=i;
  }
  for(int i=0;i<n;i++){
    l[i+1]=l[i]+p[i];
  }
  vector<ll> r(n+1);
  for(int i=n-1;i>=0;i--){
    r[i]=r[i+1]+p[i];
  }
  segtree<ll,op,e> seg(p);
  for(int i=0;i<n;i++){
    ll ans=0;
    x=i+1;
    ll u=seg.max_right(s[i],f);
    u--;
    ll v=seg.min_left(s[i],f);
    swap(u,v);
    ll X=abs(s[i]-u),Y=abs(s[i]-v);
   // cout<<u<<" "<<v<<" "<<X<<" "<<Y<<endl;
    if(X==0&&Y==0){
      if(i+1<=a[i]){
        cout<<1<<endl;
      }
      else{
        cout<<0<<endl;
      }
      continue;
    }
    if(X<Y){
      for(int j=u;j<=s[i];j++){
        ll ok=s[i],ng=v+1;
        if(l[n]-l[j]<=a[i]){
          ans+=n-s[i];
          continue;
        }
        while(abs(ok-ng)>1){
          ll m=(ok+ng)/2;
          if(l[m+1]-l[j]<=a[i]){
            ok=m;
          }
          else{
            ng=m;
          }
        }
      //  cout<<ok<<" "<<s[i]<<endl;
        if(ok==s[i]){
          if(i+1<=a[i]){
            ans++;
          }
        }
        else{
          ans+=-s[i]+ok+1;
        }
      }
    }
    else{
      for(int j=s[i];j<=v;j++){
        ll ok=s[i],ng=u-1;
        if(l[j+1]<=a[i]){
          ans+=s[i]+1;
          continue;
        }
       // cout<<i<<" "<<j<<endl;
        while(abs(ok-ng)>1){
          ll m=(ok+ng)/2;
          if(l[j+1]-l[m]<=a[i]){
            ok=m;
          }
          else{
            ng=m;
          }
        }
        if(ok==s[i]){
          if(l[j+1]-l[s[i]]<=a[i]){
            ans++;
          }
        }
        else{
          ans+=s[i]-ok+1;
        }
      }
    }
    cout<<ans<<endl;
  }
}
0