제출 #629075

#제출 시각아이디문제언어결과실행 시간메모리
629075Justin1메기 농장 (IOI22_fish)C++17
0 / 100
23 ms4180 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll dp[100005][2], ar[100005]; //0 = dont choose, 1 = choose long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { for (int i = 0; i < N; i++) ar[X[i]] = W[i]; dp[0][1] = ar[0]; for (int i = 1; i < N; i++) { dp[i][0] = max(dp[i-1][0], dp[i-1][1]); dp[i][1] = dp[i-1][0] + W[i]; } 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...