結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | yuto1115 |
提出日時 | 2021-01-22 23:36:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,714 ms / 2,000 ms |
コード長 | 5,452 bytes |
コンパイル時間 | 2,342 ms |
コンパイル使用メモリ | 215,660 KB |
実行使用メモリ | 33,884 KB |
最終ジャッジ日時 | 2023-08-27 23:12:20 |
合計ジャッジ時間 | 40,448 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,500 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 4 ms
4,376 KB |
testcase_09 | AC | 3 ms
4,376 KB |
testcase_10 | AC | 5 ms
4,380 KB |
testcase_11 | AC | 4 ms
4,376 KB |
testcase_12 | AC | 3 ms
4,380 KB |
testcase_13 | AC | 4 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 7 ms
4,376 KB |
testcase_16 | AC | 4 ms
4,376 KB |
testcase_17 | AC | 5 ms
4,376 KB |
testcase_18 | AC | 62 ms
4,636 KB |
testcase_19 | AC | 23 ms
4,376 KB |
testcase_20 | AC | 66 ms
4,376 KB |
testcase_21 | AC | 20 ms
4,380 KB |
testcase_22 | AC | 32 ms
4,588 KB |
testcase_23 | AC | 62 ms
4,776 KB |
testcase_24 | AC | 44 ms
4,952 KB |
testcase_25 | AC | 61 ms
4,744 KB |
testcase_26 | AC | 70 ms
4,620 KB |
testcase_27 | AC | 36 ms
4,380 KB |
testcase_28 | AC | 493 ms
15,708 KB |
testcase_29 | AC | 415 ms
12,204 KB |
testcase_30 | AC | 413 ms
10,336 KB |
testcase_31 | AC | 559 ms
14,592 KB |
testcase_32 | AC | 788 ms
24,848 KB |
testcase_33 | AC | 387 ms
10,584 KB |
testcase_34 | AC | 598 ms
20,240 KB |
testcase_35 | AC | 682 ms
14,876 KB |
testcase_36 | AC | 1,044 ms
26,376 KB |
testcase_37 | AC | 204 ms
11,632 KB |
testcase_38 | AC | 505 ms
12,008 KB |
testcase_39 | AC | 328 ms
9,080 KB |
testcase_40 | AC | 376 ms
12,304 KB |
testcase_41 | AC | 545 ms
17,268 KB |
testcase_42 | AC | 1,025 ms
19,044 KB |
testcase_43 | AC | 514 ms
15,180 KB |
testcase_44 | AC | 766 ms
15,740 KB |
testcase_45 | AC | 565 ms
13,060 KB |
testcase_46 | AC | 626 ms
21,152 KB |
testcase_47 | AC | 407 ms
11,984 KB |
testcase_48 | AC | 1,117 ms
33,884 KB |
testcase_49 | AC | 999 ms
31,596 KB |
testcase_50 | AC | 1,153 ms
31,224 KB |
testcase_51 | AC | 1,102 ms
31,624 KB |
testcase_52 | AC | 972 ms
31,588 KB |
testcase_53 | AC | 1,714 ms
33,140 KB |
testcase_54 | AC | 1,630 ms
33,156 KB |
testcase_55 | AC | 1,450 ms
32,520 KB |
testcase_56 | AC | 1,701 ms
32,996 KB |
testcase_57 | AC | 1,068 ms
31,968 KB |
testcase_58 | AC | 773 ms
18,820 KB |
testcase_59 | AC | 768 ms
19,052 KB |
testcase_60 | AC | 761 ms
19,228 KB |
testcase_61 | AC | 765 ms
20,376 KB |
testcase_62 | AC | 765 ms
18,984 KB |
testcase_63 | AC | 15 ms
12,080 KB |
testcase_64 | AC | 14 ms
12,324 KB |
testcase_65 | AC | 14 ms
12,128 KB |
testcase_66 | AC | 15 ms
12,828 KB |
testcase_67 | AC | 14 ms
12,316 KB |
testcase_68 | AC | 1 ms
4,380 KB |
testcase_69 | AC | 1 ms
4,376 KB |
testcase_70 | AC | 1 ms
4,376 KB |
testcase_71 | AC | 2 ms
4,376 KB |
testcase_72 | AC | 1 ms
4,376 KB |
testcase_73 | AC | 1 ms
4,380 KB |
ソースコード
//@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:on int 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 * positive for (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'); }