Submission #1234580

#TimeUsernameProblemLanguageResultExecution timeMemory
1234580Ghulam_Junaid메기 농장 (IOI22_fish)C++20
9 / 100
26 ms5820 KiB
#include <bits/stdc++.h> #include "fish.h" using namespace std; typedef long long ll; ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) { vector<pair<int, int>> vec; ll xx[n + 1] = {}; for (int i = 0; i < m; i ++){ vec.push_back({x[i], w[i]}); xx[x[i]] = w[i]; } sort(vec.begin(), vec.end()); ll dp[n][2] = {}; dp[0][0] = 0, dp[0][1] = xx[1]; for (int i = 1; i < n; i ++){ dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]); dp[i][1] = dp[i - 1][1] - xx[i] + xx[i + 1]; if (i == 1) dp[i][1] = max(dp[i][1], xx[0] + xx[2]); else{ dp[i][1] = max(dp[i][1], dp[i - 2][0] + xx[i - 1] + xx[i + 1]); dp[i][1] = max(dp[i][1], dp[i - 2][1] + xx[i + 1]); } } return max(dp[n - 1][0], dp[n - 1][1]); }
#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...