#466720 (C++17) No.1029 JJOOII 3

提出ソース

結果

問題	No.1029 JJOOII 3
ユーザー	iiljj
提出日時	2020-04-18 22:50:29
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	44 ms / 2,000 ms
コード長	7,757 bytes
コンパイル時間	2,256 ms
コンパイル使用メモリ	220,616 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-04 00:28:57
合計ジャッジ時間	3,924 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	10 ms 6,820 KB
testcase_04	AC	12 ms 6,816 KB
testcase_05	AC	29 ms 6,820 KB
testcase_06	AC	29 ms 6,820 KB
testcase_07	AC	28 ms 6,816 KB
testcase_08	AC	31 ms 6,816 KB
testcase_09	AC	29 ms 6,820 KB
testcase_10	AC	30 ms 6,820 KB
testcase_11	AC	32 ms 6,820 KB
testcase_12	AC	28 ms 6,816 KB
testcase_13	AC	29 ms 6,816 KB
testcase_14	AC	30 ms 6,816 KB
testcase_15	AC	2 ms 6,816 KB
testcase_16	AC	2 ms 6,816 KB
testcase_17	AC	2 ms 6,816 KB
testcase_18	AC	27 ms 6,816 KB
testcase_19	AC	2 ms 6,816 KB
testcase_20	AC	3 ms 6,816 KB
testcase_21	AC	3 ms 6,820 KB
testcase_22	AC	2 ms 6,816 KB
testcase_23	AC	3 ms 6,820 KB
testcase_24	AC	3 ms 6,816 KB
testcase_25	AC	3 ms 6,820 KB
testcase_26	AC	3 ms 6,816 KB
testcase_27	AC	3 ms 6,816 KB
testcase_28	AC	3 ms 6,820 KB
testcase_29	AC	3 ms 6,816 KB
testcase_30	AC	3 ms 6,816 KB
testcase_31	AC	3 ms 6,816 KB
testcase_32	AC	42 ms 6,816 KB
testcase_33	AC	42 ms 6,816 KB
testcase_34	AC	43 ms 6,816 KB
testcase_35	AC	43 ms 6,820 KB
testcase_36	AC	44 ms 6,820 KB
testcase_37	AC	2 ms 6,816 KB
testcase_38	AC	2 ms 6,816 KB
testcase_39	AC	2 ms 6,816 KB
testcase_40	AC	2 ms 6,820 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }

/* #endregion */

struct Entity {
    ld e;
    ll cnt;
    ll cost;

    // Entity() {} // これがあるとリスト初期化ができないっぽい
    // Entity(ll x) : x(x) {}
    bool operator<(const Entity &another) const { return e < another.e; }
    bool operator==(const Entity &another) const { return e == another.e; }
    friend istream &operator>>(istream &is, Entity &entity) {
        is >> entity.e;
        return is;
    }
    friend ostream &operator<<(ostream &os, const Entity &entity) {
        os << "(" << entity.e << ", " << entity.cnt << ", " << entity.cost << ")";
        return os;
    }
};

// Problem
void solve() {
    ll n, k;
    cin >> n >> k;

    vc<string> s(n);
    vll c(n);
    REP(i, 0, n) cin >> s[i] >> c[i];

    char J = 'J', O = 'O', I = 'I';

    um<char, bool> used;
    used[J] = false;
    used[O] = false;
    used[I] = false;
    REP(i, 0, n) for (char c : s[i]) used[c] = true;
    if (!(used[J] && used[O] && used[I])) {
        cout << -1 << endl;
        return;
    }

    Entity jmax = {0, 0, 0}, omax = {0, 0, 0}, imax = {0, 0, 0};
    REP(i, 0, n) {
        um<char, ll> cntmap;
        cntmap[J] = 0;
        cntmap[O] = 0;
        cntmap[I] = 0;
        for (char c : s[i]) cntmap[c]++;
        chmax(jmax, Entity{(ld)cntmap[J] / c[i], cntmap[J], c[i]});
        chmax(omax, Entity{(ld)cntmap[O] / c[i], cntmap[O], c[i]});
        chmax(imax, Entity{(ld)cntmap[I] / c[i], cntmap[I], c[i]});
    }
    // dump(jmax, omax, imax);

    vll dp(3 * k + 1, INF);
    dp[0] = 0;
    REP(i, 0, 3 * k) { // position
        if (dp[i] == INF) continue;
        if (k - (i % k) > 1000) {
            if (i < k) {
                chmin(dp[i + jmax.cnt], dp[i] + jmax.cost);
            } else if (i < 2 * k) {
                chmin(dp[i + omax.cnt], dp[i] + omax.cost);
            } else {
                chmin(dp[i + imax.cnt], dp[i] + imax.cost);
            }
            continue;
        }
        REP(j, 0, n) { // string
            string str = s[j];
            ll cur = i;
            for (char c : str) { // character
                if (cur < k) {
                    if (c == J) cur++;
                } else if (cur < 2 * k) {
                    if (c == O) cur++;
                } else {
                    if (c == I) cur++;
                }
                if (cur == 3 * k) break;
            }
            chmin(dp[cur], dp[i] + c[j]);
        }
    }
    // dump(dp);
    cout << dp[3 * k] << endl;
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード