#403650 (C++14) No.937 Ultra Sword

提出ソース

結果

問題	No.937 Ultra Sword
ユーザー	NyaanNyaan
提出日時	2019-12-01 17:04:02
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	20 ms / 3,000 ms
コード長	8,002 bytes
コンパイル時間	1,600 ms
コンパイル使用メモリ	170,800 KB
実行使用メモリ	4,940 KB
最終ジャッジ日時	2023-08-13 15:51:39
合計ジャッジ時間	4,518 ms
ジャッジサーバーID （参考情報）	judge15 / judge10

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 4,544 KB
testcase_01	AC	9 ms 4,580 KB
testcase_02	AC	8 ms 4,536 KB
testcase_03	AC	8 ms 4,780 KB
testcase_04	AC	8 ms 4,656 KB
testcase_05	AC	18 ms 4,912 KB
testcase_06	AC	18 ms 4,804 KB
testcase_07	AC	19 ms 4,856 KB
testcase_08	AC	13 ms 4,612 KB
testcase_09	AC	12 ms 4,732 KB
testcase_10	AC	20 ms 4,892 KB
testcase_11	AC	11 ms 4,732 KB
testcase_12	AC	19 ms 4,860 KB
testcase_13	AC	18 ms 4,860 KB
testcase_14	AC	19 ms 4,920 KB
testcase_15	AC	17 ms 4,916 KB
testcase_16	AC	9 ms 4,656 KB
testcase_17	AC	10 ms 4,584 KB
testcase_18	AC	18 ms 4,804 KB
testcase_19	AC	14 ms 4,828 KB
testcase_20	AC	13 ms 4,652 KB
testcase_21	AC	19 ms 4,828 KB
testcase_22	AC	9 ms 4,752 KB
testcase_23	AC	9 ms 4,644 KB
testcase_24	AC	18 ms 4,792 KB
testcase_25	AC	17 ms 4,856 KB
testcase_26	AC	15 ms 4,856 KB
testcase_27	AC	15 ms 4,832 KB
testcase_28	AC	16 ms 4,940 KB
testcase_29	AC	8 ms 4,648 KB
testcase_30	AC	14 ms 4,912 KB
testcase_31	AC	18 ms 4,824 KB
testcase_32	AC	14 ms 4,804 KB
testcase_33	AC	18 ms 4,856 KB
testcase_34	AC	10 ms 4,536 KB
testcase_35	AC	9 ms 4,556 KB
testcase_36	AC	17 ms 4,896 KB
testcase_37	AC	9 ms 4,628 KB
testcase_38	AC	15 ms 4,808 KB
testcase_39	AC	8 ms 4,652 KB
testcase_40	AC	16 ms 4,804 KB
testcase_41	AC	12 ms 4,652 KB
testcase_42	AC	15 ms 4,812 KB
testcase_43	AC	13 ms 4,828 KB
testcase_44	AC	10 ms 4,824 KB
testcase_45	AC	11 ms 4,660 KB
testcase_46	AC	12 ms 4,560 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /** 1000000007; //*/ 998244353;
//////////


struct divisor_transform{
  template <typename T>
  static constexpr void zeta_transform(vector<T> &a){
    int N = a.size() - 1; 
    vector<int> sieve(N + 1, true);
    for(int p = 2; p <= N; p++)
      if(sieve[p])
        for(int k = 1; k * p <= N; ++k)
          sieve[k * p] = false , a[k * p] += a[k];    
  }

  template<typename T>
  static constexpr void mobius_transform(T &a){
    int N = a.size() - 1; 
    vector<int> sieve(N + 1, true);
    for(int p = 2; p <= N; p++)
      if(sieve[p])
        for(int k = N / p; k > 0; --k)
          sieve[k * p] = false , a[k * p] -= a[k];    
  }
  
  // verify 
  // https://atcoder.jp/contests/arc064/submissions/7707249
  template<typename T>
  static constexpr void zeta_transform(map<long long, T> &a){
    for(auto &x : a) for(auto &y : a){
      if(x == y) break;
      if(x.first % y.first == 0) x.second += y.second;
    }
  }
  template<typename T>
  static constexpr void mobius_transform(map<long long, T> &a){
    for(auto &x : a) for(auto &y : a){
      if(x == y) break;
      if(x.first % y.first == 0) x.second -= y.second;
    }
  }

};

// verify
// https://atcoder.jp/contests/agc038/submissions/7683063
// https://www.codechef.com/viewsolution/26767783
struct multiple_transform{
  template <typename T>
  static constexpr void zeta_transform(vector<T> &a){
    int N = a.size() - 1;
    vector<int> sieve(N + 1, true);
    for(int p = 2; p <= N; ++p)
      if(sieve[p])
        for(int k = N / p; k > 0; --k)
          sieve[k * p] = false , a[k] += a[k * p];
  }
  template <typename T>
  static constexpr void mobius_transform(vector<T> &a){
    int N = a.size() - 1;
    vector<int> sieve(N + 1, true);
    for(int p = 2; p <= N; ++p)
      if(sieve[p])
        for(int k = 1; k * p <= N; ++k)
          sieve[k * p] = false , a[k] -= a[k * p];
  }

