結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー haruki_Kharuki_K
提出日時 2021-01-23 13:01:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,897 bytes
コンパイル時間 2,374 ms
コンパイル使用メモリ 220,864 KB
実行使用メモリ 55,464 KB
最終ジャッジ日時 2023-08-28 23:23:15
合計ジャッジ時間 43,482 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 5 ms
4,380 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 6 ms
4,380 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 4 ms
4,376 KB
testcase_13 AC 3 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 7 ms
4,376 KB
testcase_16 AC 6 ms
4,376 KB
testcase_17 AC 4 ms
4,380 KB
testcase_18 AC 56 ms
5,920 KB
testcase_19 AC 25 ms
4,600 KB
testcase_20 AC 55 ms
5,668 KB
testcase_21 AC 41 ms
5,016 KB
testcase_22 AC 48 ms
4,880 KB
testcase_23 AC 71 ms
5,764 KB
testcase_24 AC 82 ms
5,808 KB
testcase_25 AC 73 ms
5,596 KB
testcase_26 AC 74 ms
5,904 KB
testcase_27 AC 41 ms
4,908 KB
testcase_28 AC 653 ms
24,184 KB
testcase_29 AC 491 ms
19,564 KB
testcase_30 AC 386 ms
17,236 KB
testcase_31 AC 534 ms
24,788 KB
testcase_32 AC 964 ms
32,908 KB
testcase_33 AC 376 ms
17,476 KB
testcase_34 AC 803 ms
30,560 KB
testcase_35 AC 683 ms
27,076 KB
testcase_36 AC 1,256 ms
42,376 KB
testcase_37 AC 368 ms
15,464 KB
testcase_38 AC 493 ms
21,544 KB
testcase_39 AC 312 ms
14,768 KB
testcase_40 AC 438 ms
19,584 KB
testcase_41 AC 765 ms
25,752 KB
testcase_42 AC 928 ms
37,140 KB
testcase_43 AC 659 ms
23,656 KB
testcase_44 AC 690 ms
28,832 KB
testcase_45 AC 551 ms
23,964 KB
testcase_46 AC 758 ms
33,012 KB
testcase_47 AC 443 ms
16,768 KB
testcase_48 AC 1,302 ms
55,464 KB
testcase_49 AC 1,162 ms
53,796 KB
testcase_50 AC 1,340 ms
53,924 KB
testcase_51 AC 1,266 ms
53,708 KB
testcase_52 AC 1,129 ms
53,920 KB
testcase_53 AC 1,614 ms
54,788 KB
testcase_54 AC 1,585 ms
53,456 KB
testcase_55 AC 1,660 ms
53,380 KB
testcase_56 AC 1,561 ms
53,476 KB
testcase_57 AC 1,253 ms
53,808 KB
testcase_58 AC 766 ms
14,296 KB
testcase_59 AC 768 ms
11,968 KB
testcase_60 AC 783 ms
12,476 KB
testcase_61 AC 782 ms
14,740 KB
testcase_62 AC 782 ms
14,236 KB
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 AC 1 ms
4,380 KB
testcase_73 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> 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> auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> 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); }
const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
const int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class A, class B> pair<A, B> operator+(pair<A, B> const& p, pair<A, B> const& q) { return { p.first + q.first, p.second + q.second }; }
template <class A, class B> pair<A, B> operator-(pair<A, B> const& p, pair<A, B> const& q) { return { p.first - q.first, p.second - q.second }; }
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_); }
// <<<
ll div_floor(ll x, ll y) {
    assert(y);
    return x/y - ((x^y) < 0 && x%y);
}
ll div_ceil(ll x, ll y) {
    assert(y);
    return x/y + ((x^y) > 0 && x%y);
}

int32_t main() {
    int A, B, C, D, S; cin >> A >> B >> C >> D >> S; --S;
    vector<int> a(A), b(B), c(C), d(D); cin >> a >> b >> c >> d;

    vector<int> ab, cd;
    rep (i, A) rep (j, B) ab.eb(a[i]*b[j]);
    rep (i, C) rep (j, D) cd.eb(c[i]*d[j]);
    sort(all(ab));
    sort(all(cd));

    auto cnt = [&](int m) { // xy <= m
        int cnt = 0;
        for (auto y : cd) {
            if (y > 0) {
                cnt += ubd(ab, div_floor(m, y));
            } else if (y == 0) {
                if (0 <= m) cnt += ab.size();
            } else {
                cnt += sz(ab) - lbd(ab, div_ceil(m, y));
            }
        }
        return cnt;
    };

    int l = -INF, r = +INF;
    while (l+1 < r) {
        auto m = (l+r)/2;
        (cnt(m) <= S ? l : r) = m;
    }
    dump(l, r);
    const int T = r;
    cout << T << "\n";

    debug {
        vector<int> v;
        rep (i, A) rep (j, B) rep (k, C) rep (l, D) {
            v.eb(a[i]*b[j]*c[k]*d[l]);
        }
        sort(all(v));
        assert(v[S] == T);
    }

    map<int, pair<int, int>> X, Y;
    rep (i, A) rep (j, B) X[a[i]*b[j]] = mp(a[i], b[j]);
    rep (i, C) rep (j, D) Y[c[i]*d[j]] = mp(c[i], d[j]);
    if (T == 0) {
        if (X.count(0)) {
            cout << X[0] << " " << *Y.begin() << "\n";
        } else if (Y.count(0)) {
            cout << *X.begin() << " " << Y[0] << "\n";
        } else {
            assert(false);
        }
    } else {
        for (auto [x, _] : X) {
            if (x == 0) continue;
            if (T % x) continue;
            int y = T/x;
            if (Y.count(y) == 0) continue;
            cout << X[x] << " " << Y[y] << "\n";
            return 0;
        }
        assert(false);
    }

}
0