# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24746 | 2017-06-12T18:14:06 Z | Bruteforceman | Popeala (CEOI16_popeala) | C++11 | 436 ms | 20056 KB |
#include "bits/stdc++.h" using namespace std; #define prev sdkjflksd int points[20010]; long long pref[20010]; int result[55][20010]; int prev[55][20010]; vector <int> v[20010]; long long dp[55][20010]; const long long inf = 1e16; int main(int argc, char const *argv[]) { int N, T, S; scanf("%d %d %d", &N, &T, &S); for(int i = 1; i <= T; i++) { scanf("%d", &points[i]); pref[i] = pref[i - 1] + points[i]; } for(int i = 1; i <= N; i++) { char *s; s = new char [T]; scanf("%s", s); for(int j = 1; j <= T; j++) { result[i][j] = s[j-1] - '0'; } delete s; } for(int i = 1; i <= N; i++) { for(int j = 1; j <= T; j++) { if(result[i][j] == 1) { prev[i][j] = 1 + prev[i][j - 1]; } else { prev[i][j] = 0; } } } for(int i = 1; i <= T; i++) { vector <int> h; for(int j = 1; j <= N; j++) { h.push_back(prev[j][i]); } sort(h.begin(), h.end()); reverse(h.begin(), h.end()); for(auto j : h) { v[i].push_back(i - j); } v[i].push_back(i); } dp[0][0] = 0; for(int i = 1; i <= T; i++) { dp[0][i] = inf; } for(int i = 1; i <= S; i++) { dp[i][0] = inf; for(int j = 1; j <= T; j++) { dp[i][j] = inf; for(int x = 0; x < (int) v[j].size(); x++) { for(int k = 0; k < v[j][x]; k++) { dp[i][j] = min(dp[i][j], dp[i - 1][k] + (pref[j] - pref[k]) * x); } } } } for(int i = 1; i <= S; i++) { printf("%lld\n", dp[i][T]); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 19924 KB | Output is correct |
2 | Correct | 0 ms | 19924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 376 ms | 20056 KB | Output is correct |
2 | Correct | 353 ms | 20056 KB | Output is correct |
3 | Correct | 436 ms | 20056 KB | Output is correct |