結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー |
![]() |
提出日時 | 2021-01-22 23:30:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,523 ms / 2,000 ms |
コード長 | 6,860 bytes |
コンパイル時間 | 2,696 ms |
コンパイル使用メモリ | 214,112 KB |
最終ジャッジ日時 | 2025-01-18 06:16:53 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 74 |
ソースコード
#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 >= 201703Ltemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); returnis; }template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);},tpl); return os; }#endiftemplate <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_LOCALconst 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)#endifusing 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';}