| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335908 | yc11 | 메기 농장 (IOI22_fish) | C++20 | 13 ms | 3660 KiB |
#include<bits/stdc++.h>
using namespace std;
int64_t max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
vector<int64_t> dp;
dp.assign(N,0);
vector<int64_t> n1;
n1.resize(N);
for (int i = 0 ;i<M;i++){
n1[X[i]] = W[i];
}
for (int i = 0;i<N;i++){
if (i==0) dp[0] = n1[0];
else if (i==1) dp[1] = max(n1[1],n1[0]);
else dp[i] = max(dp[i-1],dp[i-2]+n1[i]);
}
return dp[N-1];
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
