# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925255 | IS_Rushdi | 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 "fish.h"
#include <bits/stdc++.h>
using namespace std;
long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
long long dp[n+2][4][4]{};
vector<pair<int,int>>hv[n+2];
vector<int>to[n+2];
for(int i = 0; i < m; i++){
hv[x[i]+2].push_back({y[i]+1,w[i]});
to[x[i]+2].push_back(y[i]);
}
for(int i = 0; i <= n; i++){
to[i].push_back(0);
if(i > 1){
to[i].push_back(n+2);
}
sort(to[i].begin(), to[i].end());
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++){
dp[0][i][j] = -1e18;
dp[1][i][j] = -1e18;
}
}
dp[0][0][0] = 0;
dp[1][0][0] = 0;
long long ans = 0;
for(int i = 2; i <= n+1; i++){
int sz = 0;
for(int j = 0; j < to[i-2].size(); j++){
for(int k = 0; k < to[i-1].size(); k++){
for(int v = 0; v < to[i].size(); v++){
long long now = dp[i-1][k][j];
for(auto nodes : hv[i-1]){
if(nodes.first > max(to[i-2][j],to[i-1][k])){
if(nodes.first <= to[i][v]){
now += nodes.second;
}
}
}
for(auto nodes : hv[i]){
if(nodes.first > to[i][v]){
if(nodes.first <= to[i-1][k]){
now += nodes.second;
}
}
}
dp[i][v][k] = max(dp[i][v][k],now);
ans = max(ans,now);
}
}
}
}
return ans;
}
int main(){
cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
}