# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925252 | 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;
#define int long long
long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
long long dp[n+1][4][4]{};
vector<pair<int,int>>to[n+1];
for(int i = 0; i < m; i++){to[x[i]+1].push_back({y[i]+1,w[i]});}
for(int i = 0; i <= n; i++){
to[i].push_back({0,0});
to[i].push_back({n,0});
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++){
dp[0][i][j] = -1e18;
}
}
dp[0][0][0] = 0;
long long ans = 0;
for(int i = 1; i <= n; i++){
for(int j = 0; j < to[max(i-2,0)].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];
int cur = to[i][v].first;
for(auto nodes : to[i-1]){
if(cur > max(to[i-2][j].first,to[i-1][k].first)){
if(nodes.first > max(to[i-2][j].first,to[i-1][k].first)){
now += nodes.second;
}
}
}
cur = to[i-1][k].first;
for(auto nodes : to[i]){
if(cur > to[i][v].first){
if(nodes.first > to[i][v].first){
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';
// }