Submission #720538

#TimeUsernameProblemLanguageResultExecution timeMemory
720538lamCatfish Farm (IOI22_fish)C++17
0 / 100
104 ms11188 KiB
#include "fish.h" #include <vector> #define ll long long #include <bits/stdc++.h> using namespace std; typedef pair<int,int> ii; #define ff first #define ss second const int maxn = 3e5 + 10; int n,m; ii a[maxn]; int w[maxn]; ll sub2(vector <int> X, vector <int> Y, vector <int> W) { ll ans=0; ll sum=0; for (int i=0; i<m; i++) if (X[i]==0) sum+=W[i]; ans=sum; sum=0; for (int i=0; i<m; i++) if (X[i]==1) sum+=W[i]; ans=max(ans,sum); return ans; } long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { n=N; m=M; return sub2(X,Y,W);; }
#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...