  template<typename T>
  static constexpr void zeta_transform(map<long long, T> &a){
    for(auto it=a.rbegin(); it!=a.rend(); it++)
      for(auto it2=a.rbegin(); it2!=it; it2++)
        if(it2->first % it->first == 0)
          it->second += it2->second;
  }
  template<typename T>
  static constexpr void mobius_transform(map<long long, T> &a){
    for(auto it=a.rbegin(); it!=a.rend(); it++)
      for(auto it2=a.rbegin(); it2!=it; it2++)
        if(it2->first % it->first == 0)
          it->second -= it2->second;
  }

};

template<typename T>
static constexpr vector<T> mobius_function(int N){
  vector<T> a(N + 1 , 0);
  a[1] = 1;
  divisor_transform::mobius_transform(a);
  return a;
}

template<int N>
struct constexpr_mobius_function{
  int mobius[N + 1] , sieve[N + 1];
  constexpr constexpr_mobius_function(): mobius() , sieve(){
    for(int i=1; i<=N; i++) sieve[i] = 1, mobius[i] = 0;
    mobius[1] = 1;
    for(int p = 2; p <= N; p++)
      if(sieve[p])
        for(int k = N / p; k > 0; --k)
          sieve[k * p] = false , mobius[k * p] -= mobius[k];    
  }
  const int& operator[](int i)const{return mobius[i];}
};

// N = 1000000 , pnum = 78498
template<int N,int pnum> struct constexpr_prime{
  int prime[pnum];
  int sieve[N + 1];
  constexpr_prime() : prime() , sieve() {
    for(int i=2;i<=N;i++) sieve[i]=1;
    int idx = 0;
    for(long long p = 2; p <= N; p++){
      if(sieve[p]){
        prime[idx++] = p;
        for(long long j = p * p; j <= N; j += p) sieve[j] = 0;
      }
    }
  }
  const long long& operator[](long long i) const{return prime[i];}
};

// verify
template<typename T,typename F>
static constexpr unordered_map<long long,T> divisor_zeta_transform(long long N, F f){
  // factorization
  unordered_map<long long,long long> factors;
  {
    long long M = N;
    for(long long i = 2; i * i <= M; i++)
      while(M % i == 0) factors[i]++ , M /= i;
    if(M != 1) factors[M]++;
  }
  unordered_map<long long,T> ret;
  ret.emplace(1 , 1);
  for(auto &d : factors){
    auto ret2 = ret;
    T prev = 1;
    for(long long i = 1 , cur = d.first; 
      i <= d.second;
      i++ , cur *= d.first){
      T val = ( prev += f(cur) );
      for(auto &x : ret) 
        ret2.emplace(x.first*cur , x.second*val);
    }
    swap(ret , ret2);
  }
  return ret;
}

// verify
// https://onlinejudge.u-aizu.ac.jp/status/users/NyaanNyaan/submissions/1/NTL_1_D/judge/3892694/C++14
// https://atcoder.jp/contests/abc020/submissions/7695313
template<typename T,typename F>
static constexpr unordered_map<long long,T> divisor_mobius_transform(long long N, F f){
  // factorization
  unordered_map<long long,long long> factors;
  {
    long long M = N;
    for(long long i = 2; i * i <= M; i++)
      while(M % i == 0) factors[i]++ , M /= i;
    if(M != 1) factors[M]++;
  }
  unordered_map<long long,T> ret;
  ret.emplace(1 , 1);
  for(auto &d : factors){
    auto ret2 = ret;
    for(long long i = 1,cur = d.first , prev = 1; 
      i <= d.second; 
      i++ , cur *= d.first , prev *= d.first){
      T val = f(cur) - f(prev);
      for(auto &x : ret) 
        ret2.emplace(x.first*cur , x.second*val);
    }
    swap(ret , ret2);
  }
  return ret;
}

ll f2_gcd(ll x,ll y){
  if(x<y) swap(x,y);
  while(y){
    ll p=__builtin_clz(x);
    ll q=__builtin_clz(y);
    x^=y<<(q-p);
    if(x<y) swap(x,y);
  }
  return x;
}

void solve(){
  ini(N);
  vi v(N); in(v);

  ll g = v[0];
  each(x , v) g = f2_gcd(x , g);
  trc(g);

  vl a(131073);
  each(x , v) a[x] += x;

  multiple_transform::zeta_transform(a);
  ll ans = a[1];
  for(int i = 1 ; i < (1 << 17); i ++ ){
    ll res = 0;
    for(int bit = 0; bit < 17; bit++){
      if( (i >> bit) & 1 ) res ^= g << bit;
    }
    if(res > 1 << 17) continue;
    amin(ans , (a[1] - a[res]) + a[res] / res);
  }
  out(ans);
}

yukicoder

結果

テストケース

ソースコード