Submission #1245173

#TimeUsernameProblemLanguageResultExecution timeMemory
1245173DeathIsAweCatfish Farm (IOI22_fish)C++20
0 / 100
14 ms4416 KiB
#include "fish.h" #include <bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second using namespace std; int n, m; vector<int> x, y, w; ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { n = N; m = M; x = X; y = Y; w = W; vector<ll> row(n); for (int i=0;i<n;i++) { row[i] = 0; } for (int i=0;i<m;i++) { row[x[i]] = w[i]; } vector<ll> dp(n); dp[0] = 0; dp[1] = max(row[0], row[1]); if (n == 2) return dp[1]; dp[2] = max(row[1], row[0] + row[2]); for (int i=3;i<n;i++) { dp[i] = max(row[i - 1] + dp[i - 2], row[i] + row[i - 2] + dp[i - 3]); } return dp[n - 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...