Submission #627361

#TimeUsernameProblemLanguageResultExecution timeMemory
627361c28dnv9q3Catfish Farm (IOI22_fish)C++17
0 / 100
24 ms3156 KiB
#include "fish.h" #include <vector> using namespace std; using ll = long long; ll max_weights( int N, int M, vector<int> X, vector<int> Y, vector<int> W ) { vector<int> v(N); for (int i = 0; i < M; i++) v[X[i]] += W[i]; vector<ll> dp(N+5); for (int i = 1; i < N; i++) { dp[i+5] = max( dp[i+5-1], dp[i+5-3] + v[i] + v[i-2] ); } return dp[N+4]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...