結果
問題 | No.2221 Set X |
ユーザー | ir5 |
提出日時 | 2024-06-20 01:24:33 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,381 bytes |
コンパイル時間 | 1,915 ms |
コンパイル使用メモリ | 146,228 KB |
実行使用メモリ | 15,772 KB |
最終ジャッジ日時 | 2024-06-20 01:24:53 |
合計ジャッジ時間 | 18,306 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,880 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 3 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 18 ms
6,940 KB |
testcase_09 | AC | 5 ms
6,940 KB |
testcase_10 | AC | 26 ms
6,940 KB |
testcase_11 | AC | 13 ms
6,944 KB |
testcase_12 | AC | 14 ms
6,940 KB |
testcase_13 | AC | 21 ms
6,940 KB |
testcase_14 | AC | 48 ms
6,944 KB |
testcase_15 | AC | 26 ms
6,944 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | TLE | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | TLE | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif namespace solver { int n; vector<ll> vs; void read() { cin >> n; vs.resize(n); for (int i : range(n)) cin >> vs[i]; } ll xmin = 0, fmin = 1LL << 60; void update(ll x, ll f) { if (f < fmin) { dump(x << " " << f); fmin = f; xmin = x; } } void run() { const ll L = 100; const ll M = 10000000; // const ll L = 2; // const ll M = 1000; for (ll x = 1; x <= 100; ++x) { set<ll> st; for (int i : range(n)) st.insert(vs[i] / x); ll f = (x + 1) * st.size(); update(x, f); } vector<int> seen(M / L + 10); for (ll x = 100; x * x <= 2 * M; ++x) { ll uni = 0; for (int i : range(n)) { ll div = vs[i] / x; if (seen[div] != x) seen[div] = x, uni++; } ll f = (x + 1) * uni; update(x, f); } cout << xmin << endl; cout << fmin << endl; } } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } solver::run(); }