# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
832452 | 2023-08-21T10:34:45 Z | NothingXD | 메기 농장 (IOI22_fish) | C++17 | 0 ms | 0 KB |
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; void debug_out(){cerr << endl;} template<typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << ' '; debug_out(T...); } #define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__) #define F first #define S second #define all(x) x.begin(), x.end() #define MP(x, y) make_pair(x, y) const int maxn = 3e5 + 10; int w[maxn]; ll dp[maxn]; ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { for (int i = 0; i < M; i++){ w[X[i]] = W[i]; } dp[0] = 0; for (int i = 1; i < N; i++){ dp[i] = w[i-1]; if (i > 1){ dp[i] += dp[i-2]; } if (i > 2){ dp[i] = max(dp[i], dp[i-3] + w[i-2] + w[i-1]); } } return max(dp[n-1], dp[n-2] + w[n-1]); }