結果
問題 | No.1977 Extracting at Constant Intervals |
ユーザー | kiyoshi0205 |
提出日時 | 2022-06-10 23:45:34 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 5,247 bytes |
コンパイル時間 | 6,927 ms |
コンパイル使用メモリ | 351,772 KB |
実行使用メモリ | 50,816 KB |
最終ジャッジ日時 | 2024-04-27 05:10:23 |
合計ジャッジ時間 | 12,927 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 29 ms
9,088 KB |
testcase_03 | AC | 191 ms
45,824 KB |
testcase_04 | AC | 30 ms
9,344 KB |
testcase_05 | AC | 211 ms
50,816 KB |
testcase_06 | AC | 116 ms
28,800 KB |
testcase_07 | AC | 165 ms
37,120 KB |
testcase_08 | AC | 132 ms
31,104 KB |
testcase_09 | AC | 59 ms
14,720 KB |
testcase_10 | AC | 177 ms
41,600 KB |
testcase_11 | AC | 17 ms
6,940 KB |
testcase_12 | AC | 41 ms
10,112 KB |
testcase_13 | AC | 212 ms
37,632 KB |
testcase_14 | AC | 265 ms
49,408 KB |
testcase_15 | AC | 130 ms
24,192 KB |
testcase_16 | AC | 252 ms
45,952 KB |
testcase_17 | AC | 283 ms
49,792 KB |
testcase_18 | AC | 128 ms
22,912 KB |
testcase_19 | AC | 53 ms
13,312 KB |
testcase_20 | AC | 252 ms
47,104 KB |
testcase_21 | AC | 220 ms
41,984 KB |
testcase_22 | AC | 209 ms
46,208 KB |
testcase_23 | AC | 40 ms
10,752 KB |
testcase_24 | AC | 199 ms
41,344 KB |
testcase_25 | AC | 17 ms
6,940 KB |
testcase_26 | AC | 28 ms
8,576 KB |
testcase_27 | AC | 112 ms
24,192 KB |
testcase_28 | AC | 50 ms
13,312 KB |
testcase_29 | AC | 114 ms
25,088 KB |
testcase_30 | AC | 195 ms
43,264 KB |
testcase_31 | AC | 92 ms
22,272 KB |
testcase_32 | AC | 125 ms
24,704 KB |
ソースコード
#ifdef DEBUG #include"stdlibrary.h" #else #pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; #include<atcoder/all> #endif // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using ll=long long; using datas=pair<ll,ll>; using ddatas=pair<long double,long double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end()) #define endl "\n" #define popcount __builtin_popcountll #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) constexpr ll mod=1000000007; // constexpr ll mod=998244353; constexpr ll inf=1LL<<60; constexpr long double eps=1e-9; const long double PI=acosl(-1); template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";} template<class T> ostream& operator<<(ostream& os,const vector<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const set<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){ os<<"{";bool f=false; for(auto& x:v){if(f)os<<",";os<<x;f=true;} os<<"}"; return os; } template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;} #ifdef DEBUG void debugg(){cout<<endl;} template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);} #define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__) #else #define debug(...) (void(0)) #endif inline void startupcpp(void) noexcept{ cin.tie(0)->sync_with_stdio(0); cout<<fixed<<setprecision(15); } ll modinv(ll a,const ll m=mod) noexcept{ ll b=m,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+m)%m; } ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(const ll n,const ll r) noexcept{ if(n<r||r<0)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[n]=modinv(modncrlistp[n]); for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod; } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n,const ll m=mod){ if(n<0)return 0; ll res=1; while(n>0){ if(n&1)res=res*a%m; a=a*a%m; n>>=1; } return res; } constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);} constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;} using mint=atcoder::modint1000000007; void operator>>(istream& is,mint& v){long long x;is>>x;v=x;} ostream& operator<<(ostream& os,const mint& v){return os<<v.val();} ll N,M,L; int main(){ startupcpp(); // int codeforces;cin>>codeforces;while(codeforces--){ ll i,j,ans=-inf; cin>>N>>M>>L; mat dv(60,vec(N)); rep(i,N)cin>>dv[0][i]; rep1(j,60)rep(i,N){ ll nxt=(i+L%N*((1LL<<(j-1))%N))%N; dv[j][i]=dv[j-1][i]+dv[j-1][nxt]; } auto calc=[&](ll cnt,ll firstpos){ ll i,res=0; brep(i,60){ if(cnt>>i&1){ res+=dv[i][firstpos]; (firstpos+=L%N*((1LL<<i)%N))%=N; } } return res; }; //[l,r]にmod mでcな数は何個あるか auto scalc=[](ll l,ll r,ll c,ll m)->ll{ ll k=l%m; if(k<=c)l+=c-k; else l+=c-k+m; k=r%m; if(c<=k)r-=k-c; else r-=k-c+m; if(l<=r)return (r-l)/m+1; return 0; }; rep(i,min(L,N))chmax(ans,calc(scalc(i,N*M-1,i,L),i)); if(L<=N){ print(ans); return 0; } rep(i,N){ ll f=scalc(i+1,L-1,i,N)*N+i; chmax(ans,calc(scalc(f,N*M-1,f,L),i)); } print(ans); }