#642266 (C++17) No.1460 Max of Min

提出ソース

結果

問題	No.1460 Max of Min
ユーザー	haruki_K
提出日時	2021-04-02 18:12:18
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	213 ms / 2,000 ms
コード長	7,455 bytes
コンパイル時間	2,448 ms
コンパイル使用メモリ	208,960 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-06 03:24:11
合計ジャッジ時間	14,029 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	206 ms 6,940 KB
testcase_04	AC	208 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	208 ms 6,940 KB
testcase_07	AC	208 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	208 ms 6,940 KB
testcase_11	AC	208 ms 6,940 KB
testcase_12	AC	32 ms 6,944 KB
testcase_13	AC	133 ms 6,940 KB
testcase_14	AC	48 ms 6,944 KB
testcase_15	AC	23 ms 6,944 KB
testcase_16	AC	124 ms 6,940 KB
testcase_17	AC	70 ms 6,944 KB
testcase_18	AC	4 ms 6,944 KB
testcase_19	AC	64 ms 6,940 KB
testcase_20	AC	5 ms 6,940 KB
testcase_21	AC	11 ms 6,940 KB
testcase_22	AC	68 ms 6,940 KB
testcase_23	AC	3 ms 6,944 KB
testcase_24	AC	90 ms 6,940 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	142 ms 6,940 KB
testcase_27	AC	24 ms 6,944 KB
testcase_28	AC	9 ms 6,944 KB
testcase_29	AC	79 ms 6,944 KB
testcase_30	AC	124 ms 6,944 KB
testcase_31	AC	69 ms 6,940 KB
testcase_32	AC	89 ms 6,940 KB
testcase_33	AC	31 ms 6,940 KB
testcase_34	AC	45 ms 6,940 KB
testcase_35	AC	17 ms 6,940 KB
testcase_36	AC	8 ms 6,944 KB
testcase_37	AC	58 ms 6,944 KB
testcase_38	AC	89 ms 6,940 KB
testcase_39	AC	35 ms 6,944 KB
testcase_40	AC	25 ms 6,940 KB
testcase_41	AC	19 ms 6,944 KB
testcase_42	AC	11 ms 6,944 KB
testcase_43	AC	55 ms 6,944 KB
testcase_44	AC	93 ms 6,940 KB
testcase_45	AC	5 ms 6,940 KB
testcase_46	AC	43 ms 6,940 KB
testcase_47	AC	55 ms 6,944 KB
testcase_48	AC	105 ms 6,940 KB
testcase_49	AC	77 ms 6,940 KB
testcase_50	AC	6 ms 6,940 KB
testcase_51	AC	62 ms 6,944 KB
testcase_52	AC	16 ms 6,940 KB
testcase_53	AC	58 ms 6,944 KB
testcase_54	AC	107 ms 6,940 KB
testcase_55	AC	124 ms 6,944 KB
testcase_56	AC	105 ms 6,944 KB
testcase_57	AC	117 ms 6,940 KB
testcase_58	AC	213 ms 6,940 KB
testcase_59	AC	117 ms 6,940 KB
testcase_60	AC	118 ms 6,940 KB
testcase_61	AC	108 ms 6,944 KB
testcase_62	AC	108 ms 6,940 KB
testcase_63	AC	104 ms 6,940 KB
testcase_64	AC	104 ms 6,940 KB
testcase_65	AC	124 ms 6,940 KB
testcase_66	AC	107 ms 6,940 KB
testcase_67	AC	105 ms 6,940 KB
testcase_68	AC	119 ms 6,940 KB
testcase_69	AC	114 ms 6,944 KB
testcase_70	AC	110 ms 6,940 KB
testcase_71	AC	122 ms 6,940 KB
testcase_72	AC	107 ms 6,944 KB
testcase_73	AC	107 ms 6,944 KB
testcase_74	AC	105 ms 6,944 KB
testcase_75	AC	106 ms 6,944 KB
testcase_76	AC	105 ms 6,940 KB
testcase_77	AC	104 ms 6,944 KB
testcase_78	AC	104 ms 6,940 KB
testcase_79	AC	105 ms 6,940 KB
testcase_80	AC	104 ms 6,944 KB
testcase_81	AC	104 ms 6,944 KB
testcase_82	AC	104 ms 6,948 KB
testcase_83	AC	105 ms 6,944 KB
testcase_84	AC	201 ms 6,944 KB
testcase_85	AC	200 ms 6,940 KB
testcase_86	AC	198 ms 6,944 KB
testcase_87	AC	203 ms 6,940 KB
testcase_88	AC	201 ms 6,940 KB
testcase_89	AC	205 ms 6,944 KB
testcase_90	AC	202 ms 6,940 KB
testcase_91	AC	206 ms 6,940 KB
testcase_92	AC	207 ms 6,940 KB
testcase_93	AC	199 ms 6,944 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
vector<int> &operator--(vector<int> &v) { for (int &x : v) --x; return v; }
vector<int> &operator++(vector<int> &v) { for (int &x : v) ++x; return v; }
// <<<

