This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
int32_t main() {
LCBorz;
int n,t,s;cin>>n>>t>>s;
vector<int> v(t+1);
for(int i=1;i<=t;i++){
cin>>v[i];
v[i]+=v[i-1];
}
vector pre(n,vector(t+1,0)),last(t+1,vector(n+2,0));
for(int i=0;i<n;i++){
for(int j=1;j<=t;j++){
char c;cin>>c;
pre[i][j]=c-'0'+pre[i][j-1];
last[j][i]=(c=='0'?j:last[j-1][i]);
}
}
for(int j=1;j<=t;j++){
last[j][n]=j;
sort(all(last[j]));
}
vector dp(s+1,vector(t+1,INF));
dp[0][0]=0;
for(int i=1;i<=s;i++){
deque<int> d[n+1];
for(int j=1;j<=t;j++){
for(int cnt=0;cnt<=n;cnt++){
while(d[cnt].size()&&d[cnt].front()<last[j][cnt]){
d[cnt].pop_front();
}
for(int i1=last[j-1][cnt+1];i1<last[j][cnt+1];i1++){
while(d[cnt].size()&&dp[i-1][d[cnt].front()]-cnt*v[d[cnt].front()]>=dp[i-1][i1]-cnt*v[i1]){
d[cnt].pop_front();
}
d[cnt].push_back(i1);
}
if(d[cnt].size()){
dp[i][j]=min(dp[i][j],dp[i-1][d[cnt].front()]+cnt*v[j]-cnt*v[d[cnt].front()]);
}
/*for(int k=last[j][cnt];k<last[j][cnt+1];k++){
dp[i][j]=min(dp[i][j],dp[i-1][k]+cnt*(v[j]-v[k]));
}*/
}
}
}
for(int i=1;i<=s;i++){
cout<<dp[i][t]<<endl;
}
return 0;
}
/*
5 5 5
1 5 2 4 3
11010
00101
10011
00010
11011
0
3
12
22
40
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |