#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxt=110005;
const int mxn=55;
const int inf=2e9;
int pre[mxt];
string g[mxn];
int dp[mxt],tdp[mxt];
struct deq{
int l,r,v[mxt],cnt;
int calc(int x){
return dp[x]-pre[x]*cnt;
}
void clear(){
l=1,r=0;
}
void pb(int x){
if(dp[x]==inf){
return;
}
int val=calc(x);
while(l<=r and calc(v[r])>=val)
r--;
v[++r]=x;
}
void del(int x){
if(l<=r and v[l]==x)
l++;
}
int get(int x){
return l<=r?calc(v[l])+cnt*pre[x]:inf;
}
}l[mxn];
int last[mxn],num[mxt];
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,t,s;
cin>>n>>t>>s;
l[0].cnt=0;
for(int i=1;i<=t;i++){
cin>>pre[i];
pre[i]+=pre[i-1];
}
for(int i=1;i<=n;i++){
l[i].cnt=i;
cin>>g[i];
g[i]="#"+g[i];
for(int j=1;j<=t;j++){
if(g[i][j]=='0'){
break;
}
dp[j]+=pre[j];
}
}
for(int j=1;j<=t;j++){
debug(dp[j]);
}
cout<<dp[t]<<'\n';
for(int k=2;k<=s;k++){
for(int i=0;i<=n;i++){
l[i].clear();
last[i]=0;
}
dp[0]=inf;
for(int j=1;j<=t;j++){
num[j]=n;
l[n].pb(j-1);
for(int i=1;i<=n;i++){
if(g[i][j]=='0'){
for(int z=last[i]+1;z<=j;z++){
l[num[z]].del(z-1);
l[--num[z]].pb(z-1);
}
last[i]=j;
}
}
tdp[j]=inf;
for(int i=0;i<=n;i++){
chmin(tdp[j],l[i].get(j));
}
}
for(int j=1;j<=t;j++){
dp[j]=tdp[j];
debug(dp[j]);
}
cout<<dp[t]<<'\n';
}
}
/*
input:
*/
Compilation message
popeala.cpp: In function 'void setIO(std::string)':
popeala.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
popeala.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6492 KB |
Output is correct |
2 |
Correct |
9 ms |
35164 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
25 ms |
47732 KB |
Output is correct |
2 |
Correct |
18 ms |
45676 KB |
Output is correct |
3 |
Correct |
19 ms |
47708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
72 ms |
45660 KB |
Output is correct |
2 |
Correct |
108 ms |
48220 KB |
Output is correct |
3 |
Correct |
139 ms |
48132 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6492 KB |
Output is correct |
2 |
Correct |
9 ms |
35164 KB |
Output is correct |
3 |
Correct |
25 ms |
47732 KB |
Output is correct |
4 |
Correct |
18 ms |
45676 KB |
Output is correct |
5 |
Correct |
19 ms |
47708 KB |
Output is correct |
6 |
Correct |
72 ms |
45660 KB |
Output is correct |
7 |
Correct |
108 ms |
48220 KB |
Output is correct |
8 |
Correct |
139 ms |
48132 KB |
Output is correct |
9 |
Correct |
200 ms |
48472 KB |
Output is correct |
10 |
Correct |
307 ms |
48476 KB |
Output is correct |
11 |
Correct |
562 ms |
47992 KB |
Output is correct |
12 |
Correct |
586 ms |
50136 KB |
Output is correct |
13 |
Correct |
678 ms |
49956 KB |
Output is correct |
14 |
Correct |
717 ms |
50152 KB |
Output is correct |
15 |
Correct |
680 ms |
50152 KB |
Output is correct |