#841102 (C++17) No.2221 Set X

• 問題: No.2221 Set X
• ユーザー: rniya
• 提出日時: 2023-02-17 22:11:22
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 348 ms / 2,000 ms
• コード長: 2,971 bytes
• コンパイル時間: 2,064 ms
• コンパイル使用メモリ: 205,964 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-19 13:21:15
• 合計ジャッジ時間: 8,022 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	4 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	114 ms; 5,376 KB
testcase_17	AC	44 ms; 5,376 KB
testcase_18	AC	128 ms; 5,376 KB
testcase_19	AC	39 ms; 5,376 KB
testcase_20	AC	75 ms; 5,376 KB
testcase_21	AC	16 ms; 5,376 KB
testcase_22	AC	21 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	14 ms; 5,376 KB
testcase_25	AC	9 ms; 5,376 KB
testcase_26	AC	319 ms; 5,376 KB
testcase_27	AC	343 ms; 5,376 KB
testcase_28	AC	348 ms; 5,376 KB
testcase_29	AC	199 ms; 5,376 KB
testcase_30	AC	293 ms; 5,376 KB
testcase_31	AC	325 ms; 5,376 KB
testcase_32	AC	66 ms; 5,376 KB
testcase_33	AC	30 ms; 5,376 KB
testcase_34	AC	30 ms; 5,376 KB
testcase_35	AC	31 ms; 5,376 KB
testcase_36	AC	218 ms; 5,376 KB
testcase_37	AC	267 ms; 5,376 KB
testcase_38	AC	220 ms; 5,376 KB
testcase_39	AC	288 ms; 5,376 KB
testcase_40	AC	296 ms; 5,376 KB
testcase_41	AC	294 ms; 5,376 KB
testcase_42	AC	293 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

// f(X) >= X + 1
// f(1) <= 2N より X <= 2N - 1 だけで OK

const int SQRT = 1024;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;

    sort(ALL(A));
    int ans = INF, argmin = 0;
    for (int k = 1; k < SQRT; k++) {
        ll sum = 0;
        for (int i = 0, pre = -1; i < N; i++) {
            int nxt = A[i] / k;
            if (pre != nxt) sum += k + 1;
            if (sum >= ans) break;
            pre = nxt;
        }
        if (chmin(ans, sum)) argmin = k;
    }

    for (int k = SQRT; k < 2 * N; k++) {
        ll sum = 0;
        for (int i = 0; i < N;) {
            sum += k + 1;
            if (sum >= ans) break;
            int nxt = A[i] / k * k + k;
            i = lwb(A, nxt);
        }
        if (chmin(ans, sum)) argmin = k;
    }

    cout << argmin << '\n' << ans << '\n';
    return 0;
}