# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1075026 |
2024-08-25T17:43:06 Z |
Zicrus |
Catfish Farm (IOI22_fish) |
C++17 |
|
1000 ms |
2097152 KB |
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
typedef long long ll;
int n, m;
vector<int> x, y, w;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
n = N; m = M; x = X; y = Y; w = W;
int q = min(n, n);
vector<vector<ll>> a(n, vector<ll>(q));
for (int i = 0; i < m; i++) {
a[x[i]][y[i]] = w[i];
}
vector<vector<ll>> sum(n, vector<ll>(q+1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < q; j++) {
sum[i][j+1] = sum[i][j] + a[i][j];
}
}
vector<vector<vector<ll>>> dp(n, vector<vector<ll>>(q+1, vector<ll>(q+1)));
for (int i = 1; i < n; i++) {
for (int j = 0; j <= q; j++) {
for (int j1 = 0; j1 <= q; j1++) {
for (int k = 0; k <= q; k++) {
ll val = dp[i-1][j1][k];
if (j1 > j) val += sum[i][j1] - sum[i][j];
if (j > max(j1, k)) val += sum[i-1][j] - sum[i-1][max(j1, k)];
dp[i][j][j1] = max(dp[i][j][j1], val);
}
}
}
}
ll res = 0;
for (int j = 0; j <= q; j++) {
for (int j1 = 0; j1 <= q; j1++) {
res = max(res, dp[n-1][j][j1]);
}
}
for (int i = n-2; i >= n-5 && i >= 0; i--) {
for (int j = 0; j <= q; j++) {
for (int j1 = 0; j1 <= q; j1++) {
ll val = dp[i][j][j1] + sum[i+1][j];
res = max(res, val);
}
}
}
return res;
}
#ifdef TEST
#include "grader.cpp"
#endif
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1120 ms |
2097152 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Runtime error |
916 ms |
2097152 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
928 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
352 KB |
Output is correct |
9 |
Correct |
741 ms |
28440 KB |
Output is correct |
10 |
Execution timed out |
1080 ms |
218196 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
352 KB |
Output is correct |
9 |
Correct |
741 ms |
28440 KB |
Output is correct |
10 |
Execution timed out |
1080 ms |
218196 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
352 KB |
Output is correct |
9 |
Correct |
741 ms |
28440 KB |
Output is correct |
10 |
Execution timed out |
1080 ms |
218196 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
928 ms |
2097152 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1120 ms |
2097152 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |