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<iostream>
using namespace std;
using ll = long long;
const ll inf = 1e18;
const int T = 1e3 + 123;
const int N = 52;
const int S = 52;
ll pref[T];
int cs[N][T];
ll val[T][T];
ll dp[T][S];
void upd(ll &a, ll b) {
a = min(a, b);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, t, s;
cin >> n >> t >> s;
for (int i = 1 ; i <= t ; ++ i) {
cin >> pref[i];
pref[i] += pref[i - 1];
}
for (int i = 1 ; i <= n ; ++ i) {
for (int j = 1 ; j <= t ; ++ j) {
char c; cin >> c;
cs[i][j] = cs[i][j - 1] + (c == '1');
}
}
for (int l = 0 ; l <= t ; ++ l) {
for (int r = l + 1 ; r <= t ; ++ r) {
int cnt = 0;
for (int i = 1 ; i <= n ; ++ i) {
cnt += (cs[i][r] - cs[i][l] == r - l);
}
val[l][r] = cnt * (pref[r] - pref[l]);
}
}
for (int i = 0 ; i <= t ; ++ i) {
for (int x = 0 ; x <= s ; ++ x) {
dp[i][x] = inf;
}
}
dp[0][0] = 0;
for (int i = 1 ; i <= t ; ++ i) {
for (int x = 1 ; x <= s ; ++ x) {
for (int j = 0 ; j < i ; ++ j) {
upd(dp[i][x], dp[j][x-1] + val[j][i]);
}
}
}
for (int i = 1 ; i <= s ; ++ i) {
cout << dp[t][i] << "\n";
}
}
# | 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... |