結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー |
|
提出日時 | 2021-01-23 00:08:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 377 ms / 2,000 ms |
コード長 | 3,481 bytes |
コンパイル時間 | 1,969 ms |
コンパイル使用メモリ | 109,336 KB |
最終ジャッジ日時 | 2025-01-18 06:47:45 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 74 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:24:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 24 | for (auto &&i : A) scanf("%d", &i); | ~~~~~^~~~~~~~~~ main.cpp:25:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 25 | for (auto &&i : B) scanf("%d", &i); | ~~~~~^~~~~~~~~~ main.cpp:26:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 26 | for (auto &&i : C) scanf("%d", &i); | ~~~~~^~~~~~~~~~ main.cpp:27:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 27 | for (auto &&i : D) scanf("%d", &i); | ~~~~~^~~~~~~~~~
ソースコード
#include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 1000000007; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; int main() { int a, b, c, d; ll s; cin >> a >> b >> c >> d >> s; vector<int> A(a), B(b), C(c), D(d); for (auto &&i : A) scanf("%d", &i); for (auto &&i : B) scanf("%d", &i); for (auto &&i : C) scanf("%d", &i); for (auto &&i : D) scanf("%d", &i); vector<ll> vp, up, vm, um; for (int i = 0; i < a; ++i) { for (int j = 0; j < b; ++j) { if(A[i]*B[j] >= 0) vp.emplace_back(A[i] * B[j]); else vm.emplace_back(A[i] * B[j]); } } for (int i = 0; i < c; ++i) { for (int j = 0; j < d; ++j) { if(C[i]*D[j] >= 0) up.emplace_back(C[i] * D[j]); else um.emplace_back(C[i] * D[j]); } } sort(vp.begin(),vp.end()); sort(vm.begin(),vm.end()); sort(up.begin(),up.end()); sort(um.begin(),um.end()); ll ok = INF<ll>, ng = -INF<ll>; while(ok-ng > 1){ ll mid = (ok+ng)/2; if([&](ll x) -> bool{ // count v[i]*u[j] <= x ll cnt = 0; if(x >= 0){ cnt += (ll)vp.size()*um.size()+(ll)up.size()*vm.size(); int cur = 0; for (int i = (int)vp.size()-1; i >= 0; --i) { // v >= 0, u >= 0 while(cur < up.size() && up[cur]*vp[i] <= x) cur++; cnt += cur; } cur = um.size(); for (int i = 0; i < vm.size(); ++i) { while(cur > 0 && vm[i]*um[cur-1] <= x) cur--; cnt += um.size()-cur; } }else { int cur = vp.size(); for (int i = (int)um.size()-1; i >= 0; --i) { while(cur > 0 && vp[cur-1]*um[i] <= x) cur--; cnt += vp.size()-cur; } cur = up.size(); for (int i = (int)vm.size()-1; i >= 0; --i) { while(cur > 0 && up[cur-1]*vm[i] <= x) cur--; cnt += up.size()-cur; } } return cnt >= s; }(mid)) ok = mid; else ng = mid; } cout << ok << "\n"; // 復元いる? ll ab = 0, cd = 0; for (auto &&i : vp) vm.emplace_back(i); for (auto &&i : up) um.emplace_back(i); if(ok == 0){ for (auto &&i : vm) { if(i == 0) ab = 0, cd = um[0]; } for (auto &&i : um) { if(i == 0) ab = vm[0], cd = 0; } }else { for (auto &&i : vm) { if(i == 0 || ok%i) continue; auto x = lower_bound(um.begin(),um.end(), ok/i); if(x != um.end() && *x == ok/i) ab = i, cd = ok/i; } } for (int i = 0; i < a; ++i) { for (int j = 0; j < b; ++j) { if(A[i]*B[j] == ab){ cout << A[i] << " " << B[j] << " "; i = a; j = b; } } } for (int i = 0; i < c; ++i) { for (int j = 0; j < d; ++j) { if(C[i]*D[j] == cd){ cout << C[i] << " " << D[j] << "\n"; i = c; j = d; } } } return 0; }