| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1365754 | stanirina | Catfish Farm (IOI22_fish) | C++20 | 36 ms | 8796 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
long long sum1=0ll;
long long sum2=0ll;
for(int i=0;i<m;i++){
if(x[i]==0)sum1+=(long long)w[i];
if(x[i]==1)sum2+=(long long)w[i];
}
if(n==2)return max(sum1,sum2);
vector<long long> pr(n+2,0ll);
vector<long long> dr(n+2,0ll);
for(int i=0;i<m;i++){
if(x[i]==1)dr[y[i]+1]=(long long)w[i];
if(x[i]==0)pr[y[i]+1]=(long long)w[i];
}
long long ans=max(sum1,sum2);
for(int i=2;i<n+2;i++)pr[i]+=pr[i-1];
for(int i=n;i>=0;i--)dr[i]+=dr[i+1];
for(int i=1;i<=n;i++)ans=max(ans,pr[i]+dr[i+1]);
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
