제출 #832246

#제출 시각아이디문제언어결과실행 시간메모리
832246fatemetmhr메기 농장 (IOI22_fish)C++17
9 / 100
28 ms6600 KiB
// komak! #include "fish.h" #include <bits/stdc++.h> using namespace std; #define debug(x) cerr << "(" << (#x) << "): " << (x) << endl; #define all(x) x.begin(), x.end() #define fi first #define se second #define mp make_pair #define pb push_back typedef long long ll; const ll mod = 1e9 + 7; const int maxn5 = 3e5 + 10; ll av[maxn5]; ll dp[maxn5][2]; long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w) { for(int i = 0; i < m; i++){ av[x[i]] = w[i]; } ll ans = 0; dp[0][0] = dp[0][1] = 0; for(int i = 1; i < n; i++){ dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + av[i]); dp[i][1] = max(dp[i - 1][1], (i >= 2 ? max(dp[i - 2][0], dp[i - 2][1]) : 0) + av[i - 1]); ans = max({ans, dp[i][0], dp[i][1]}); } return ans; }
#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...