結果
問題 | No.2718 Best Consonance |
ユーザー | hitonanode |
提出日時 | 2024-04-05 23:38:47 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,407 ms / 4,000 ms |
コード長 | 8,126 bytes |
コンパイル時間 | 1,977 ms |
コンパイル使用メモリ | 188,456 KB |
実行使用メモリ | 7,036 KB |
最終ジャッジ日時 | 2024-10-02 12:54:45 |
合計ジャッジ時間 | 25,534 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
6,904 KB |
testcase_01 | AC | 123 ms
7,032 KB |
testcase_02 | AC | 123 ms
6,908 KB |
testcase_03 | AC | 121 ms
6,904 KB |
testcase_04 | AC | 121 ms
7,032 KB |
testcase_05 | AC | 123 ms
7,032 KB |
testcase_06 | AC | 127 ms
6,944 KB |
testcase_07 | AC | 127 ms
6,904 KB |
testcase_08 | AC | 128 ms
6,900 KB |
testcase_09 | AC | 134 ms
6,840 KB |
testcase_10 | AC | 128 ms
6,832 KB |
testcase_11 | AC | 126 ms
6,940 KB |
testcase_12 | AC | 128 ms
7,036 KB |
testcase_13 | AC | 126 ms
6,912 KB |
testcase_14 | AC | 601 ms
6,956 KB |
testcase_15 | AC | 598 ms
6,944 KB |
testcase_16 | AC | 641 ms
6,908 KB |
testcase_17 | AC | 586 ms
6,944 KB |
testcase_18 | AC | 607 ms
6,912 KB |
testcase_19 | AC | 600 ms
6,908 KB |
testcase_20 | AC | 706 ms
7,036 KB |
testcase_21 | AC | 641 ms
6,908 KB |
testcase_22 | AC | 617 ms
6,908 KB |
testcase_23 | AC | 503 ms
6,816 KB |
testcase_24 | AC | 1,346 ms
6,908 KB |
testcase_25 | AC | 1,316 ms
6,912 KB |
testcase_26 | AC | 1,290 ms
6,908 KB |
testcase_27 | AC | 1,245 ms
7,036 KB |
testcase_28 | AC | 1,287 ms
6,908 KB |
testcase_29 | AC | 1,285 ms
6,908 KB |
testcase_30 | AC | 1,407 ms
7,036 KB |
testcase_31 | AC | 1,302 ms
6,904 KB |
testcase_32 | AC | 1,267 ms
6,912 KB |
testcase_33 | AC | 1,333 ms
6,912 KB |
testcase_34 | AC | 122 ms
6,816 KB |
testcase_35 | AC | 33 ms
6,900 KB |
testcase_36 | AC | 72 ms
7,036 KB |
testcase_37 | AC | 126 ms
6,904 KB |
testcase_38 | AC | 76 ms
6,904 KB |
testcase_39 | AC | 126 ms
6,848 KB |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iostream> #include <limits> #include <list> #include <map> #include <memory> #include <numeric> #include <optional> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); } template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec); template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr); template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec); template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa); template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec); template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec); template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa); template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp); template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp); template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl); template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif #include <atcoder/segtree> int op(int l, int r) { return max(l, r); } int e() { return -1; } int main() { int N; cin >> N; constexpr int B = 201010; vector<int> dp(B); int ret = 0; REP(i, N) { int a, b; cin >> a >> b; chmax(ret, min(dp.at(a), b)); chmax(dp.at(a), b); } for (int g = 1; g < B; ++g) { vector<int> ve; for (int i = 0; i < B; i += g) ve.push_back(dp.at(i)); atcoder::segtree<int, op, e> seg(ve); lint ng = 1e9 + 1, ok = ret; const int n = ve.size(); while (ng > ok + 1) { const lint c = (ng + ok) / 2; bool good = false; for (int i = 1; i < (int)ve.size(); ++i) { const lint ai = ve.at(i); if (!ai) continue; int j = floor_div(ai, c) + 1; chmin(j, n); const lint lb = lint(c) * i; if (j > i) { if (seg.prod(i + 1, j) >= lb) { good = true; } if (seg.prod(0, i) >= lb) { good = true; } } else { if (seg.prod(0, j) >= lb) { good = true; } } } if (good) { ok = c; } else { ng = c; } } chmax(ret, (int)ok); } cout << ret << '\n'; }