#637596 (C++17) No.1460 Max of Min

提出ソース

結果

問題	No.1460 Max of Min
ユーザー	👑 tute7627
提出日時	2021-03-31 21:52:00
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	151 ms / 2,000 ms
コード長	6,297 bytes
コンパイル時間	2,145 ms
コンパイル使用メモリ	207,112 KB
実行使用メモリ	4,388 KB
最終ジャッジ日時	2023-08-22 01:07:21
合計ジャッジ時間	10,104 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	1 ms 4,376 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	146 ms 4,376 KB
testcase_04	AC	148 ms 4,380 KB
testcase_05	AC	1 ms 4,380 KB
testcase_06	AC	143 ms 4,380 KB
testcase_07	AC	143 ms 4,380 KB
testcase_08	AC	2 ms 4,376 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	145 ms 4,376 KB
testcase_11	AC	148 ms 4,380 KB
testcase_12	AC	17 ms 4,380 KB
testcase_13	AC	69 ms 4,376 KB
testcase_14	AC	26 ms 4,380 KB
testcase_15	AC	13 ms 4,380 KB
testcase_16	AC	63 ms 4,380 KB
testcase_17	AC	32 ms 4,380 KB
testcase_18	AC	2 ms 4,380 KB
testcase_19	AC	32 ms 4,384 KB
testcase_20	AC	3 ms 4,380 KB
testcase_21	AC	6 ms 4,380 KB
testcase_22	AC	35 ms 4,380 KB
testcase_23	AC	2 ms 4,376 KB
testcase_24	AC	43 ms 4,388 KB
testcase_25	AC	2 ms 4,380 KB
testcase_26	AC	72 ms 4,380 KB
testcase_27	AC	13 ms 4,380 KB
testcase_28	AC	5 ms 4,376 KB
testcase_29	AC	39 ms 4,376 KB
testcase_30	AC	59 ms 4,380 KB
testcase_31	AC	33 ms 4,380 KB
testcase_32	AC	29 ms 4,376 KB
testcase_33	AC	8 ms 4,376 KB
testcase_34	AC	14 ms 4,380 KB
testcase_35	AC	6 ms 4,376 KB
testcase_36	AC	2 ms 4,380 KB
testcase_37	AC	17 ms 4,380 KB
testcase_38	AC	24 ms 4,380 KB
testcase_39	AC	12 ms 4,376 KB
testcase_40	AC	9 ms 4,380 KB
testcase_41	AC	6 ms 4,380 KB
testcase_42	AC	4 ms 4,380 KB
testcase_43	AC	22 ms 4,380 KB
testcase_44	AC	37 ms 4,380 KB
testcase_45	AC	2 ms 4,380 KB
testcase_46	AC	16 ms 4,380 KB
testcase_47	AC	21 ms 4,380 KB
testcase_48	AC	42 ms 4,380 KB
testcase_49	AC	30 ms 4,376 KB
testcase_50	AC	3 ms 4,380 KB
testcase_51	AC	25 ms 4,380 KB
testcase_52	AC	7 ms 4,380 KB
testcase_53	AC	17 ms 4,376 KB
testcase_54	AC	31 ms 4,384 KB
testcase_55	AC	52 ms 4,380 KB
testcase_56	AC	28 ms 4,380 KB
testcase_57	AC	42 ms 4,380 KB
testcase_58	AC	151 ms 4,380 KB
testcase_59	AC	39 ms 4,380 KB
testcase_60	AC	42 ms 4,380 KB
testcase_61	AC	30 ms 4,384 KB
testcase_62	AC	32 ms 4,380 KB
testcase_63	AC	24 ms 4,376 KB
testcase_64	AC	24 ms 4,380 KB
testcase_65	AC	50 ms 4,380 KB
testcase_66	AC	32 ms 4,380 KB
testcase_67	AC	28 ms 4,380 KB
testcase_68	AC	43 ms 4,380 KB
testcase_69	AC	38 ms 4,380 KB
testcase_70	AC	34 ms 4,380 KB
testcase_71	AC	49 ms 4,384 KB
testcase_72	AC	30 ms 4,380 KB
testcase_73	AC	30 ms 4,380 KB
testcase_74	AC	27 ms 4,384 KB
testcase_75	AC	28 ms 4,376 KB
testcase_76	AC	29 ms 4,380 KB
testcase_77	AC	28 ms 4,380 KB
testcase_78	AC	28 ms 4,380 KB
testcase_79	AC	28 ms 4,380 KB
testcase_80	AC	29 ms 4,384 KB
testcase_81	AC	29 ms 4,380 KB
testcase_82	AC	29 ms 4,376 KB
testcase_83	AC	29 ms 4,376 KB
testcase_84	AC	142 ms 4,380 KB
testcase_85	AC	142 ms 4,376 KB
testcase_86	AC	137 ms 4,376 KB
testcase_87	AC	140 ms 4,380 KB
testcase_88	AC	138 ms 4,380 KB
testcase_89	AC	147 ms 4,376 KB
testcase_90	AC	143 ms 4,376 KB
testcase_91	AC	148 ms 4,376 KB
testcase_92	AC	146 ms 4,384 KB
testcase_93	AC	137 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge() = default;
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v,w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template< class T>
struct Kitamasa {
  ll n;
  const T zero = -2*INF;//addの単位元
  const T iden = 2*INF;//mulの単位元
  using arr = vector<T>;
  arr rec_f;
  const T add(T x, T y){
    return max(x,y);
  }
  const T mul(T x, T y){
    return min(x,y);
  }
  arr zeros(){
    arr ret(n);
    for(ll i=0;i<n;i++)ret[i]=zero;
    return ret;
  }
  Kitamasa(vector<T> v):n(v.size()){ //an=sum(v0*a_(n-k)+v_1*a_(n-k+1)+...
    rec_f = zeros();
    for(ll i=0;i<n;i++)rec_f[i]=v[i];
  }
  T calc(ll k, vector<T> a){//k項目を求める, a0...ak-1
    vector<ll>bit;
    while(k){
      if(k&1)bit.push_back(1);
      else bit.push_back(0);
      k>>=1;
    }
    reverse(bit.begin(),bit.end());
    arr now=zeros();
    now[0]=iden;
    for(ll i=0;i<bit.size();i++){
      now=twice(now);
      if(bit[i]==1)now=increment(now);
    }
    T ret=zero;
    for(ll i=0;i<n;i++)ret=add(ret,mul(now[i],a[i]));
    return ret;
  }
  arr increment(arr &v){
    arr ret=zeros();
    for(ll i=1;i<n;i++)ret[i]=add(v[i-1],mul(v[n-1],rec_f[i]));
    ret[0]=mul(v[n-1],rec_f[0]);
    return ret;
  }
  arr twice(arr &v){
    arr ret=zeros();
    arr tmp=v;
    for(ll i=0;i<n;i++){
      for(ll j=0;j<n;j++){
        ret[j]=add(ret[j],mul(v[i],tmp[j]));
      }
      tmp=increment(tmp);
    }
    return ret;
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll k,n;cin>>k>>n;
  vector<ll>a(k),b(k);
  rep(i,0,k)cin>>a[i];
  rep(i,0,k)cin>>b[i];
  Kitamasa<ll>kit(b);
  cout<<kit.calc(n,a)<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード