# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642207 | 2022-09-18T22:12:27 Z | tigar | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KB |
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll max_weights(int N, int M, int* X, int* Y, int* W) { bool subtask1=true, subtask2=true/*, subtask3=true*/; for(int i=0; i<M; i++) { if(X[i]%2!=0)subtask1=false; if(X[i]>1)subtask2=false; //if(Y[i]!=0)subtask3=false; } if(subtask1) { ll rez=0; for(int i=0; i<M; i++)rez+=W[i]; return rez; } if(subtask2) { ll s1=0, s0=0, m[N][2]; for(int i=0; i<M; i++) { if(X[i]==0)s0+=W[i]; else s1+=W[i]; m[Y[i]][X[i]]=W[i]; } for(int i=0; i<N; i++) { m[i][0]=m[max(i-1, 0)][0]+m[i][0]; m[i][1]=m[max(i-1, 0)][1]+m[i][1]; } if(N==2)return max(m[N-1][0], m[N-1][1]); ll rez=0; for(int i=0; i<N; i++) { rez=max(rez, m[i][0]+m[N-1][1]-m[i][0]); } return rez; } return 0; }