結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | rniya |
提出日時 | 2021-02-05 01:10:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 6,756 bytes |
コンパイル時間 | 6,083 ms |
コンパイル使用メモリ | 234,384 KB |
実行使用メモリ | 17,088 KB |
最終ジャッジ日時 | 2023-09-13 21:38:18 |
合計ジャッジ時間 | 19,278 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
8,760 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 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,376 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,380 KB |
testcase_19 | AC | 8 ms
4,380 KB |
testcase_20 | AC | 22 ms
4,376 KB |
testcase_21 | AC | 6 ms
4,376 KB |
testcase_22 | AC | 12 ms
4,376 KB |
testcase_23 | AC | 15 ms
4,380 KB |
testcase_24 | AC | 16 ms
4,380 KB |
testcase_25 | AC | 15 ms
4,376 KB |
testcase_26 | AC | 17 ms
4,376 KB |
testcase_27 | AC | 13 ms
4,376 KB |
testcase_28 | AC | 149 ms
6,888 KB |
testcase_29 | AC | 127 ms
6,360 KB |
testcase_30 | AC | 95 ms
5,608 KB |
testcase_31 | AC | 98 ms
6,916 KB |
testcase_32 | AC | 122 ms
8,468 KB |
testcase_33 | AC | 84 ms
5,620 KB |
testcase_34 | AC | 184 ms
7,740 KB |
testcase_35 | AC | 207 ms
7,620 KB |
testcase_36 | AC | 308 ms
9,896 KB |
testcase_37 | AC | 58 ms
5,376 KB |
testcase_38 | AC | 168 ms
6,604 KB |
testcase_39 | AC | 75 ms
5,496 KB |
testcase_40 | AC | 112 ms
6,252 KB |
testcase_41 | AC | 158 ms
6,976 KB |
testcase_42 | AC | 222 ms
8,916 KB |
testcase_43 | AC | 156 ms
7,452 KB |
testcase_44 | AC | 158 ms
7,592 KB |
testcase_45 | AC | 171 ms
6,828 KB |
testcase_46 | AC | 118 ms
8,204 KB |
testcase_47 | AC | 86 ms
5,572 KB |
testcase_48 | AC | 208 ms
14,920 KB |
testcase_49 | AC | 151 ms
14,528 KB |
testcase_50 | AC | 237 ms
15,504 KB |
testcase_51 | AC | 204 ms
16,992 KB |
testcase_52 | AC | 134 ms
14,572 KB |
testcase_53 | AC | 329 ms
12,876 KB |
testcase_54 | AC | 319 ms
12,884 KB |
testcase_55 | AC | 386 ms
12,872 KB |
testcase_56 | AC | 323 ms
12,804 KB |
testcase_57 | AC | 192 ms
12,848 KB |
testcase_58 | TLE | - |
testcase_59 | -- | - |
testcase_60 | -- | - |
testcase_61 | -- | - |
testcase_62 | -- | - |
testcase_63 | -- | - |
testcase_64 | -- | - |
testcase_65 | -- | - |
testcase_66 | -- | - |
testcase_67 | -- | - |
testcase_68 | -- | - |
testcase_69 | -- | - |
testcase_70 | -- | - |
testcase_71 | -- | - |
testcase_72 | -- | - |
testcase_73 | -- | - |
ソースコード
#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; } // debug(x, cnt); 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 = 0, b = 0; for (auto uu : u) { for (int x : uu) { 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; } } } } }