template <class T>
decltype(T::one()) semi_ring_one(signed) { return T::one(); }
template <class T>
constexpr T semi_ring_one(long) { return 1; }

template <class T> vector<T> pow(vector<T> const& c, int n) {
    assert(n >= 0);
    const int L = c.size();
    vector<T> ret(L), b(L), nxt(L);
    ret[0] = semi_ring_one<T>(0);
    auto inc = [&](vector<T>& a) {
        auto const x = a.back();
        for (int i = L-1; i >= 0; --i) {
            a[i] = x * c[i];
            if (i > 0) a[i] += a[i-1];
        }
    };
    auto dbl = [&](vector<T>& a) {
        rep (i, L) b[i] = a[i], nxt[i] = T();
        rep (i, L) {
            rep (j, L) nxt[j] += a[i] * b[j];
            inc(b);
        }
        swap(nxt, a);
    };
    for (int k = 62; k >= 0; --k) {
        dbl(ret);
        if (n>>k&1) inc(ret);
    }
    return ret;
}

// >>> semi-ring
struct SemiRing {
    using T = int;
    T a;
    constexpr SemiRing() : SemiRing(zero()) { }
    constexpr SemiRing(T a) : a(a) {}
    T val() const { return a; }
    static constexpr SemiRing zero() { return -INF; }
    static constexpr SemiRing one() { return +INF; }
    SemiRing operator*(SemiRing const& r) const {
        if (*this == zero() || r == zero()) return zero();
        if (*this == one()) return r;
        if (r == one()) return *this;
        return min(a, r.a);
    }
    SemiRing operator+(SemiRing const& r) const {
        if (*this == zero()) return r;
        if (r == zero()) return *this;
        return max(a, r.a);
    }
    SemiRing& operator*=(SemiRing const& r) { return *this = (*this)*r; }
    SemiRing& operator+=(SemiRing const& r) { return *this = (*this)+r; }
    bool operator==(SemiRing const& r) const { return a == r.a; }
    friend ostream& operator<<(ostream& os, SemiRing const& x) {
        return os << x.a;
    }
};
#ifdef LOCAL
string to_s(SemiRing const& x) { return to_s(x.a); }
#endif
// <<<

int32_t main() {
    int k, n; cin >> k >> n;
    vector<SemiRing> a(k), b(k);
    rep (i, k) {
        int x; cin >> x;
        a[i] = x;
    }
    rep (i, k) {
        int x; cin >> x;
        b[i] = x;
    }

    auto res = pow(b, n);
    dump(res);

    auto ans = SemiRing();
    rep (i, k) ans += a[i] * res[i];
    cout << ans << '\n';


}

yukicoder

結果

テストケース

ソースコード