Submission #1240092

#TimeUsernameProblemLanguageResultExecution timeMemory
1240092vtnooCatfish Farm (IOI22_fish)C++20
0 / 100
1004 ms2162688 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W){ if(N==1)return 0; if(N==2){ vector<vector<pair<int,int>>> x(2); for(int i=0;i<M;i++){ x[X[i]].push_back(make_pair(Y[i], W[i])); } ll sum[2]; for(int i=0;i<2;i++){ for(auto v:x[i]){ sum[i]+=v.second; } } return max(sum[0], sum[1]); } else{ ll x1=0; vector<vector<int>> g(N, vector<int>(N, 0)); for(int i=0;i<M;i++){ g[X[i]][Y[i]]=W[i]; if(X[i]==1)x1+=W[i]; } ll ans=x1, acc=0, cur=0; for(int i=0;i<N;i++){ acc+=g[1][i]; cur+=g[0][i]; ans=max(ans, (x1-acc)+cur); } return ans; } }
#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...