Submission #724106

#	Time	Username	Problem	Language	Result	Execution time	Memory
724106		vjudge1	Catfish Farm (IOI22_fish)	C++17	12 / 100	112 ms	25716 KiB

fish

#include<bits/stdc++.h>
#define ll long long 
#define ld long double
#define db double
#define ull unsigned long long
#define pb push_back
#define inf 1000000000000000000
#define linf 1000000000
#define mpr make_pair
#define in insert
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
//author :: E.Mustafayev 
using namespace std;


const int Max= 100000;

vector<vector<vector<ll>>> dp(Max,vector<vector<ll>>(2,vector<ll>(2)));
vector<int>v(Max);
int N;

ll solve(int col, bool a, bool b) {
  if (col==N) {
    return 0;
  }
ll &res=dp[col][a][b];
  if (res!=-1) {
    return res;
  }


  res=solve(col+1,b,false);

ll x=0;
  if (col>0&& b){
  x-=v[col];
  } 
  if (col>0&&!a&&!b){
   x+=v[col-1];
}
  if (col+1<N){
  x+=v[col+1];
 }
  res=max(res,x+solve(col+1,b,true));

  return res;
}

ll max_weights(int n, int m, vector<int>x, vector<int>y, vector<int>w) {

for(int i=0;i<m;i++){

    v[x[i]]=w[i];
}
for(int i=0;i<Max;i++){
	for(int j=0;j<2;j++){
	for(int k=0;k<2;k++){
	dp[i][j][k]=-1;
	}
	}

}
bool a=true,b=true;
N=n;
ll ans=0;
for(int i=0;i<m;i++){
	if(x[i]%2){
	a=false;
	}
ans+=w[i];
}
if(a){
return ans;
}
ans=0;
for(int i=0;i<2;i++){
ll ans1=0;
for(int j=0;j<m;j++){
if(x[j]>1){
b=false;
}
ans1+=w[j];
}
ans=max(ans,ans1);
}
if(b){
return ans;
}


ll res=solve(0,false,false);
  return res;
}

// void solve(){
//int n,m;
//cin>>n>>m;
//vector<int>x(m),y(m),w(m);
//for(int i=0;i<m;i++){
//	cin>>x[i]>>y[i]>>w[i];
//	
//}
//cout<<max_weights(n,m,x,y,w);
//
//
//}
//int main(){
//	ios_base::sync_with_stdio(false);
//
//solve();
//
//}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16