Submission #1231581

#TimeUsernameProblemLanguageResultExecution timeMemory
1231581nicolo_010메기 농장 (IOI22_fish)C++20
0 / 100
49 ms9800 KiB
#include <bits/stdc++.h> #include "fish.h" using namespace std; using ll = long long; using pii = pair<int, int>; template <typename T> using v = vector<T>; #define rep(i, k, n) for (int i = k; i < n; i++) ll max_weights(int N, int M, v<int> X, v<int> Y, v<int> W) { v<ll> a(N, 0); rep(i, 0, M) { a[X[i]] += W[i]; } ll dp[N][2]; rep(i, 0, 2) dp[0][i] = 0; rep(i, 1, N) { dp[i][0] = max(dp[i-1][1], dp[i-1][0]); dp[i][1] = max(dp[i-1][1], dp[i-1][0]); if (i >= 2) { dp[i][1] = max(dp[i][1], dp[i-2][0]+a[i-1]); //si coloco columna en i } else { dp[i][1] = max(dp[i][1], a[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...