#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int N = 3000;
i64 dp[N + 1][N + 1][2];
i64 pre[N + 1][N + 1];
void chmax(i64 &a, i64 b) {
if (a < b) {
a = b;
}
}
long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
for (int i = 0; i < m; i++) {
pre[X[i]][Y[i] + 1] += W[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
pre[i][j + 1] += pre[i][j];
}
}
memset(dp, 190, sizeof dp);
for (int i = 0; i <= n; i++) {
dp[0][i][0] = dp[0][i][1] = 0;
}
for (int i = 1; i < n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = j; k <= n; k++) {
chmax(dp[i][k][0], dp[i - 1][j][0] + pre[i - 1][k] - pre[i - 1][j]);
}
for (int k = j; k >= 0; k--) {
chmax(dp[i][k][1], dp[i - 1][j][1] + pre[i][j] - pre[i][k]);
}
if (i >= 2) {
for (int k = 0; k <= n; k++) {
chmax(dp[i][k][0], dp[i - 2][j][1] + pre[i - 1][max(j, k)] - pre[i - 1][min(j, k)]);
}
}
}
for (int j = 0; j <= n; j++) {
chmax(dp[i][j][1], dp[i][j][0]);
}
if (i + 1 < n)
chmax(dp[i + 1][0][0], dp[i][0][1]);
}
i64 ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, dp[n - 1][i][1]);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
729 ms |
433280 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
54 ms |
141196 KB |
Output is correct |
2 |
Runtime error |
732 ms |
436956 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
785 ms |
429168 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
141276 KB |
Output is correct |
2 |
Correct |
47 ms |
141260 KB |
Output is correct |
3 |
Correct |
48 ms |
141196 KB |
Output is correct |
4 |
Correct |
47 ms |
141264 KB |
Output is correct |
5 |
Correct |
46 ms |
141248 KB |
Output is correct |
6 |
Correct |
46 ms |
141276 KB |
Output is correct |
7 |
Correct |
49 ms |
141280 KB |
Output is correct |
8 |
Correct |
55 ms |
141272 KB |
Output is correct |
9 |
Incorrect |
56 ms |
142016 KB |
1st lines differ - on the 1st token, expected: '216624184325', found: '214837477243' |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
141276 KB |
Output is correct |
2 |
Correct |
47 ms |
141260 KB |
Output is correct |
3 |
Correct |
48 ms |
141196 KB |
Output is correct |
4 |
Correct |
47 ms |
141264 KB |
Output is correct |
5 |
Correct |
46 ms |
141248 KB |
Output is correct |
6 |
Correct |
46 ms |
141276 KB |
Output is correct |
7 |
Correct |
49 ms |
141280 KB |
Output is correct |
8 |
Correct |
55 ms |
141272 KB |
Output is correct |
9 |
Incorrect |
56 ms |
142016 KB |
1st lines differ - on the 1st token, expected: '216624184325', found: '214837477243' |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
141276 KB |
Output is correct |
2 |
Correct |
47 ms |
141260 KB |
Output is correct |
3 |
Correct |
48 ms |
141196 KB |
Output is correct |
4 |
Correct |
47 ms |
141264 KB |
Output is correct |
5 |
Correct |
46 ms |
141248 KB |
Output is correct |
6 |
Correct |
46 ms |
141276 KB |
Output is correct |
7 |
Correct |
49 ms |
141280 KB |
Output is correct |
8 |
Correct |
55 ms |
141272 KB |
Output is correct |
9 |
Incorrect |
56 ms |
142016 KB |
1st lines differ - on the 1st token, expected: '216624184325', found: '214837477243' |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
785 ms |
429168 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
729 ms |
433280 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |