Submission #722820

#TimeUsernameProblemLanguageResultExecution timeMemory
722820drdilyor메기 농장 (IOI22_fish)C++17
0 / 100
1184 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]; 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 <= 9; h3++) { ll val = 0; for (int i = max(h2, h1); i < h3; i++) { val += arr[c-1][i]; } for (int i = h3; i < h2; i++) { val += arr[c][i]; } 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...