# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1240110 | vtnoo | Catfish Farm (IOI22_fish) | C++20 | 49 ms | 9796 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==2){
ll sum[2];
for(int i=0;i<M;i++){
if(X[i]==1)sum[1]+=W[i];
else sum[0]+=W[i];
}
return max(sum[0], sum[1]);
}
if(N>2){
ll x1=0;
vector<vector<ll>> g(2, vector<ll>(N, 0ll));
for(int i=0;i<M;i++){
g[X[i]][Y[i]]+=W[i];
if(X[i]==1)x1+=W[i];
}
ll ans=0, cur=0;
for(int i=0;i<N;i++){
x1-=(ll)g[1][i];
cur+=(ll)g[0][i];
ans=max(ans, x1+cur);
}
return ans;
}
}
Compilation message (stderr)
# | 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... |