Segcolt/Codeforces-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Finally finish the problem!

Browse Source
This commit is contained in:
Segcolt 2024-09-20 17:28:57 -03:00
parent 815e707dbc
commit f5319f2450
3 changed files with 28 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
.gitignore vendored Normal file
View File

@ -0,0 +1 @@
build

BIN
codeforces/round-105/e/E. Porcelain
View File

Binary file not shown.

35
codeforces/round-105/e/E. Porcelain.cpp
View File

@ -76,24 +76,43 @@ int main()
cin >> n >> m; cin >> n >> m;
vvl plates(n); vvl plates(n);
vl maxi(n, 0);
vvl prefix(n);
rep(i, n) { rep(i, n) {
int n; int n;
cin >> n; cin >> n;
plates[i].resize(n); plates[i].resize(n);
cin >> plates[i]; prefix[i].resize(n + 1);
prefix[i][0] = 0;
for (size_t j = 0; j < n; j++) {
cin >> plates[i][j];
prefix[i][j + 1] = prefix[i][j] + plates[i][j];
maxi[i] += plates[i][j];
}
} }
vvl dp(n, vl(100, 0)); vvl dp(n, vl(101, 0));
for (size_t i = 0; i < n; i++) { for (size_t i = 0; i < n; i++) {
vvl dp2(101, vl(101, 0)); dp[i][plates[i].size()] = maxi[i];
for (size_t j = 0; j < plates[i].size(); j++) {
for (size_t k = j; k < plates[i]. size(); k++) {
rmax(dp[i][plates[i].size() - (k - j + 1)], maxi[i] - prefix[i][k + 1] + prefix[i][j]);
}
}
for (size_t j = plates[i].size() + 1; j <= 100; j++) {
dp[i][j] = dp[i][j - 1];
}
}
// cout << dp;
for (int k = plates[i].size() - 1; k >= 0; k--) { vvl ans(n + 1, vl(m + 1, 0));
for (int j = 1; j <= k; j++) { for (size_t i = 1; i <= n; i++) {
dp2[j][k] = max(dp2[j - 1][k] + plates[i][j - 1], dp2[j][k + 1] + plates[i][k]); for (size_t j = 1; j <= m; j++) {
rmax(dp[i][plates[i].size()-(k-j)], dp2[j][k]); for (size_t k = 0; k <= j && k <= 100; k++) {
rmax(ans[i][j], ans[i - 1][j - k] + dp[i - 1][k]);
} }
} }
} }
cout << dp; cout << ans[n][m] << '\n';
} }