# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51795 | 2018-06-21T08:12:02 Z | evpipis | Popeala (CEOI16_popeala) | C++14 | 15 ms | 2028 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int len = 2e4+5; const ll inf = 1e15; int po[len], can[55][len], n, s, t; ll dp[len][55]; int val(int l, int r){ int ans = 0; for (int i = 1; i <= n; i++) if (can[i][r]-can[i][l-1] == r-l+1) ans += po[r]-po[l-1]; return ans; } ll solve(int i, int rem){ if (i == t+1 && rem == 0) return 0; if (i == t+1 && rem != 0) return inf; if (rem == 1) return val(i, t); if (dp[i][rem] != -1) return dp[i][rem]; ll ans = inf; for (int j = i; j <= n; j++) ans = min(ans, val(i, j) + solve(j+1, rem-1)); //printf("i = %d, rem = %d, ans = %lld\n", i, rem, ans); return dp[i][rem] = ans; } int main(){ scanf("%d %d %d", &n, &t, &s); for (int i = 1; i <= t; i++) scanf("%d", &po[i]); for (int i = 1; i <= n; i++){ scanf(" "); for (int j = 1; j <= t; j++){ char temp; scanf("%c", &temp); if (temp == '1') can[i][j] = 1; } } /*for (int i = 1; i <= n; i++){ for (int j = 1; j <= t; j++) printf("%d", can[i][j]); printf("\n"); }*/ for (int j = 1; j <= t; j++) po[j] += po[j-1]; for (int i = 1; i <= n; i++) for (int j = 1; j <= t; j++) can[i][j] += can[i][j-1]; for (int i = 1; i <= t; i++) for (int j = 0; j <= s; j++) dp[i][j] = -1; //for (int i = 1; i <= t; i++) // for (int j = i; j <= t; j++) // printf("(%d, %d) = %d\n", i, j, val(i, j)); for (int j = 1; j <= s; j++) printf("%lld\n", solve(1, j)); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Incorrect | 3 ms | 616 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 928 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 2028 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Incorrect | 3 ms | 616 KB | Output isn't correct |