#1181827 (C++23) No.3663 LCM Decomposition

• 問題: No.3663 LCM Decomposition
• ユーザー: igeee
• 提出日時: 2026-08-31 22:38:32
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 6,606 bytes
• コンパイル時間: 5,570 ms
• コンパイル使用メモリ: 423,564 KB
• 実行使用メモリ: 9,808 KB
• 最終ジャッジ日時: 2026-08-31 22:38:41
• 合計ジャッジ時間: 8,515 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_0

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

ソースコード

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
#define fr first
#define sc second
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;

//参照渡しで値を作成して渡す
void Maketest(ll &n,ll &l,ll &r){
//配列を渡すときは最初に.clear()をしておく
  random_device seed_gen;
  mt19937_64 rnd(seed_gen());
  
  uniform_int_distribution<ll> da(1, 10000);
  uniform_int_distribution<ll> db(0, lpow(10,9));
  n = da(rnd);
  l = da(rnd);
  r = da(rnd);
  if(l > r)swap(l,r);

  uniform_int_distribution<ll> dc(0, 1);
  uniform_int_distribution<ll> dd(0, 1);
}



//素因数分解
map<ll,ll> enumpr(ll n) {
 map<ll,ll> V;
 for(ll i=2;i*i<=n;i++) {
    while(n%i==0){
      V[i]++;
      n/=i;
    } 
  }
 if(n>1) V[n]++;
 return V;
}

//約数列挙
vector<ll> divisor(ll n){
  vector<ll> ret;
  for(ll i = 1;i * i <= n;i++){
    if(n % i == 0){
      ret.push_back(i);
      if(i * i != n)ret.push_back(n/i);
    }
  }
  //昇順
  sort(all(ret));
  return ret;
}

vll solve(ll n,ll l,ll r){
  map<ll,ll> mp = enumpr(n);
  vll div = divisor(n);
  ll li = lower_bound(all(div),l)-div.begin();
  ll ri = upper_bound(all(div),r)-div.begin();
  vvll dp(ri-li+1,vll(1<<sz(mp),-1));
  dp[0][0] = 0;

  ll t9 = lpow(10,9);
  ll las = (1<<sz(mp))-1;
  reps(z,li,ri){
    ll i = z-li;
    ll ad = 0;
    ll I = 0;
    each(p,mp){
      if(div[z] % lpow(p.first,p.second)==0){
        ad |=1<<I;
      }
      ++I;
    }
    rep(j,1<<sz(mp))if(dp[i][j] >= 0){
      chmax(dp[i+1][j],dp[i][j]);//選ばない
      ll nj = j|ad;
      if(dp[i][j]==0){
        chmax(dp[i+1][nj],dp[i][j]+div[z]);
      }else if(dp[i][j] <= t9){
        chmax(dp[i+1][nj],dp[i][j]+div[z]*(t9+1));
      }else{//2つ決まってる
        if(nj == las && dp[i][j] > t9){
          //dekiru
          ll A = dp[i][j]%(t9+1);
          ll B = dp[i][j]/(t9+1);
          ll C =  div[z];
          assert(A < B && B < C && l <= A && C <= r);
          assert(lcm(lcm(A,B),C)==n);
          
          return {A,B,C};
        }
      }
    }
  }
  return {-1};
}
 



vll correct(ll n,ll l,ll r){
  //答えの型注意
  repsn(i,l,r){
    repsn(j,i+1,r){
      repsn(k,j+1,r){
        if(lcm(i,lcm(j,k))==n){
          return {i,j,k};
        }
      }
    }
  }
  return {-1};
}

void test(){
  rep(z,1000000000){
    ll n,l,r;
    Maketest(n,l,r);
    vll a1 = solve(n,l,r);
    vll a2 = solve(n,l,r);
    if(a1[0]* a2[0] < 0){
      print(n,l,r);
      print(a1);
      print(a2);
      print("-------------");
    }
  }
}

int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  bool istest = 0;
  if(istest){
    test();
  }else{
    LL(t);
    while(t--){
      LL(n,l,r);
      vll ret = solve(n,l,r);
      cout << ret  << endl;
    }
  }
}