Submission #1241755

#TimeUsernameProblemLanguageResultExecution timeMemory
1241755edga1Catfish Farm (IOI22_fish)C++20
9 / 100
17 ms5448 KiB
#include <bits/stdc++.h> #include "fish.h" #define ll long long using namespace std; struct fish{ int x; int y; int w; }; bool cmp(fish &a, fish &b){ if(a.y!=b.y) return a.y<b.y; return a.x>b.x; } ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){ vector<int> w(N); for(int i=0; i<M; i++){ w[X[i]]=W[i]; } vector<ll> a(N),b(N),b2(N); a[0]=b[0]=0; for(int i=1; i<N; i++){ a[i]=max({a[i-1],b[i-1],b2[i-1]+w[i-1]}); b[i]=a[i-1]+w[i]; b2[i]=b[i-1]; } //for(int i=0; i<N; i++) cout<<a[i]; return max(a[N-1],b[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...