| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1181425 | Kavelmydex | 메기 농장 (IOI22_fish) | C++20 | 15 ms | 4936 KiB |
/*
5 4
0 0 4
1 0 2
2 0 3
4 0 5
*/
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define sp ' '
const int N=3e5+10;
void cmx(ll &a,ll b){a=max(a,b);}
ll ans[N][2],wei[N];
ll max_weights(int N, int M, vi X, vi Y,vi W) {
for(int i=0;i<M;++i){
wei[X[i]]=W[i];
}
for(int i=1;i<N;++i){
if(i==1){
ans[i][1]=wei[0];
ans[i][0]=wei[1];
}else{
ans[i][1]=max(wei[i-1]+ans[i-2][0],ans[i-1][0]);
cmx(ans[i][1],ans[i-1][1]);
ans[i][0]=max(wei[i]+ans[i-1][1],ans[i-1][0]);
}
}
// for(int i=1;i<N;++i)cout<<ans[i][0]<<sp<<ans[i][1]<<endl;
return max(ans[N-1][0],ans[N-1][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... | ||||
