# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824872 | alvingogo | Catfish Farm (IOI22_fish) | C++17 | 35 ms | 12376 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>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
const long long inf=1e16;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
long long ans=0;
vector<vector<pair<int,int> > > v(n);
vector<int> q(n);
for(int i=0;i<m;i++){
v[x[i]].push_back({y[i],w[i]});
q[x[i]]=w[i];
}
vector<array<long long,3> > dp(n);
for(int i=0;i<n;i++){
dp[i][0]=dp[i][1]=dp[i][2]=0;
}
dp[0][2]=-inf;
for(int i=1;i<n;i++){
dp[i][0]=max({dp[i-1][0],dp[i-1][1]+q[i-1],dp[i-1][2]});
dp[i][1]=max({dp[i-1][1],dp[i-1][2]});
dp[i][2]=dp[i-1][0]+q[i];
}
return max({dp[n-1][0],dp[n-1][1],dp[n-1][2]});
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |