結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー 👑 hitonanodehitonanode
提出日時 2021-01-22 23:30:36
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,451 ms / 2,000 ms
コード長 6,860 bytes
コンパイル時間 2,443 ms
コンパイル使用メモリ 220,784 KB
実行使用メモリ 34,236 KB
最終ジャッジ日時 2023-08-27 22:57:28
合計ジャッジ時間 37,620 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,384 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 2 ms
4,384 KB
testcase_10 AC 4 ms
4,376 KB
testcase_11 AC 3 ms
4,380 KB
testcase_12 AC 3 ms
4,380 KB
testcase_13 AC 4 ms
4,380 KB
testcase_14 AC 3 ms
4,380 KB
testcase_15 AC 7 ms
4,376 KB
testcase_16 AC 3 ms
4,380 KB
testcase_17 AC 5 ms
4,380 KB
testcase_18 AC 66 ms
4,604 KB
testcase_19 AC 26 ms
4,380 KB
testcase_20 AC 70 ms
4,392 KB
testcase_21 AC 19 ms
4,384 KB
testcase_22 AC 32 ms
4,380 KB
testcase_23 AC 50 ms
4,572 KB
testcase_24 AC 42 ms
4,512 KB
testcase_25 AC 48 ms
4,492 KB
testcase_26 AC 60 ms
4,520 KB
testcase_27 AC 39 ms
4,380 KB
testcase_28 AC 460 ms
14,444 KB
testcase_29 AC 407 ms
10,872 KB
testcase_30 AC 376 ms
10,064 KB
testcase_31 AC 502 ms
14,860 KB
testcase_32 AC 370 ms
22,552 KB
testcase_33 AC 348 ms
10,564 KB
testcase_34 AC 518 ms
16,648 KB
testcase_35 AC 676 ms
15,812 KB
testcase_36 AC 922 ms
25,084 KB
testcase_37 AC 177 ms
9,192 KB
testcase_38 AC 517 ms
12,324 KB
testcase_39 AC 304 ms
9,248 KB
testcase_40 AC 370 ms
11,024 KB
testcase_41 AC 498 ms
15,012 KB
testcase_42 AC 962 ms
20,128 KB
testcase_43 AC 504 ms
14,172 KB
testcase_44 AC 714 ms
16,456 KB
testcase_45 AC 579 ms
13,440 KB
testcase_46 AC 472 ms
17,556 KB
testcase_47 AC 277 ms
9,904 KB
testcase_48 AC 1,090 ms
34,156 KB
testcase_49 AC 941 ms
34,236 KB
testcase_50 AC 1,147 ms
33,716 KB
testcase_51 AC 1,081 ms
34,148 KB
testcase_52 AC 926 ms
33,004 KB
testcase_53 AC 1,382 ms
29,244 KB
testcase_54 AC 1,343 ms
28,884 KB
testcase_55 AC 1,451 ms
30,488 KB
testcase_56 AC 1,361 ms
29,260 KB
testcase_57 AC 926 ms
29,272 KB
testcase_58 AC 770 ms
29,592 KB
testcase_59 AC 771 ms
31,388 KB
testcase_60 AC 770 ms
29,328 KB
testcase_61 AC 773 ms
28,932 KB
testcase_62 AC 774 ms
31,416 KB
testcase_63 AC 42 ms
14,152 KB
testcase_64 AC 41 ms
14,192 KB
testcase_65 AC 42 ms
14,436 KB
testcase_66 AC 41 ms
14,356 KB
testcase_67 AC 41 ms
14,464 KB
testcase_68 AC 2 ms
4,380 KB
testcase_69 AC 2 ms
4,380 KB
testcase_70 AC 2 ms
4,376 KB
testcase_71 AC 2 ms
4,380 KB
testcase_72 AC 2 ms
4,376 KB
testcase_73 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

using tpl = tuple<lint, int, int>;
vector<tpl> gen(int N, int M) {
    vector<int> A(N), B(M);
    cin >> A >> B;
    vector<tpl> ret;
    ret.reserve(N * M);
    for (auto a : A) for (auto b : B) ret.emplace_back(a * b, a, b);
    sort(ret.begin(), ret.end());
    return ret;
}

int main() {
    lint K, L, M, N, S;
    cin >> K >> L >> M >> N >> S;

    vector<tpl> v1 = gen(K, L);
    vector<tpl> v2 = gen(M, N);

    lint m1 = 0, m2 = 0;
    lint z1 = 0, z2 = 0;
    lint p1 = 0, p2 = 0;
    for (auto [v, ii, iii] : v1) m1 += v < 0, z1 += v == 0, p1 += v > 0;
    for (auto [v, ii, iii] : v2) m2 += v < 0, z2 += v == 0, p2 += v > 0;
    lint nls0 = m2 * p1 + m1 * p2;
    lint n0 = z1 * v2.size() + z2 * v1.size() - z1 * z2;

    vector<lint> rettmp(4);
    bool is_minus = false;
    vector<vector<tpl>> wa(2), wb(2);
    if (nls0 >= S) {
        is_minus = true;
        S = nls0 + 1 - S;
    } else if (nls0 + n0 >= S) {
        for (auto [v, ii, iii] : v1) rettmp[0] = ii, rettmp[1] = iii;
        for (auto [v, ii, iii] : v2) rettmp[2] = ii, rettmp[3] = iii;
        for (auto [v, ii, iii] : v1) if (!v) rettmp[0] = ii, rettmp[1] = iii;
        for (auto [v, ii, iii] : v2) if (!v) rettmp[2] = ii, rettmp[3] = iii;
        cout << "0\n";
        for (auto x : rettmp) cout << x << ' ';
        cout << '\n';
        return 0;
    } else {
        S -= nls0 + n0;
    }

    for (auto [v, ii, iii] : v1) if (v) (v > 0 ? wa[is_minus] : wa[1 ^ is_minus]).emplace_back(abs(v), ii, iii);
    for (auto [v, ii, iii] : v2) if (v) (v > 0 ? wb[0] : wb[1]).emplace_back(abs(v), ii, iii);

    for (auto &vec : wa) sort(vec.begin(), vec.end());
    for (auto &vec : wb) sort(vec.begin(), vec.end());

    lint lo = -1, hi = 1e18;

    bool found = false;
    auto search = [&](lint c) -> lint {
        found = false;
        lint cnt_less_c = 0;
        REP(d, 2) if (wb[d].size()) {
            for (auto [ab, a, b] : wa[d]) {
                auto itr = lower_bound(wb[d].begin(), wb[d].end(), tpl{(c + ab - 1) / ab, -1e18, -1e18});
                if (itr != wb[d].end()) {
                    auto [cd, ii, iii] = *(itr);
                    if (ab * cd == c) {
                        found = true;
                        rettmp = {a, b, ii, iii};
                    }
                }
                cnt_less_c += itr - wb[d].begin();
            }
        }
        return cnt_less_c;
    };

    while (hi - lo > 1) {
        const lint c = (lo + hi) / 2;
        lint cnt = search(c);
        (cnt >= S ? hi : lo) = c;
    }

    search(lo);
    assert(found);
    cout << lo * (is_minus ? -1 : 1) << '\n';
    for (auto x : rettmp) cout << x << ' ';
    cout << '\n';
}
0