#1195454 (C++23) No.2046 Ans Mod? Mod Ans!

• 問題: No.2046 Ans Mod? Mod Ans!
• ユーザー: eQe
• 提出日時: 2026-10-26 11:52:33
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 4,981 bytes
• コンパイル時間: 2,804 ms
• コンパイル使用メモリ: 357,256 KB
• 実行使用メモリ: 9,904 KB
• 最終ジャッジ日時: 2026-10-26 11:53:13
• 合計ジャッジ時間: 6,633 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge3_0

ファイルパターン	結果
sample	AC * 3
other	AC * 5 WA * 13

ソースコード

/*
#include<kyopro/master>
void self::main(){
  LL(N);
  VL(N,a);
  sort(a);
  use_ml1000000007
  pp(sum_pair_project_first<ml>(a)-sum_pair_mod<ml>(a));
}
*/

#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
namespace self{void main();void sub();template<ostream&o>void pp(auto&&...a);void epp(auto&&...a);}
int main(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);self::main();}
#define RD(T,...) T __VA_ARGS__;lin(__VA_ARGS__)
#define LL(...) RD(ll,__VA_ARGS__)
#define RDVL(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);lin(__VA_ARGS__)
#define VL(n,...) RDVL(ll,n,__VA_ARGS__)
#define FO(n) for(ll IJK=n;IJK-->0;)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define of(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(1,__VA_ARGS__);i>=i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define use_ml1000000007 using ml=atcoder::modint1000000007;
namespace self{
auto&operator<<(ostream&o,const atcoder::modint1000000007&x){return o<<(int)x.val();}
using ll=long long;
using ui32=uint32_t;
using ui64=uint64_t;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
template<class T>constexpr auto for_range(T s,T a,T b,T c=1){return array{a-s,b,(1-s*2)*c};}
void lin(auto&...a){(cin>>...>>a);}
constexpr ui64 kth_root_floor(ui64 a,ll k){
  if (k==1)return a;
  auto within=[&](ui32 x){ui64 t=1;FO(k)if(__builtin_mul_overflow(t,x,&t))return false;return t<=a;};

  ui64 r=0;
  of(i,sizeof(ui32)*CHAR_BIT)if(within(r|(1u<<i)))r|=1u<<i;
  return r;
}
constexpr auto sqrt_floor(auto x){return kth_root_floor(x,2);}
template<class F=less<>>decltype(auto)sort(auto&&a,F f={}){ranges::sort(a,f);return a;}
decltype(auto)unique(auto&&a){sort(a).erase(ranges::unique(a).begin(),a.end());return a;}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
template<class I>class Iterator{
private:
  I it_,begin_,end_;
public:
  Iterator(I it,I begin,I end):it_(it),begin_(begin),end_(end){}
  ll dist()const{return it_-begin_;}
};
}
namespace self{
template<class T>class FenwickTree{
public:
  ll n_;
  vector<T>data_;
  FenwickTree(ll n):n_(n),data_(n){}
  void add(ll i,T x){
    assert(0<=i&&i<n_);
    i++;
    while(i<=n_){
      data_[i-1]+=x;
      i+=i&-i;
    }
  }
  T sum(ll l,ll r)const{
    assert(0<=l&&l<=r&&r<=n_);
    T res=0;
    while(r>0)res+=data_[r-1],r-=r&-r;
    while(l>0)res-=data_[l-1],l-=l&-l;
    return res;
  }
};
}
namespace self{
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>constexpr int depth=0;
template<class T>struct core_t_helper{using type=T;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  static constexpr int D=depth<V>+1;
  using C=core_t<V>;
  using vector<V>::vector;
  void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else{ }}
  static auto make(ll n,const auto&...a){
    if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
    else { }
  }
  ll size()const{return vector<V>::size();}
  auto first_true(const V&x,auto&&f)const{
    auto b=this->begin(),e=this->end();
    auto p=partition_point(b,e,[&x,&f](const V&v){return !f(x,v);});
    return Iterator{p,b,e};
  }
  auto first_ge(const V&x)const{return first_true(x,[](auto&x,auto&e){return x<=e;});}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
auto zip(auto&...a){auto v=(a^...);unique(v);([&](auto&u){fe(u,e)e=v.first_ge(e).dist();}(a),...);return v;}
}
namespace self{
template<class T,class U>T sum_pair_project_first(const vec<U>&a){
  ll n=a.size();
  T res=0;
  fo(i,n)res+=T(n-1-i)*a[i];
  return res;
}
template<class T,class U>T sum_pair_project_second(const vec<U>&a){
  T res=0;
  fo(i,a.size())res+=T(i)*a[i];
  return res;
}
template<class T,class U>T sum_pair_mod(vec<U>a){
  T A=sum_pair_project_second<T>(a);

  auto z=zip(a);
  ll N=a.size(),K=z.size();
  auto V=z.back();
  auto R=sqrt_floor(V);
  FenwickTree<T>fw(K);

  T res=0;
  vec<T>F(R+1);
  of(i,N){
    auto x=z[a[i]];
    if(x<=R){
      res+=x*F[x];
    }
    else{
      fo(q,1,V/x+1){
        ll l=z.first_ge(x*q).dist();
        res+=x*fw.sum(l,K);
      }
    }

    fo(d,1,R+1)F[d]+=x/d;
    fw.add(a[i],1);
  }
  return A-res;
}
}
template<ostream&o=cout>void self::pp(auto&&...a){const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}
void self::main(){
  LL(N);
  VL(N,a);
  sort(a);
  use_ml1000000007
  pp(sum_pair_project_first<ml>(a)-sum_pair_mod<ml>(a));
}