結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | HIR180 |
提出日時 | 2021-01-22 23:24:30 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,231 bytes |
コンパイル時間 | 3,154 ms |
コンパイル使用メモリ | 232,748 KB |
実行使用メモリ | 23,748 KB |
最終ジャッジ日時 | 2023-08-27 22:45:08 |
合計ジャッジ時間 | 59,957 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 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,384 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 4 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 6 ms
4,380 KB |
testcase_11 | AC | 5 ms
4,376 KB |
testcase_12 | AC | 3 ms
4,380 KB |
testcase_13 | AC | 7 ms
4,380 KB |
testcase_14 | AC | 3 ms
4,380 KB |
testcase_15 | AC | 9 ms
4,376 KB |
testcase_16 | AC | 4 ms
4,380 KB |
testcase_17 | AC | 7 ms
4,380 KB |
testcase_18 | AC | 99 ms
4,380 KB |
testcase_19 | AC | 37 ms
4,380 KB |
testcase_20 | AC | 107 ms
4,376 KB |
testcase_21 | AC | 29 ms
4,376 KB |
testcase_22 | AC | 44 ms
4,376 KB |
testcase_23 | AC | 71 ms
4,380 KB |
testcase_24 | AC | 55 ms
4,380 KB |
testcase_25 | AC | 65 ms
4,380 KB |
testcase_26 | AC | 84 ms
4,380 KB |
testcase_27 | AC | 55 ms
4,376 KB |
testcase_28 | RE | - |
testcase_29 | AC | 636 ms
8,048 KB |
testcase_30 | AC | 603 ms
7,980 KB |
testcase_31 | AC | 838 ms
13,004 KB |
testcase_32 | AC | 558 ms
13,244 KB |
testcase_33 | AC | 547 ms
7,984 KB |
testcase_34 | AC | 875 ms
12,008 KB |
testcase_35 | AC | 1,093 ms
14,580 KB |
testcase_36 | AC | 1,514 ms
16,100 KB |
testcase_37 | AC | 282 ms
5,976 KB |
testcase_38 | AC | 848 ms
9,436 KB |
testcase_39 | AC | 492 ms
7,800 KB |
testcase_40 | AC | 616 ms
7,948 KB |
testcase_41 | AC | 787 ms
9,684 KB |
testcase_42 | AC | 1,578 ms
15,304 KB |
testcase_43 | AC | 805 ms
12,856 KB |
testcase_44 | AC | 1,164 ms
14,564 KB |
testcase_45 | AC | 975 ms
9,828 KB |
testcase_46 | AC | 905 ms
12,124 KB |
testcase_47 | AC | 417 ms
7,208 KB |
testcase_48 | AC | 1,820 ms
23,420 KB |
testcase_49 | AC | 1,790 ms
21,780 KB |
testcase_50 | AC | 1,914 ms
21,628 KB |
testcase_51 | AC | 1,904 ms
23,044 KB |
testcase_52 | AC | 1,553 ms
23,036 KB |
testcase_53 | TLE | - |
testcase_54 | TLE | - |
testcase_55 | TLE | - |
testcase_56 | TLE | - |
testcase_57 | AC | 1,805 ms
23,144 KB |
testcase_58 | AC | 1,678 ms
21,952 KB |
testcase_59 | AC | 1,676 ms
22,944 KB |
testcase_60 | AC | 1,643 ms
23,388 KB |
testcase_61 | AC | 1,643 ms
22,248 KB |
testcase_62 | AC | 1,640 ms
22,908 KB |
testcase_63 | RE | - |
testcase_64 | RE | - |
testcase_65 | RE | - |
testcase_66 | RE | - |
testcase_67 | RE | - |
testcase_68 | RE | - |
testcase_69 | RE | - |
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 | RE | - |
ソースコード
//Let's join Kaede Takagaki Fan Club !! #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; //#define int long long typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define eb emplace_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define a first #define b second #define fi first #define sc second #define rng(i,a,b) for(int i=int(a);i<int(b);i++) #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) #define all(x) x.begin(),x.end() #define si(x) int(x.size()) #ifdef LOCAL #define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl #else #define dmp(x) void(0) #endif template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;} template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;} template<class t> using vc=vector<t>; template<class t,class u> ostream& operator<<(ostream& os,const pair<t,u>& p){ return os<<"{"<<p.fi<<","<<p.sc<<"}"; } template<class t> ostream& operator<<(ostream& os,const vc<t>& v){ os<<"{"; for(auto e:v)os<<e<<","; return os<<"}"; } template<class T> void g(T &a){ cin >> a; } template<class T> void o(const T &a,bool space=false){ cout << a << (space?' ':'\n'); } //ios::sync_with_stdio(false); const ll mod = 1000000007;//998244353 //mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); template<class T> void add(T&a,T b){ a+=b; if(a >= mod) a-=mod; } ll modpow(ll x,ll n){ ll res=1; while(n>0){ if(n&1) res=res*x%mod; x=x*x%mod; n>>=1; } return res; } int n[4]; vc<int>a[4]; ll cnt; vc<pair<ll,P>>v[2]; void solve(){ rep(i, 4) cin >> n[i]; cin >> cnt; rep(i, 4){ a[i].resize(n[i]); rep(j, n[i]) cin >> a[i][j]; } rep(i, 2){ for(auto at:a[i*2]){ for(auto at2:a[i*2+1]){ v[i].pb(mp(1LL*at*at2, mp(at, at2))); } } SORT(v[i]); } ll lb = -1e18, ub = 1e18; //(lb, ub] while(ub-lb > 1){ ll mid = (lb+ub)/2, C = 0; for(auto att:v[0]){ ll at = att.a; ll lv, uv; if(at == 0){ if(mid < 0) continue; lv = -1e18, uv = 1e18; } else if(at > 0){ lv = -1e18; if(mid >= 0) uv = mid / at; else uv = -1 * ((-mid+at-1) / at); } else{ uv = 1e18; if(mid < 0) lv = ((-mid-at-1) / (-at)); else lv = -1 * mid / (-at); } C += POSU(v[1], mp(uv+1, mp(-INF, -INF))) - POSL(v[1], mp(lv, mp(-INF, -INF))); } if(C >= cnt) ub = mid; else lb = mid; } for(auto att:v[0]){ ll at = att.a; if(ub%at != 0) continue; int x = POSL(v[1], mp(ub/at, mp(-INF, -INF))); if(x < v[1].size() && v[1][x].a == ub/at){ cout<<ub<<endl; cout << att.b.a << " " << att.b.b << " "; cout << v[1][x].b.a << " " << v[1][x].b.b << endl; return; } } assert(false); } signed main(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20); int t; t = 1; //cin >> t; while(t--) solve(); }