# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874895 | Sir_Ahmed_Imran | Popeala (CEOI16_popeala) | C++17 | 2048 ms | 8540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pic pair<int,char>
#define all(x) (x).begin(),(x).end()
#define sum(a) accumulate(all(a),0)
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define terminator main
#define N 20001
int pnt[N];
string a[51];
int dp[51][N];
int pre[51][N];
void solve(){
int n,m,o,p,q,r;
cin>>n>>m>>o;
for(int i=1;i<=m;i++)
cin>>pnt[i];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=0;i<51;i++)
for(int j=0;j<N;j++)
pre[i][j]=dp[i][j]=0;
for(int i=1;i<=n;i++)
for(int j=0;j<m;j++)
pre[i][j+1]=pre[i][j]+a[i][j]-'0';
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
dp[1][i]+=(pre[j][i]==i)*pnt[1]*i;
for(int i=2;i<=o;i++){
for(int j=i;j<=m;j++){
dp[i][j]=2e9;
for(int k=i-1;k<j;k++){
r=dp[i-1][k];
for(int l=1;l<=n;l++)
r+=pnt[i]*(pre[l][j]-pre[l][k]==j-k)*(j-k);
dp[i][j]=min(dp[i][j],r);
}
}
}
for(int i=1;i<=o;i++)
cout<<dp[i][m]<<nl;
}
int terminator(){
L0TA;
solve();
return 0;
}
Compilation message (stderr)
# | 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... |