# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1240158 | vtnoo | Catfish Farm (IOI22_fish) | C++20 | 15 ms | 2880 KiB |
#pragma once
#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){
vector<ll> s(N, 0);
for(int i=0;i<M;i++){
s[X[i]]=W[i];
}
ll ans=0;
for(int i=0;i<N;i++){
if(s[i]==0)continue;
vector<ll> comp;
int j=i;
while(j<N&&s[j]!=0){
comp.push_back(s[j]);
j++;
}
ll par=0, imp=0;
for(int i0=0;i0<(int)comp.size();i0+=2){
imp+=s[i0];
}
for(int i0=1;i0<(int)comp.size();i0+=2){
par+=s[i0];
}
ans+=max(par, imp);
i=j;
}
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... |