Submission #567441

#TimeUsernameProblemLanguageResultExecution timeMemory
567441piOOEPopeala (CEOI16_popeala)C++17
17 / 100
2072 ms49324 KiB
#include <bits/stdc++.h> using namespace std; #define all(x) begin(x), end(x) #define sz(x) ((int)size(x)) #define trace(x) cout << #x << ": " << (x) << endl; typedef long long ll; #define int ll mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); const int S = 51, N = 51, T = 4001; const ll infL = 3e18; int s, n, t, A[T], ct[T][T]; ll dp[T][S], pref[T]; bool solved[N][T]; ll weight(int l, int r) { ll every = 0; for (int i = 1; i <= n; ++i) { ll sum = 0; for (int j = l; j <= r; ++j) { if (!solved[i][j]) { return 0; } sum += A[j]; } every += sum; } return every; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> t >> s; for (int i = 1; i <= t; ++i) { cin >> A[i]; pref[i] = pref[i - 1] + A[i]; } for (int i = 1; i <= n; ++i) { string ss; cin >> ss; for (int j = 1; j <= t; ++j) { solved[i][j] = (ss[j - 1] == '1'); } } for (int k = 1; k <= n; k++){ for (int i = 1; i <= t; i++){ int cur = solved[k][i]; ct[i][i] += cur; for (int j = i+1; j <= t; j++){ if (solved[k][j] == 0) cur = 0; ct[i][j] += cur; } } } fill(dp[0] + 1, dp[0] + s + 1, infL); for (int i = 1; i <= t; ++i) { dp[i][1] = pref[i] * ct[1][i]; for (int cnt = 2; cnt <= s; ++cnt) { dp[i][cnt] = infL; for (int j = i - 1; j >= cnt - 1; --j) { dp[i][cnt] = min(dp[i][cnt], dp[j][cnt - 1] + (pref[i] - pref[j]) * ct[j + 1][i]); } } } for (int i = 1; i <= s; ++i) cout << dp[t][i] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...