結果

問題 No.14 最小公倍数ソート
ユーザー fumiphysfumiphys
提出日時 2020-04-05 17:11:47
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 44 ms / 5,000 ms
コード長 4,334 bytes
コンパイル時間 1,827 ms
コンパイル使用メモリ 180,336 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-03 08:16:00
合計ジャッジ時間 3,168 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 6 ms
6,940 KB
testcase_04 AC 42 ms
6,940 KB
testcase_05 AC 23 ms
6,940 KB
testcase_06 AC 25 ms
6,944 KB
testcase_07 AC 29 ms
6,940 KB
testcase_08 AC 34 ms
6,940 KB
testcase_09 AC 40 ms
6,944 KB
testcase_10 AC 38 ms
6,940 KB
testcase_11 AC 41 ms
6,940 KB
testcase_12 AC 42 ms
6,940 KB
testcase_13 AC 44 ms
6,940 KB
testcase_14 AC 41 ms
6,940 KB
testcase_15 AC 42 ms
6,940 KB
testcase_16 AC 26 ms
6,940 KB
testcase_17 AC 22 ms
6,944 KB
testcase_18 AC 15 ms
6,940 KB
testcase_19 AC 33 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

map<int, int> mp[10010];

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<int> a(n); cin >> a;
  rep(i, n){
    for(int j = 1; j * j <= a[i]; j++){
      if(a[i] % j == 0){
        mp[j][a[i]]++;
        if(j * j != a[i])mp[a[i]/j][a[i]]++;
      }
    }
  }
  vector<int> res; res.reserve(n); res.pb(a[0]);
  rep(i, n - 1){
    int x = res.back();
    for(int j = 1; j * j <= x; j++){
      if(x % j == 0){
        mp[j][x]--;
        if(mp[j][x] == 0)mp[j].erase(x);
        if(j * j != x){
          mp[x/j][x]--;
          if(mp[x/j][x] == 0)mp[x/j].erase(x);
        }
      }
    }
    int mini = inf, nex = inf;
    for(int j = 1; j * j <= x; j++){
      if(x % j == 0){
        auto itr = mp[j].begin();
        if(itr != mp[j].end()){
          if(itr->first / j < mini){
            mini = itr->first / j;
            nex = itr->first;
          }else if(itr->first / j == mini){
            chmin(nex, itr->first);
          }
        }
        if(j * j != x){
          auto itr = mp[x/j].begin();
          if(itr != mp[x/j].end()){
            if(itr->first / (x/j) < mini){
              mini = itr->first / (x/j);
              nex = itr->first;
            }else if(itr->first / (x/j) == mini){
              chmin(nex, itr->first);
            }
          }
        }
      }
    }
    res.pb(nex);
  }
  cout << res << endl;
  return 0;
}
0