結果
問題 | No.2718 Best Consonance |
ユーザー | tokusakurai |
提出日時 | 2024-04-05 22:21:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 519 ms / 4,000 ms |
コード長 | 4,951 bytes |
コンパイル時間 | 2,939 ms |
コンパイル使用メモリ | 212,872 KB |
実行使用メモリ | 41,080 KB |
最終ジャッジ日時 | 2024-04-10 10:52:07 |
合計ジャッジ時間 | 19,522 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
31,584 KB |
testcase_01 | AC | 251 ms
31,516 KB |
testcase_02 | AC | 251 ms
31,576 KB |
testcase_03 | AC | 256 ms
31,580 KB |
testcase_04 | AC | 257 ms
31,576 KB |
testcase_05 | AC | 255 ms
31,680 KB |
testcase_06 | AC | 249 ms
31,512 KB |
testcase_07 | AC | 251 ms
31,652 KB |
testcase_08 | AC | 255 ms
31,680 KB |
testcase_09 | AC | 258 ms
31,716 KB |
testcase_10 | AC | 248 ms
31,700 KB |
testcase_11 | AC | 257 ms
31,696 KB |
testcase_12 | AC | 253 ms
31,696 KB |
testcase_13 | AC | 251 ms
31,696 KB |
testcase_14 | AC | 472 ms
37,280 KB |
testcase_15 | AC | 414 ms
37,936 KB |
testcase_16 | AC | 432 ms
36,716 KB |
testcase_17 | AC | 383 ms
35,280 KB |
testcase_18 | AC | 441 ms
38,160 KB |
testcase_19 | AC | 400 ms
37,728 KB |
testcase_20 | AC | 467 ms
37,164 KB |
testcase_21 | AC | 454 ms
38,180 KB |
testcase_22 | AC | 466 ms
37,444 KB |
testcase_23 | AC | 381 ms
35,044 KB |
testcase_24 | AC | 513 ms
39,804 KB |
testcase_25 | AC | 511 ms
40,448 KB |
testcase_26 | AC | 514 ms
40,056 KB |
testcase_27 | AC | 509 ms
39,880 KB |
testcase_28 | AC | 518 ms
40,444 KB |
testcase_29 | AC | 502 ms
39,716 KB |
testcase_30 | AC | 502 ms
40,444 KB |
testcase_31 | AC | 508 ms
40,700 KB |
testcase_32 | AC | 519 ms
39,860 KB |
testcase_33 | AC | 512 ms
41,080 KB |
testcase_34 | AC | 247 ms
31,624 KB |
testcase_35 | AC | 248 ms
31,672 KB |
testcase_36 | AC | 311 ms
32,592 KB |
testcase_37 | AC | 241 ms
31,508 KB |
testcase_38 | AC | 295 ms
32,592 KB |
testcase_39 | AC | 249 ms
31,596 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> void err_print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cerr << v[i] + x << ' '; cerr << endl; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename T> void reorder(vector<T> &a, const vector<int> &ord) { int n = a.size(); vector<T> b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template <typename T> T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template <typename T> T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; void solve() { int N; cin >> N; const int MAX = 200000; vector<vector<int>> ds(MAX + 1); rep2(i, 1, MAX + 1) { for (int j = 0; j <= MAX; j += i) ds[j].eb(i); } vector<vector<int>> bs(MAX + 1); rep(i, N) { int a, b; cin >> a >> b; bs[a].eb(b); } vector<pll> p; rep(i, MAX + 1) { sort(rall(bs[i])); rep(j, min(2, sz(bs[i]))) p.eb(i, bs[i][j]); } sort(all(p), [&](pll p1, pll p2) { return p1.first * p1.second > p2.first * p2.second; // }); vector<ll> mi(MAX + 1, INF); ll ans = -INF; for (auto [a, b] : p) { ll c = a * b; each(g, ds[a]) { ll x = mi[g]; if (x != INF) { ll l = (a * x) / g; chmax(ans, floor(c, l)); } } each(g, ds[a]) chmin(mi[g], a); } cout << ans << '\n'; } int main() { int T = 1; // cin >> T; while (T--) solve(); }