Submission #722827

#TimeUsernameProblemLanguageResultExecution timeMemory
722827drdilyorCatfish Farm (IOI22_fish)C++17
0 / 100
714 ms2097152 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; ll max_weights( int n, int m, vector<int> x, vector<int> y, vector<int> w) { vector arr(n+1, vector(n+1, 0ll)); for (int i = 0; i < m; i++) arr[x[i]+1][y[i]] += w[i]; for (int c = 0; c <= n; c++) { for (int i = 0; i < n; i++) arr[c][i+1] += arr[c][i]; } auto sum = [&](int c, int l, int r) { // [l, r) return arr[c][r] - arr[c][l]; }; vector memo(n+1, vector(n+1, vector(n+1, -1ll))); auto dp = [&](auto& dp, int c, int h1, int h2)->ll{ if (c == n+1) return 0; ll& res = memo[c][h1][h2]; if (res!=-1) return res; res = 0; for (int h3 = 0; h3 <= n; h3++) { ll val = sum(c-1, h2, h3) - sum(c-1, h2, h1) + sum(c-1, h3, h1) + sum(c-1, h3, h2); res = max(res, val + dp(dp, c+1, h2, h3)); } return res; }; ll res = dp(dp, 1, 0, 0); return res; }
#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...