結果

問題 No.1977 Extracting at Constant Intervals
ユーザー 👑 tute7627tute7627
提出日時 2022-06-10 22:56:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 87 ms / 2,000 ms
コード長 8,981 bytes
コンパイル時間 2,734 ms
コンパイル使用メモリ 217,840 KB
実行使用メモリ 64,412 KB
最終ジャッジ日時 2024-10-09 09:42:46
合計ジャッジ時間 5,265 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 11 ms
10,752 KB
testcase_03 AC 63 ms
56,724 KB
testcase_04 AC 12 ms
11,008 KB
testcase_05 AC 72 ms
63,236 KB
testcase_06 AC 39 ms
35,696 KB
testcase_07 AC 51 ms
46,016 KB
testcase_08 AC 45 ms
38,208 KB
testcase_09 AC 20 ms
17,792 KB
testcase_10 AC 58 ms
51,600 KB
testcase_11 AC 7 ms
7,424 KB
testcase_12 AC 14 ms
12,160 KB
testcase_13 AC 68 ms
48,228 KB
testcase_14 AC 86 ms
63,792 KB
testcase_15 AC 42 ms
30,980 KB
testcase_16 AC 82 ms
59,548 KB
testcase_17 AC 87 ms
64,412 KB
testcase_18 AC 41 ms
29,432 KB
testcase_19 AC 20 ms
16,256 KB
testcase_20 AC 82 ms
60,964 KB
testcase_21 AC 73 ms
54,684 KB
testcase_22 AC 83 ms
59,748 KB
testcase_23 AC 15 ms
12,928 KB
testcase_24 AC 71 ms
53,668 KB
testcase_25 AC 8 ms
7,424 KB
testcase_26 AC 12 ms
10,368 KB
testcase_27 AC 40 ms
30,976 KB
testcase_28 AC 20 ms
16,384 KB
testcase_29 AC 42 ms
32,068 KB
testcase_30 AC 75 ms
56,100 KB
testcase_31 AC 38 ms
28,044 KB
testcase_32 AC 42 ms
31,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#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 UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#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 T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
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>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";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;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
  vector<T>inv(ord.size());
  for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
  return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
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 acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
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;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  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>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
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;
    T 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<typename T, typename F>
struct Doubling
{
  const ll LOG = 50;
  vector<vector<int>> nxt;
  vector<vector<T>> sum;
  F f;
  T iden;
  Doubling(int sz, T iden,F &f):iden(iden),f(f)
  { 
    nxt.assign(LOG, vector< int >(sz, -1));
    sum.assign(LOG, vector< T >(sz, iden));
  }

  void set_next(int k, int x){
    nxt[0][k] = x;
  }
  void set_val(int k, T x){
    sum[0][k] = x;
  }
  void build()
  {
    for(ll k = 0; k + 1 < LOG; k++) {
      for(ll i = 0; i < nxt[k].size(); i++) {
        if(nxt[k][i] == -1) nxt[k + 1][i] = -1;
        else{
          nxt[k + 1][i] = nxt[k][nxt[k][i]];
          sum[k + 1][i] = f(sum[k][i],sum[k][nxt[k][i]]);
        }
      }
    }
  }
  ll query(int k, ll t)//t個進んだ時のsum
  {
    T ret = iden;
    for(ll i = LOG - 1; i >= 0; i--) {
      if((t >> i) & 1){
        ret = f(ret, sum[i][k]);
        //cout<<endl;
        //cout<<i spa k spa t spa sum[i][k]<<endl;
        k = nxt[i][k];
      }
    }
    return ret;
  }
  using C=function<bool(int, T)>;
  T query2(int k, C check)//checkを満たすような最小の移動？
  {
    ll ret = 0;
    T ret2 = 0;
    for(ll i = LOG - 1; i >= 0; i--){
      if(nxt[i][k] != -1 && !check(nxt[i][k],f(ret2, sum[i][k]))){
        ret += 1LL << i;
        ret2 = f(ret2, sum[i][k]);
        k = nxt[i][k];
      }
    }
    ret += 1;
    ret2 = f(ret2, sum[0][k]);
    k = nxt[0][k];
    return ret2;
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,m,l;cin>>n>>m>>l;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  auto f=[&](ll x,ll y){return x+y;};
  Doubling<ll,decltype(f)>db(n,0,f);
  rep(i,0,n){
    db.set_val(i,a[i]);
    db.set_next(i,(i+l)%n);
  }
  db.build();
  //debug(db.nxt);
  //debug(db.sum);
  vector<ll>cand;
  rep(i,0,min(n,l))cand.PB(i);
  rep(i,max(0LL,l-n-1),l)cand.PB(i);
  res=LLONG_MIN;
  for(auto c:cand){
    ll num=(n*m-c-1)/l+1;
    //cout<<c spa num spa db.query(c%l,num)<<endl;
    chmax(res,db.query(c%n,num));
  }
  cout<<res<<endl;
  return 0;
}
0