結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー rniyarniya
提出日時 2021-02-05 01:18:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 395 ms / 2,000 ms
コード長 6,800 bytes
コンパイル時間 3,537 ms
コンパイル使用メモリ 236,448 KB
実行使用メモリ 15,372 KB
最終ジャッジ日時 2023-09-13 21:42:49
合計ジャッジ時間 18,683 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 3 ms
4,376 KB
testcase_16 AC 2 ms
4,376 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 14 ms
4,376 KB
testcase_19 AC 8 ms
4,376 KB
testcase_20 AC 23 ms
4,376 KB
testcase_21 AC 7 ms
4,380 KB
testcase_22 AC 12 ms
4,380 KB
testcase_23 AC 15 ms
4,376 KB
testcase_24 AC 16 ms
4,376 KB
testcase_25 AC 15 ms
4,380 KB
testcase_26 AC 17 ms
4,380 KB
testcase_27 AC 12 ms
4,376 KB
testcase_28 AC 148 ms
6,792 KB
testcase_29 AC 129 ms
6,440 KB
testcase_30 AC 96 ms
5,688 KB
testcase_31 AC 99 ms
6,824 KB
testcase_32 AC 121 ms
8,384 KB
testcase_33 AC 85 ms
5,532 KB
testcase_34 AC 178 ms
7,740 KB
testcase_35 AC 203 ms
7,612 KB
testcase_36 AC 305 ms
9,804 KB
testcase_37 AC 58 ms
5,576 KB
testcase_38 AC 165 ms
6,884 KB
testcase_39 AC 75 ms
5,476 KB
testcase_40 AC 113 ms
6,164 KB
testcase_41 AC 159 ms
7,092 KB
testcase_42 AC 221 ms
8,828 KB
testcase_43 AC 164 ms
7,360 KB
testcase_44 AC 160 ms
7,600 KB
testcase_45 AC 173 ms
7,056 KB
testcase_46 AC 120 ms
8,276 KB
testcase_47 AC 86 ms
5,468 KB
testcase_48 AC 204 ms
14,660 KB
testcase_49 AC 152 ms
14,640 KB
testcase_50 AC 232 ms
15,028 KB
testcase_51 AC 202 ms
15,372 KB
testcase_52 AC 130 ms
14,888 KB
testcase_53 AC 341 ms
12,792 KB
testcase_54 AC 321 ms
12,776 KB
testcase_55 AC 395 ms
12,784 KB
testcase_56 AC 325 ms
12,768 KB
testcase_57 AC 197 ms
12,784 KB
testcase_58 AC 105 ms
12,924 KB
testcase_59 AC 105 ms
12,836 KB
testcase_60 AC 72 ms
12,788 KB
testcase_61 AC 74 ms
12,936 KB
testcase_62 AC 74 ms
13,048 KB
testcase_63 AC 44 ms
13,148 KB
testcase_64 AC 44 ms
13,984 KB
testcase_65 AC 44 ms
12,528 KB
testcase_66 AC 44 ms
13,776 KB
testcase_67 AC 44 ms
12,500 KB
testcase_68 AC 1 ms
4,380 KB
testcase_69 AC 1 ms
4,376 KB
testcase_70 AC 1 ms
4,380 KB
testcase_71 AC 2 ms
4,376 KB
testcase_72 AC 2 ms
4,376 KB
testcase_73 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

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 (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

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; }

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;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int K, L, M, N;
    ll S;
    cin >> K >> L >> M >> N >> S;
    vector<int> A(K), B(L), C(M), D(N);
    for (int& x : A) cin >> x;
    for (int& x : B) cin >> x;
    for (int& x : C) cin >> x;
    for (int& x : D) cin >> x;

    vector<vector<ll>> u(2), v(2);
    for (int i = 0; i < K; i++) {
        for (int j = 0; j < L; j++) {
            int prod = A[i] * B[j];
            u[prod >= 0].emplace_back(prod);
        }
    }
    for (int k = 0; k < M; k++) {
        for (int l = 0; l < N; l++) {
            int prod = C[k] * D[l];
            v[prod >= 0].emplace_back(prod);
        }
    }
    for (auto& x : u) sort(x.begin(), x.end());
    for (auto& x : v) sort(x.begin(), x.end());

    auto check = [&](ll x) {
        ll cnt = 0;
        for (int i = (int)u[0].size() - 1, j = 0; i >= 0; i--) {
            while (j < (int)v[0].size() && u[0][i] * v[0][j] > x) ++j;
            cnt += (int)v[0].size() - j;
        }
        for (int i = 0, j = 0; i < (int)u[0].size(); i++) {
            while (j < (int)v[1].size() && u[0][i] * v[1][j] > x) ++j;
            cnt += (int)v[1].size() - j;
        }
        for (int i = (int)u[1].size() - 1, j = (int)v[0].size() - 1; i >= 0; i--) {
            while (j >= 0 && u[1][i] * v[0][j] > x) --j;
            cnt += j + 1;
        }
        for (int i = 0, j = (int)v[1].size() - 1; i < (int)u[1].size(); i++) {
            while (j >= 0 && u[1][i] * v[1][j] > x) --j;
            cnt += j + 1;
        }
        return cnt >= S;
    };
    ll lb = -IINF, ub = IINF;
    while (ub - lb > 1) {
        ll mid = (ub + lb) >> 1LL;
        (check(mid) ? ub : lb) = mid;
    }

    cout << ub << '\n';

    int a = -INF, b = -INF;
    for (auto uu : u) {
        if (a != -INF) break;
        for (int x : uu) {
            if (a != -INF) break;
            if (x == 0) {
                if (ub == 0) {
                    a = x;
                    b = C[0] * D[0];
                }
                continue;
            }
            if (ub % x != 0) continue;
            ll tmp = ub / x;
            for (auto vv : v) {
                if (binary_search(vv.begin(), vv.end(), tmp)) {
                    a = x;
                    b = tmp;
                }
            }
        }
    }

    for (int i = 0; i < K; i++) {
        for (int j = 0; j < L; j++) {
            if (A[i] * B[j] != a) continue;
            for (int k = 0; k < M; k++) {
                for (int l = 0; l < N; l++) {
                    if (C[k] * D[l] != b) continue;
                    cout << A[i] << ' ' << B[j] << ' ' << C[k] << ' ' << D[l] << '\n';
                    return 0;
                }
            }
        }
    }
}
0