結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | haruki_K |
提出日時 | 2021-01-23 13:04:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,763 ms / 2,000 ms |
コード長 | 6,915 bytes |
コンパイル時間 | 2,638 ms |
コンパイル使用メモリ | 221,060 KB |
実行使用メモリ | 54,408 KB |
最終ジャッジ日時 | 2023-08-28 23:27:50 |
合計ジャッジ時間 | 45,267 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,384 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 5 ms
4,380 KB |
testcase_09 | AC | 3 ms
4,380 KB |
testcase_10 | AC | 5 ms
4,376 KB |
testcase_11 | AC | 3 ms
4,376 KB |
testcase_12 | AC | 5 ms
4,376 KB |
testcase_13 | AC | 3 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 8 ms
4,380 KB |
testcase_16 | AC | 6 ms
4,380 KB |
testcase_17 | AC | 4 ms
4,376 KB |
testcase_18 | AC | 59 ms
5,952 KB |
testcase_19 | AC | 26 ms
4,392 KB |
testcase_20 | AC | 56 ms
5,648 KB |
testcase_21 | AC | 39 ms
4,948 KB |
testcase_22 | AC | 49 ms
4,984 KB |
testcase_23 | AC | 73 ms
5,764 KB |
testcase_24 | AC | 84 ms
5,820 KB |
testcase_25 | AC | 73 ms
5,696 KB |
testcase_26 | AC | 75 ms
5,872 KB |
testcase_27 | AC | 41 ms
4,880 KB |
testcase_28 | AC | 687 ms
24,280 KB |
testcase_29 | AC | 508 ms
19,540 KB |
testcase_30 | AC | 407 ms
17,236 KB |
testcase_31 | AC | 555 ms
24,896 KB |
testcase_32 | AC | 982 ms
32,448 KB |
testcase_33 | AC | 387 ms
17,680 KB |
testcase_34 | AC | 820 ms
30,548 KB |
testcase_35 | AC | 713 ms
27,136 KB |
testcase_36 | AC | 1,308 ms
43,144 KB |
testcase_37 | AC | 371 ms
15,344 KB |
testcase_38 | AC | 513 ms
21,660 KB |
testcase_39 | AC | 318 ms
14,632 KB |
testcase_40 | AC | 469 ms
19,848 KB |
testcase_41 | AC | 804 ms
25,804 KB |
testcase_42 | AC | 990 ms
36,568 KB |
testcase_43 | AC | 687 ms
23,624 KB |
testcase_44 | AC | 729 ms
28,820 KB |
testcase_45 | AC | 564 ms
24,204 KB |
testcase_46 | AC | 772 ms
33,072 KB |
testcase_47 | AC | 465 ms
16,676 KB |
testcase_48 | AC | 1,336 ms
53,756 KB |
testcase_49 | AC | 1,190 ms
53,800 KB |
testcase_50 | AC | 1,371 ms
53,760 KB |
testcase_51 | AC | 1,295 ms
54,188 KB |
testcase_52 | AC | 1,150 ms
53,936 KB |
testcase_53 | AC | 1,698 ms
53,380 KB |
testcase_54 | AC | 1,661 ms
53,636 KB |
testcase_55 | AC | 1,763 ms
53,484 KB |
testcase_56 | AC | 1,645 ms
53,288 KB |
testcase_57 | AC | 1,300 ms
54,408 KB |
testcase_58 | AC | 740 ms
13,216 KB |
testcase_59 | AC | 741 ms
12,128 KB |
testcase_60 | AC | 796 ms
14,720 KB |
testcase_61 | AC | 792 ms
14,564 KB |
testcase_62 | AC | 796 ms
13,732 KB |
testcase_63 | AC | 44 ms
13,004 KB |
testcase_64 | AC | 45 ms
13,036 KB |
testcase_65 | AC | 46 ms
14,268 KB |
testcase_66 | AC | 45 ms
12,716 KB |
testcase_67 | AC | 44 ms
12,208 KB |
testcase_68 | AC | 2 ms
4,380 KB |
testcase_69 | AC | 2 ms
4,380 KB |
testcase_70 | AC | 2 ms
4,384 KB |
testcase_71 | AC | 2 ms
4,380 KB |
testcase_72 | AC | 1 ms
4,384 KB |
testcase_73 | AC | 2 ms
4,380 KB |
ソースコード
// >>> 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] << " " << c[0] << " " << d[0] << "\n"; } else if (Y.count(0)) { cout << a[0] << " " << b[0] << " " << 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); } }