Submission #1234806

#TimeUsernameProblemLanguageResultExecution timeMemory
1234806marizaCatfish Farm (IOI22_fish)C++20
3 / 100
51 ms8804 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N=1e5; #define MID ((l+r)/2) long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){ ll a[n]={}; for(ll i=0; i<m; i++){ a[x[i]]+=w[i]; } ll ans[n+2]; ans[n]=0; ans[n+1]=0; for(ll i=n-1; i>=0; i--){ ans[i]=max(ans[i+1],a[i]+ans[i+2]); } return ans[0]; }
#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...