結果
| 問題 | No.2249 GCDistance |
| ユーザー |
 eQe
|
| 提出日時 | 2025-01-25 18:21:39 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 868 ms / 5,000 ms |
| コード長 | 5,713 bytes |
| コンパイル時間 | 5,338 ms |
| コンパイル使用メモリ | 332,960 KB |
| 実行使用メモリ | 289,240 KB |
| 最終ジャッジ日時 | 2025-01-25 18:21:59 |
| 合計ジャッジ時間 | 17,022 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 10 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;namespace my{#define eb emplace_back#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)#define FO(n) for(ll ij=n;ij-->0;)#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}using ll=long long;constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;if(s)r[2]*=-1;return r;}constexpr char newline=10;constexpr char space=32;auto ceil(auto x,auto y){if(y<0)x=-x,y=-y;return x<=0?x/y:(x-1)/y+1;}auto max(auto...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}template<class A,class B>struct pair{A a;B b;pair()=default;pair(A a,B b):a(a),b(b){}pair(const std::pair<A,B>&p):a(p.first),b(p.second){}auto operator<=>(const pair&)const=default;pair operator+(const pair&p)const{return{a+p.a,b+p.b};}friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;}friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}};template<class T,class U>ostream&operator<<(ostream&o,const std::pair<T,U>&p){return o<<p.first<<space<<p.second;}template<ll k>auto pack_kth(const auto&...a){return get<k>(make_tuple(a...));}template<class T,size_t...I>auto pack_slice_impl(index_sequence<I...>, const auto&...a){return array<T,sizeof...(I)>{get<I>(forward_as_tuple(a...))...};}template<class T,size_t n>auto pack_slice(const auto&...a){return pack_slice_impl<T>(make_index_sequence<n>{},a...);}template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;template<class T>struct vec_attr{using core_type=T;static constexpr int rank=0;};template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int rank=vec_attr<typename V::value_type>::rank+1;};template<class T>using core_t=vec_attr<T>::core_type;template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}template<class V>struct vec:vector<V>{using vector<V>::vector;vec(const vector<V>&v){vector<V>::operator=(v);}template<class...A>requires(sizeof...(A)>=3)vec(A...a){const ll n=sizeof...(a)-1;auto t=pack_slice<ll,n>(a...);ll s[n];fo(i,n)s[i]=t[i];*this=make_vec(s,pack_kth<n>(a...));}template<class T,ll n,ll i=0>static auto make_vec(const ll(&s)[n],T x){if constexpr(i==n-1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}vec operator^(const vec&u)const{return vec{*this}^=u;}vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}vec operator+(const vec&u)const{return vec{*this}+=u;}vec operator-(const vec&u)const{return vec{*this}-=u;}vec&operator++(){fe(*this,e)++e;return*this;}vec&operator--(){fe(*this,e)--e;return*this;}vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}ll size()const{return vector<V>::size();}auto scan(const auto&f)const{pair<core_t<V>,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}auto max()const{return scan([](auto&a,const auto&b){a<b?a=b:0;}).a;}vec zeta()const{vec v=*this;if constexpr(vectorial<V>)fe(v,e)e=e.zeta();fo(i,v.size()-1)v[i+1]+=v[i];return v;}};template<ll rank,class T>struct tensor_helper{using type=vec<typename tensor_helper<rank-1,T>::type>;};template<class T>struct tensor_helper<0,T>{using type=T;};template<ll rank,class T>using tensor=typename tensor_helper<rank,T>::type;template<class...A>requires(sizeof...(A)>=2)vec(A...a)->vec<tensor<sizeof...(a)-2,remove_reference_t<decltype(get<sizeof...(a)-1>(declval<tuple<A...>>()))>>>;vec(ll)->vec<ll>;void lin(auto&...a){(cin>>...>>a);}template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}ll f(ll D,ll x){return max(ceil(D,x)-1,0);}ll totient_prime_pow(ll p,int8_t,ll pk){return(pk-pk/p);}template<class T>struct linear_sieve{ll n;vec<int>lpf;vec<int8_t>lpf_ord;vec<int>lpf_pow;vec<int>lpf_pow_except;vec<int>primes;linear_sieve(ll n):n(n){lpf.resize(n+1,-1);lpf_ord.resize(n+1);lpf_pow.resize(n+1);lpf_pow_except.resize(n+1);lpf[1]=lpf_ord[1]=lpf_pow[1]=lpf_pow_except[1]=1;fo(i,2,n+1){if(lpf[i]==-1)primes.eb(lpf[i]=i);fe(primes,p){if(p*i>n||p>lpf[i])break;lpf[p*i]=p;}int j=i/lpf[i];lpf_ord[i]=lpf_ord[j]*(lpf[i]==lpf[j])+1;lpf_pow[i]=((lpf_pow[j]-1)*(lpf[i]==lpf[j])+1)*lpf[i];lpf_pow_except[i]=i/lpf_pow[i];}}auto multiplicative_function_enumerate(const auto&f)const{vec<T>r(n+1);r[1]=1;fo(i,2,n+1)r[i]=f(lpf[i],lpf_ord[i],lpf_pow[i])*r[lpf_pow_except[i]];return r;}auto totient_enumerate()const{return multiplicative_function_enumerate(totient_prime_pow);}};single_testcasevoid solve(){LL(T);auto tot_sum=linear_sieve<ll>(1e7).totient_enumerate().zeta();fo(T){LL(N);ll s=tot_sum[N]-1;ll t=N*(N-1)/2-s;pp(s+t*2);}}}