Submission #1031964

#TimeUsernameProblemLanguageResultExecution timeMemory
1031964Mr_HusanboyCatfish Farm (IOI22_fish)C++17
9 / 100
17 ms6572 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define all(a) (a).begin(), (a).end() #define ll long long template<typename T> int len(T &a){ return a.size(); } mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w) { vector<ll> s(n); for(int i = 0; i < m; i++) s[x[i]] = w[i]; vector<array<ll, 2>> dp(n); ll ans = 0; for(int i = 1; i < n; i ++){ dp[i][0] = max(dp[i - 1][1] + s[i], dp[i - 1][0]); dp[i][1] = max(dp[i - 1][0], dp[i - 1][1]); dp[i][1] = max(dp[i][1], (i - 2 >= 0 ? max(dp[i - 2][1], dp[i - 2][0]) : 0) + s[i - 1]); ans = max({ans, dp[i][1], dp[i][0]}); //cout << dp[i][0] << ' ' << dp[i][1] << endl; } 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...