test/yukicoder/4387.test.cpp

View this file on GitHub
Last update: 2020-10-27 18:08:33+09:00
Problem: https://yukicoder.me/problems/4387

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/4387"

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

#define call_from_test
#include "../../io/single.cpp"
#include "../../graph/rangetorange.cpp"
#include "../../graph/stronglyconnectedcomponent.cpp"
#undef call_from_test

#ifdef SANITIZE
#define IGNORE
#endif

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  const char newl = '\n';

  int n,a,b;
  cin>>n>>a>>b;

  auto xs=read(n);

  RangeToRange G(n);
  SCC scc(G.size()+n+n);
  auto f=[&](int u,int v){scc.add_edge(u,v);};
  G.init(f);

  for(int i=0;i<n;i++){
    // [x - B, x - A]
    {
      int l=lower_bound(xs.begin(),xs.end(),xs[i]-b)-xs.begin();
      int r=upper_bound(xs.begin(),xs.end(),xs[i]-a)-xs.begin();
      G.add_edge(i,i+1,l,r,f,f);
    }
    // [x + A, x + B]
    {
      int l=lower_bound(xs.begin(),xs.end(),xs[i]+a)-xs.begin();
      int r=upper_bound(xs.begin(),xs.end(),xs[i]+b)-xs.begin();
      G.add_edge(i,i+1,l,r,f,f);
    }
  }

  scc.build();
  map<int, int> cnt;
  for(int i=0;i<n;i++) cnt[scc[G.idx(i)]]++;
  for(int i=0;i<n;i++) cout<<cnt[scc[G.idx(i)]]<<newl;
  return 0;
}

#line 1 "test/yukicoder/4387.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/4387"

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

#define call_from_test
#line 1 "io/single.cpp"

#line 3 "io/single.cpp"
using namespace std;
#endif

//BEGIN CUT HERE
template<typename T=int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 1 "graph/rangetorange.cpp"

#line 3 "graph/rangetorange.cpp"
using namespace std;
#endif

// https://lorent-kyopro.hatenablog.com/entry/2020/07/24/170656
//BEGIN CUT HERE
struct RangeToRange{
  const int n;
  int ptr;
  RangeToRange(int n):n(n),ptr(3*n){}

  // (0n, 2n) : top segtree (to)
  // (2n, 4n) : bottom segtree (from)

  // map [3n, 4n) -> [n, 2n)
  template<typename F>
  void add_edge(int u,int v,F f){
    if(3*n<=u and u<4*n) u-=2*n;
    f(u,v);
  }

  template<typename F>
  void init(F f){
    for(int i=1;i<n;i++){
      int l=(i<<1)|0;
      int r=(i<<1)|1;
      add_edge(0*n+i,0*n+l,f);
      add_edge(0*n+i,0*n+r,f);
      add_edge(2*n+l,2*n+i,f);
      add_edge(2*n+r,2*n+i,f);
    }
  }

  // [l1, r1) -> [l2, r2)
  template<typename F,typename G>
  void add_edge(int l1,int r1,int l2,int r2,F f,G g){
    int k=ptr++;
    for(l1+=n,r1+=n;l1<r1;l1>>=1,r1>>=1){
      if(l1&1) add_edge(2*n+(l1++),k,f);
      if(r1&1) add_edge(2*n+(--r1),k,f);
    }
    for(l2+=n,r2+=n;l2<r2;l2>>=1,r2>>=1){
      if(l2&1) g(k,l2++);
      if(r2&1) g(k,--r2);
    }
  }
  int idx(int v)const{return 1*n+v;}
  size_t size()const{return ptr;}
};
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
signed main(){
  return 0;
}
#endif
#line 1 "graph/stronglyconnectedcomponent.cpp"

#line 3 "graph/stronglyconnectedcomponent.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
struct SCC{
  vector< vector<int> > G,R,H,C;
  vector<int> vs,used,blg;
  SCC(int n):G(n),R(n),used(n),blg(n){}

  void add_edge(int u,int v){
    G[u].emplace_back(v);
    R[v].emplace_back(u);
  }

  void dfs(int v){
    used[v]=1;
    for(int u:G[v])
      if(!used[u]) dfs(u);
    vs.emplace_back(v);
  }

  void rdfs(int v,int k){
    used[v]=1;
    blg[v]=k;
    C[k].emplace_back(v);
    for(int u:R[v])
      if(!used[u]) rdfs(u,k);
  }

  int build(bool uniq=true){
    int n=G.size();
    for(int v=0;v<n;v++)
      if(!used[v]) dfs(v);

    fill(used.begin(),used.end(),0);
    int k=0;
    for(int i=n-1;i>=0;i--){
      if(!used[vs[i]]){
        H.emplace_back();
        C.emplace_back();
        rdfs(vs[i],k++);
      }
    }

    for(int v=0;v<n;v++)
      for(int u:G[v])
        if(blg[v]!=blg[u])
          H[blg[v]].emplace_back(blg[u]);

    if(uniq){
      for(int i=0;i<k;i++){
        sort(H[i].begin(),H[i].end());
        H[i].erase(unique(H[i].begin(),H[i].end()),H[i].end());
      }
    }
    return k;
  }

  int operator[](int k) const{return blg[k];}
};
//END CUT HERE
#ifndef call_from_test
signed main(){
  return 0;
}
#endif
#line 10 "test/yukicoder/4387.test.cpp"
#undef call_from_test

#ifdef SANITIZE
#define IGNORE
#endif

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  const char newl = '\n';

  int n,a,b;
  cin>>n>>a>>b;

  auto xs=read(n);

  RangeToRange G(n);
  SCC scc(G.size()+n+n);
  auto f=[&](int u,int v){scc.add_edge(u,v);};
  G.init(f);

  for(int i=0;i<n;i++){
    // [x - B, x - A]
    {
      int l=lower_bound(xs.begin(),xs.end(),xs[i]-b)-xs.begin();
      int r=upper_bound(xs.begin(),xs.end(),xs[i]-a)-xs.begin();
      G.add_edge(i,i+1,l,r,f,f);
    }
    // [x + A, x + B]
    {
      int l=lower_bound(xs.begin(),xs.end(),xs[i]+a)-xs.begin();
      int r=upper_bound(xs.begin(),xs.end(),xs[i]+b)-xs.begin();
      G.add_edge(i,i+1,l,r,f,f);
    }
  }

  scc.build();
  map<int, int> cnt;
  for(int i=0;i<n;i++) cnt[scc[G.idx(i)]]++;
  for(int i=0;i<n;i++) cout<<cnt[scc[G.idx(i)]]<<newl;
  return 0;
}