結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー |
![]() |
提出日時 | 2021-02-05 01:18:02 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 384 ms / 2,000 ms |
コード長 | 6,800 bytes |
コンパイル時間 | 11,395 ms |
コンパイル使用メモリ | 296,948 KB |
最終ジャッジ日時 | 2025-01-18 11:36:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 74 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define LOCAL#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef 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#endiftemplate <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 endregionconst 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;}}}}}