| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1022770 | vjudge1 | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 100;
const int maxl = 11;
int n;
ll dp[maxn][maxn][maxn];
ll a[maxn][maxl];
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
n = N;
for(int i = 0; i < M; i++){
X[i]++; Y[i]++;
a[X[i]][Y[i]] += W[i];
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= 10; j++){
a[i][j] += a[i][j-1];
}
}
for(int c = 1; c <= n + 1; c++){
for(int i = 0; i <= 10; i++){
for(int j = 0; j <= 10; j++){
dp[c][i][j] = -(ll)1e18;
if(c == 1 && i == 0) dp[c][i][j] = 0;
}
}
}
for(int c = 2; c <= n + 1; c++){
for(int i = 0; i <= 10; i++){
for(int j = 0; j <= 10; j++){
for(int k = 0; k <= 10; k++){
ll x = dp[c-1][i][j];
if(max(i, k) > j){
x += a[c-1][max(i, k)] - a[c-1][j];
}
dp[c][j][k] = max(dp[c][j][k], x);
}
}
}
}
ll ans = 0;
for(int i = 0; i <= 10; i++){
ans = max(ans, dp[n+1][i][0]);
}
return ans;
}