結果

問題 No.14 最小公倍数ソート
ユーザー fumiphysfumiphys
提出日時 2019-08-02 15:34:37
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 62 ms / 5,000 ms
コード長 4,799 bytes
コンパイル時間 1,775 ms
コンパイル使用メモリ 176,312 KB
実行使用メモリ 8,416 KB
最終ジャッジ日時 2023-09-18 18:15:32
合計ジャッジ時間 3,503 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 6 ms
4,592 KB
testcase_04 AC 58 ms
8,096 KB
testcase_05 AC 31 ms
6,428 KB
testcase_06 AC 34 ms
6,200 KB
testcase_07 AC 40 ms
7,012 KB
testcase_08 AC 48 ms
7,748 KB
testcase_09 AC 56 ms
8,008 KB
testcase_10 AC 53 ms
8,068 KB
testcase_11 AC 58 ms
7,744 KB
testcase_12 AC 59 ms
7,904 KB
testcase_13 AC 62 ms
7,732 KB
testcase_14 AC 57 ms
8,416 KB
testcase_15 AC 58 ms
8,352 KB
testcase_16 AC 32 ms
6,764 KB
testcase_17 AC 28 ms
6,172 KB
testcase_18 AC 18 ms
5,400 KB
testcase_19 AC 44 ms
7,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#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 vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

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>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template<typename T>
T gcd(T a, T b) {
  if(a > b)return gcd(b, a);
  if(a == 0)return b;
  return gcd(b % a, a);
}

set<P> st[10010];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); vector<int> a(n); cin >> a;
  FOR(i, 1, n){
    for(int j = 1; j * j <= a[i]; j++){
      if(a[i] % j == 0){
        st[j].insert(mk(a[i], i));
        st[a[i] / j].insert(mk(a[i], i));
      }
    }
  }
  vector<int> res(n, 0);
  int curr = 0;
  rep(i, n){
    res[i] = a[curr];
    if(i + 1 == n)break;
    int maxi = inf;
    int idx = -1;
    for(int j = 1; j * j <= res[i]; j++){
      if(res[i] % j == 0){
        auto iitr = st[j].begin();
        if(iitr != st[j].end()){
          int at = iitr->second;
          int num = iitr->first;
          int tmp = res[i] * num / gcd(res[i], num);
          if(maxi > tmp){
            maxi = tmp;
            idx = at;
          }else if(maxi == tmp){
            if(a[idx] > a[at]){
              idx = at;
            }
          }
        }
        iitr = st[res[i]/j].begin();
        if(iitr != st[res[i]/j].end()){
          int at = iitr->second;
          int num = iitr->first;
          int tmp = res[i] * num / gcd(res[i], num);
          if(maxi > tmp){
            maxi = tmp;
            idx = at;
          }else if(maxi == tmp){
            if(a[idx] > a[at]){
              idx = at;
            }
          }
        }
      }
    }
    for(int j = 1; j * j <= a[idx]; j++){
      if(a[idx] % j == 0){
        st[j].erase(mk(a[idx], idx));
        st[a[idx]/j].erase(mk(a[idx], idx));
      }
    }
    curr = idx;
  }
  cout << res << endl;
  return 0;
}
0