# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833546 | Trumling | Catfish Farm (IOI22_fish) | C++17 | 124 ms | 15672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W)
{
ll sum1=0,sum2=0;
vector<pair<ll,ll>>z,o;
for(int i=0;i<M;i++)
{
if(X[i])
{
sum1+=W[i];
o.pb({Y[i],W[i]});
}
else
{
sum2+=W[i];
z.pb({Y[i],W[i]});
}
}
sort(all(z));
sort(all(o));
if(N==2)
return max(sum1,sum2);
ll maxi=max(sum1,sum2);
ll idx=0,l=0,r=0;
for(int i=0;i<z.size();i++)
{
l+=z[i].S;
while(idx!=o.size() && o[idx].F<=z[i].F)
{
r+=o[idx].S;
idx++;
}
maxi=max(maxi,l+sum1-r);
}
return maxi;
}
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... |