# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837714 | Baytoro | Catfish Farm (IOI22_fish) | C++17 | 69 ms | 9924 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>
//#include "grader.cpp"
using namespace std;
#define ll long long
#define sc second
#define fr first
#define pb push_back
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
bool sb1=1,sb2=1,sb3=1;
for(int i=0;i<m;i++){
sb1&=(x[i]%2==0);
sb2&=(x[i]<=1);
sb3&=(y[i]==0);
}
if(sb1){
ll sum=0;
for(int i=0;i<m;i++) sum+=w[i];
return sum;
}
if(sb2){
vector<ll> a(n),b(n);
ll A=0,B=0;
for(int i=0;i<m;i++){
if(x[i]==0){
A+=w[i];
a[y[i]]=w[i];
}
else{
B+=w[i];
b[y[i]]=w[i];
}
}
if(n==2) return max(A,B);
ll x=0,y=B;
for(int i=0;i<n;i++){
x+=a[i];
y-=b[i];
B=max(B,x+y);
}
return B;
}
if(sb3){
}
}
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... |