結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | SSRS |
提出日時 | 2021-01-22 22:46:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,057 bytes |
コンパイル時間 | 3,552 ms |
コンパイル使用メモリ | 225,268 KB |
実行使用メモリ | 13,088 KB |
最終ジャッジ日時 | 2023-08-27 21:04:01 |
合計ジャッジ時間 | 42,306 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 5 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 6 ms
4,376 KB |
testcase_11 | AC | 4 ms
4,376 KB |
testcase_12 | AC | 3 ms
4,380 KB |
testcase_13 | AC | 6 ms
4,380 KB |
testcase_14 | AC | 3 ms
4,376 KB |
testcase_15 | AC | 7 ms
4,380 KB |
testcase_16 | AC | 3 ms
4,380 KB |
testcase_17 | AC | 6 ms
4,380 KB |
testcase_18 | AC | 109 ms
4,376 KB |
testcase_19 | AC | 37 ms
4,380 KB |
testcase_20 | AC | 123 ms
4,376 KB |
testcase_21 | AC | 28 ms
4,376 KB |
testcase_22 | AC | 41 ms
4,376 KB |
testcase_23 | AC | 79 ms
4,376 KB |
testcase_24 | AC | 51 ms
4,376 KB |
testcase_25 | AC | 69 ms
4,376 KB |
testcase_26 | AC | 95 ms
4,380 KB |
testcase_27 | AC | 59 ms
4,380 KB |
testcase_28 | AC | 980 ms
5,708 KB |
testcase_29 | AC | 779 ms
4,848 KB |
testcase_30 | AC | 808 ms
4,752 KB |
testcase_31 | AC | 1,149 ms
5,368 KB |
testcase_32 | AC | 809 ms
6,168 KB |
testcase_33 | AC | 733 ms
4,540 KB |
testcase_34 | AC | 1,092 ms
6,312 KB |
testcase_35 | AC | 1,445 ms
5,596 KB |
testcase_36 | TLE | - |
testcase_37 | AC | 313 ms
4,396 KB |
testcase_38 | AC | 1,181 ms
5,212 KB |
testcase_39 | AC | 590 ms
4,380 KB |
testcase_40 | AC | 741 ms
4,848 KB |
testcase_41 | AC | 1,140 ms
5,640 KB |
testcase_42 | TLE | - |
testcase_43 | AC | 1,080 ms
5,428 KB |
testcase_44 | AC | 1,586 ms
6,040 KB |
testcase_45 | AC | 1,232 ms
5,368 KB |
testcase_46 | AC | 1,144 ms
6,572 KB |
testcase_47 | AC | 458 ms
4,692 KB |
testcase_48 | TLE | - |
testcase_49 | TLE | - |
testcase_50 | TLE | - |
testcase_51 | TLE | - |
testcase_52 | TLE | - |
testcase_53 | TLE | - |
testcase_54 | -- | - |
testcase_55 | -- | - |
testcase_56 | -- | - |
testcase_57 | -- | - |
testcase_58 | -- | - |
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") #include <bits/stdc++.h> using namespace std; const long long INF = 1000000000000000000; int main(){ int K, L, M, N; long long S; cin >> K >> L >> M >> N >> S; vector<int> A(K); for (int i = 0; i < K; i++){ cin >> A[i]; } vector<int> B(L); for (int i = 0; i < L; i++){ cin >> B[i]; } vector<int> C(M); for (int i = 0; i < M; i++){ cin >> C[i]; } vector<int> D(N); for (int i = 0; i < N; i++){ cin >> D[i]; } vector<long long> X(K * L); for (int i = 0; i < K; i++){ for (int j = 0; j < L; j++){ X[i * L + j] = A[i] * B[j]; } } vector<long long> Y(M * N); for (int i = 0; i < M; i++){ for (int j = 0; j < N; j++){ Y[i * N + j] = C[i] * D[j]; } } sort(Y.begin(), Y.end()); long long tv = -INF; long long fv = INF; while (fv - tv > 1){ long long mid = (tv + fv) / 2; long long cnt = 0; for (int i = 0; i < K * L; i++){ if (X[i] >= 0){ int tv2 = -1; int fv2 = N * M; while (fv2 - tv2 > 1){ int mid2 = (tv2 + fv2) / 2; if (X[i] * Y[mid2] < mid){ tv2 = mid2; } else { fv2 = mid2; } } cnt += fv2; } else { int tv2 = N * M; int fv2 = -1; while (tv2 - fv2 > 1){ int mid2 = (tv2 + fv2) / 2; if (X[i] * Y[mid2] < mid){ tv2 = mid2; } else { fv2 = mid2; } } cnt += N * M - tv2; } } if (cnt < S){ tv = mid; } else { fv = mid; } } cout << tv << endl; for (int i = 0; i < K * L; i++){ int id = -1; if (X[i] >= 0){ int tv2 = -1; int fv2 = N * M; while (fv2 - tv2 > 1){ int mid2 = (tv2 + fv2) / 2; if (X[i] * Y[mid2] <= tv){ tv2 = mid2; } else { fv2 = mid2; } } if (tv2 != -1){ if (X[i] * Y[tv2] == tv){ id = tv2; } } } else { int tv2 = N * M; int fv2 = -1; while (tv2 - fv2 > 1){ int mid2 = (tv2 + fv2) / 2; if (X[i] * Y[mid2] <= tv){ tv2 = mid2; } else { fv2 = mid2; } } if (tv2 != N * M){ if (X[i] * Y[tv2] == tv){ id = tv2; } } } if (id != -1){ bool ok1 = false; for (int j = 0; j < K; j++){ for (int k = 0; k < L; k++){ if (A[j] * B[k] == X[i]){ cout << A[j] << ' ' << B[k] << ' '; ok1 = true; break; } } if (ok1){ break; } } bool ok2 = false; for (int j = 0; j < M; j++){ for (int k = 0; k < N; k++){ if (C[j] * D[k] == Y[id]){ cout << C[j] << ' ' << D[k] << endl; ok2 = true; break; } } if (ok2){ break; } } break; } } }