結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | 👑 Kazun |
提出日時 | 2020-10-21 14:04:44 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,593 bytes |
コンパイル時間 | 1,310 ms |
コンパイル使用メモリ | 89,580 KB |
実行使用メモリ | 37,376 KB |
最終ジャッジ日時 | 2023-08-27 16:11:52 |
合計ジャッジ時間 | 14,772 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 13 ms
4,844 KB |
testcase_19 | AC | 6 ms
4,380 KB |
testcase_20 | AC | 14 ms
4,496 KB |
testcase_21 | AC | 8 ms
4,400 KB |
testcase_22 | AC | 11 ms
4,392 KB |
testcase_23 | AC | 14 ms
4,972 KB |
testcase_24 | AC | 16 ms
5,088 KB |
testcase_25 | AC | 15 ms
4,872 KB |
testcase_26 | AC | 16 ms
5,040 KB |
testcase_27 | AC | 9 ms
4,380 KB |
testcase_28 | AC | 124 ms
17,932 KB |
testcase_29 | AC | 106 ms
14,108 KB |
testcase_30 | AC | 79 ms
11,856 KB |
testcase_31 | AC | 92 ms
16,784 KB |
testcase_32 | AC | 136 ms
27,816 KB |
testcase_33 | AC | 76 ms
12,144 KB |
testcase_34 | AC | 143 ms
23,120 KB |
testcase_35 | AC | 148 ms
17,768 KB |
testcase_36 | AC | 255 ms
30,484 KB |
testcase_37 | AC | 63 ms
13,060 KB |
testcase_38 | AC | 112 ms
13,760 KB |
testcase_39 | AC | 63 ms
10,056 KB |
testcase_40 | AC | 88 ms
13,908 KB |
testcase_41 | AC | 149 ms
19,784 KB |
testcase_42 | AC | 184 ms
22,520 KB |
testcase_43 | AC | 139 ms
17,352 KB |
testcase_44 | AC | 137 ms
18,640 KB |
testcase_45 | AC | 118 ms
15,052 KB |
testcase_46 | AC | 112 ms
24,704 KB |
testcase_47 | AC | 79 ms
13,332 KB |
testcase_48 | AC | 211 ms
36,784 KB |
testcase_49 | AC | 173 ms
36,952 KB |
testcase_50 | AC | 222 ms
37,176 KB |
testcase_51 | AC | 207 ms
37,376 KB |
testcase_52 | AC | 162 ms
37,096 KB |
testcase_53 | AC | 300 ms
36,732 KB |
testcase_54 | AC | 288 ms
36,888 KB |
testcase_55 | AC | 326 ms
36,976 KB |
testcase_56 | AC | 285 ms
36,992 KB |
testcase_57 | AC | 187 ms
36,796 KB |
testcase_58 | AC | 85 ms
20,120 KB |
testcase_59 | AC | 83 ms
20,300 KB |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | AC | 16 ms
14,292 KB |
testcase_64 | AC | 18 ms
14,188 KB |
testcase_65 | AC | 17 ms
14,352 KB |
testcase_66 | AC | 16 ms
14,304 KB |
testcase_67 | AC | 17 ms
14,288 KB |
testcase_68 | AC | 2 ms
4,380 KB |
testcase_69 | AC | 1 ms
4,376 KB |
testcase_70 | AC | 1 ms
4,376 KB |
testcase_71 | AC | 1 ms
4,376 KB |
testcase_72 | AC | 1 ms
4,376 KB |
testcase_73 | AC | 1 ms
4,376 KB |
ソースコード
#include<iostream> #include<vector> #include<algorithm> #include<set> using namespace std; using ll = long long; void input(vector<ll>& X) { for (int i = 0; i < X.size(); i++) { cin >> X.at(i); } } ll abs_max(vector<ll> X) { ll t = 0; for (int i = 0; i < X.size(); i++) { if (t < abs(X.at(i))) { t = abs(X.at(i)); } } return t; } pair<ll, ll> h(ll x, vector<ll> G, vector<ll> H) { if (x == 0) { if (find(G.begin(), G.end(), 0) != G.end()) { return make_pair(0, H[0]); } else { return make_pair(G[0], 0); } } set<ll> F(H.begin(), H.end()); for (auto g : G) { if (g == 0) continue; if (x % g == 0 && F.count(x / g)) { return make_pair(g, x / g); } } return make_pair(-1, -1); } int main() { ll K, L, M, N, S, T; cin >> K >> L >> M >> N >> S; vector<ll> A(K), B(L), C(M), D(N); vector<ll> U(K * L), V(M * N); vector<ll> U_pos(0), U_neg(0); vector<ll> V_pos(0), V_neg(0); ll U_positive, U_zero, U_negative; ll V_positive, V_zero, V_negative; ll E_positive, E_zero, E_negative; ll A_abs_max, B_abs_max, C_abs_max, D_abs_max; ll E_abs_max; input(A); input(B); input(C); input(D); A_abs_max = abs_max(A); B_abs_max = abs_max(B); C_abs_max = abs_max(C); D_abs_max = abs_max(D); E_abs_max = A_abs_max * B_abs_max * C_abs_max * D_abs_max; int t; t = 0; for (int w = 0; w < K; w++) { for (int x = 0; x < L; x++) { U.at(t++) = A.at(w) * B.at(x); } } t = 0; for (int y = 0; y < M; y++) { for (int z = 0; z < N; z++) { V.at(t++) = C.at(y) * D.at(z); } } sort(V.begin(), V.end()); for (auto u : U) { if (u > 0) { U_pos.push_back(u); } else if (u < 0) { U_neg.push_back(u); } } for (auto v : V) { if (v > 0) { V_pos.push_back(v); } else if (v < 0) { V_neg.push_back(v); } } sort(U_pos.begin(), U_pos.end()); sort(U_neg.begin(), U_neg.end()); sort(V_pos.begin(), V_pos.end()); sort(V_neg.begin(), V_neg.end()); U_positive = U_pos.size(); U_negative = U_neg.size(); U_zero = K * L - (U_positive + U_negative); V_positive = V_pos.size(); V_negative = V_neg.size(); V_zero = M * N - (V_positive + V_negative); E_positive = U_positive * V_positive + U_negative * V_negative; E_negative = U_positive * V_negative + U_negative * V_positive; E_zero = K * L * M * N - (E_positive + E_negative); ll Left, Right, Z, I; if (S <= E_negative) { Left = -E_abs_max; Right = 1; while (Right - Left > 1) { T = Left + (Right - Left) / 2; Z = I = 0; for (auto u : U_pos) { while (I < V_negative && u * V_neg.at(I) <= T) I++; Z += I; } I = 0; for (auto v : V_pos) { while (I < U_negative && v * U_neg.at(I) <= T) I++; Z += I; } if (Z >= S) { Right = T; } else { Left = T; } } T = Right; } else if (E_negative + 1 <= S && S <= E_negative + E_zero) { T = 0; } else { Left = 0; Right = E_abs_max + 1; while (Right - Left > 1) { T = Left + (Right - Left) / 2; Z = 0; I = V_positive; for (auto u : U_pos) { while (I>0 && u * V_pos.at(I-1) > T) I--; Z += I; } I = 0; for (auto v : V_neg) { while (I < U_negative && v * U_neg.at(U_negative-(I+1)) <= T) I++; Z += I; } if (Z >= S - (E_negative + E_zero)) { Right = T; } else { Left = T; } } T = Right; } ll alpha, beta, a, b, c, d; pair<ll, ll> P; P = h(T, U, V); alpha = P.first; beta = P.second; P = h(alpha, A, B); a = P.first; b = P.second; P = h(beta, C, D); c = P.first; d = P.second; cout << T << endl; cout << a << " " << b << " " << c << " " << d << endl; }