結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー |
|
提出日時 | 2021-01-22 23:36:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,510 ms / 2,000 ms |
コード長 | 5,452 bytes |
コンパイル時間 | 2,174 ms |
コンパイル使用メモリ | 211,412 KB |
最終ジャッジ日時 | 2025-01-18 06:25:08 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 74 |
ソースコード
//@formatter:off#include<bits/stdc++.h>#define overload4(_1,_2,_3,_4,name,...) name#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define pb push_back#define eb emplace_back#ifdef __LOCAL#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }#else#define debug(...) void(0)#endif#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)using namespace std;using ll = long long;using ld = long double;using P = pair<int,int>;using LP = pair<ll,ll>;using vi = vector<int>;using vvi = vector<vector<int>>;using vl = vector<ll>;using vvl = vector<vector<ll>>;using vd = vector<double>;using vvd = vector<vector<double>>;using vs = vector<string>;using vc = vector<char>;using vvc = vector<vector<char>>;using vb = vector<bool>;using vvb = vector<vector<bool>>;using vp = vector<P>;using vvp = vector<vector<P>>;template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']';}template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}void scan(){}template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }template<class T> void print(const T& t){ cout << t << '\n'; }template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }template<class T> void fin(T a) { print(a); exit(0); }const string yes[] = {"no","yes"};const string Yes[] = {"No","Yes"};const string YES[] = {"NO","YES"};const int inf = 1001001001;const ll linf = 1001001001001001001;//@formatter:onint main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);INT(k, l, m, n);LL(s);vi a(k), b(l), c(m), d(n);cin >> a >> b >> c >> d;vl f, g;rep(i, k) rep(j, l) f.pb(a[i] * b[j]);rep(i, m) rep(j, n) g.pb(c[i] * d[j]);vl fn, fp, gn, gp;ll fz = 0, gz = 0;for (ll i : f) {if (i == 0) fz++;else if (i > 0) fp.pb(i);else fn.pb(-i);}for (ll i : g) {if (i == 0) gz++;else if (i > 0) gp.pb(i);else gn.pb(-i);}sort(all(fn));sort(all(fp));sort(all(gn));sort(all(gp));ll ok = linf, ng = -linf;auto F = [&](ll x) -> bool {ll cnt = 0;if (x >= 0) {// use 0{cnt += fz * g.size();cnt += gz * f.size();cnt -= fz * gz;}// negative * positive{cnt += fn.size() * gp.size();cnt += gn.size() * fp.size();}// positive * positive{for (ll i : fp) {auto it = upper_bound(all(gp), x / i);cnt += it - gp.begin();}}// negative * negative{for (ll i : fn) {auto it = upper_bound(all(gn), x / i);cnt += it - gn.begin();}}} else {x = abs(x);// negative * positivefor (ll i : fn) {auto it = lower_bound(all(gp), (x + i - 1) / i);cnt += gp.end() - it;}for (ll i : gn) {auto it = lower_bound(all(fp), (x + i - 1) / i);cnt += fp.end() - it;}}return cnt >= s;};while (abs(ok - ng) > 1) {ll mid = (ng + ok) / 2;if (F(mid)) ok = mid;else ng = mid;}print(ok);ll fa = linf, ga = linf;set<ll> st;for (ll i : g) st.insert(i);for (ll i : f) {if (i == 0) {if (ok == 0) {fa = i, ga = g.back();break;} else continue;}if (ok % i != 0) continue;ll j = ok / i;if (st.count(j)) {fa = i, ga = j;break;}}assert(fa != linf);vi ans(4);rep(i, k) rep(j, l) {if (a[i] * b[j] == fa) {ans[0] = a[i];ans[1] = b[j];}}rep(i, m) rep(j, n) {if (c[i] * d[j] == ga) {ans[2] = c[i];ans[3] = d[j];}}rep(i, 4) cout << ans[i] << (i < 3 ? ' ' : '\n');}