# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1238908 | simplemind_31 | Catfish Farm (IOI22_fish) | C++20 | 50 ms | 7240 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mat[305][305],psum[305][305],dp[305][305],par,impar,dptask3[100002],vectask3[100002];
bool task1=true,task2=true,task3=true;
ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W){
for(int i=0;i<M;i++){
if(X[i]%2){
task1=false;
}
if(X[i]==0){
par+=W[i];
}else{
impar=W[i];
}
if(X[i]>1){
task2=false;
}
if(Y[i]!=0){
task3=false;
}
vectask3[X[i]+1]=W[i];
}
if(task1){
return par+impar;
}else if(task2){
return max(par,impar);
}else if(task3){
for(int i=1;i<=N;i++){
dptask3[i]=dptask3[i-1];
dptask3[i]=max(dptask3[i],dptask3[i-1]-vectask3[i]+vectask3[i+1]);
if(i>=2){
dptask3[i]=max(dptask3[i],dptask3[i-2]+vectask3[i+1]);
}
}
return dptask3[N];
}
}
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... |