Submission #1053733

#TimeUsernameProblemLanguageResultExecution timeMemory
1053733jer033메기 농장 (IOI22_fish)C++17
0 / 100
12 ms3676 KiB
#include "fish.h" #include <bits/stdc++.h> #include <vector> using ll = long long; using namespace std; long long max_weights_st1(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { long long y = 0; for (int i=0; i<M; i++) { long long x = W[i]; y+=x; } return y; } long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vector<long long> fish(N, 0); //we can consider empty cells to have catfish worth 0 for (int i=0; i<M; i++) fish[X[i]] = W[i]; vector<ll> dp(N, 0); dp[0] = fish[0]; dp[1] = fish[1]; for (int i=2; i<N; i++) dp[i] = max(dp[i-2]+fish[i], dp[i-1]); 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...