結果
問題 | No.2718 Best Consonance |
ユーザー | dyktr_06 |
提出日時 | 2024-04-06 04:09:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,803 bytes |
コンパイル時間 | 2,473 ms |
コンパイル使用メモリ | 225,332 KB |
実行使用メモリ | 96,000 KB |
最終ジャッジ日時 | 2024-10-01 03:41:57 |
合計ジャッジ時間 | 15,006 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 8 ms
12,664 KB |
testcase_01 | AC | 8 ms
12,544 KB |
testcase_02 | AC | 8 ms
12,672 KB |
testcase_03 | AC | 8 ms
12,660 KB |
testcase_04 | AC | 9 ms
12,672 KB |
testcase_05 | AC | 8 ms
12,616 KB |
testcase_06 | AC | 8 ms
12,544 KB |
testcase_07 | AC | 8 ms
12,544 KB |
testcase_08 | AC | 7 ms
12,556 KB |
testcase_09 | AC | 9 ms
12,776 KB |
testcase_10 | AC | 8 ms
12,732 KB |
testcase_11 | AC | 8 ms
12,920 KB |
testcase_12 | AC | 8 ms
12,848 KB |
testcase_13 | AC | 9 ms
12,864 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 8 ms
12,652 KB |
testcase_35 | AC | 8 ms
12,672 KB |
testcase_36 | AC | 52 ms
17,848 KB |
testcase_37 | AC | 8 ms
12,416 KB |
testcase_38 | AC | 51 ms
17,720 KB |
testcase_39 | AC | 7 ms
12,544 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } namespace prime{ template <typename T> bool isPrime(T n){ switch(n) { case 0: // fall-through case 1: return false; case 2: return true; } if(n % 2 == 0) return false; for(T i = 3; i*i <= n; i += 2){ if(n % i == 0){ return false; } } return true; } template <typename T> vector<pair<T, T>> factorize(T n) { vector<pair<T, T>> ret; for (T i = 2; i * i <= n; i++) { if (n % i != 0) continue; T tmp = 0; while (n % i == 0) { tmp++; n /= i; } ret.push_back(make_pair(i, tmp)); } if (n != 1) ret.push_back(make_pair(n, 1)); return ret; } template <typename T> vector<T> divisor(T n){ T rt = sqrt(n); vector<T> res, resB; for(T i = 1; i * i <= n; i++){ if(n % i == 0){ res.push_back(i); T j = n / i; if(j != rt){ resB.push_back(j); } } } for(int i = (int) resB.size() - 1; i >= 0; i--){ res.push_back(resB[i]); } return res; } template <typename T> vector<T> sieve(T n){ vector<T> c(n+1); for(int i = 2; i <= n; i++){ if(c[i] != 0) continue; for(int j = i; j <= n; j += i){ c[j] += 1; } } return c; } } void input(){ } void solve(){ ll n; in(n); vll a(n), b(n); rep(i, n) in(a[i], b[i]); ll ans = 0; // naive // rep(i, n){ // rep(j, i + 1, n){ // ll l = lcm(a[i], a[j]); // ll mn = min(a[i] * b[i], a[j] * b[j]); // chmax(ans, mn / l); // } // } vector<vll> mx(200001); using T = tuple<ll, ll, ll>; vector<vector<T>> mx2(200001); rep(i, n){ mx[a[i]].push_back(a[i] * b[i]); } rep(i, 200001) RSort(mx[i]); rep(i, 1, 200001){ if((ll) mx[i].size() == 0) continue; if((ll) mx[i].size() >= 2){ chmax(ans, min(mx[i][0], mx[i][1]) / i); } for(auto x : prime::divisor(i)){ mx2[i / x].emplace_back((mx[i][0] / x) * i, mx[i][0] / x, i); } } rep(i, 1, 200001){ ll siz = mx2[i].size(); RSort(mx2[i]); ll mn = INF; rep(j, siz){ auto [x1, y1, z1] = mx2[i][j]; chmax(ans, y1 / mn); chmin(mn, z1); } } out(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }