Submission #1075718

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075718		Sir_Ahmed_Imran	Catfish Farm (IOI22_fish)	C++17	44 / 100	75 ms	17564 KiB

fish

                            ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
int n,m;
vector<int> x,y,w;
ll dps(){
    ll hs[n+1][n+1];
    ll dp[n+1][n+1];
    ll dp2[n+1][n+1];
    for(int i=0;i<=n;i++)
        for(int j=0;j<=n;j++)
            hs[i][j]=dp[i][j]=dp2[i][j]=0;
    for(int i=1;i<=n;i++)
        dp[0][i]=dp2[0][i]=-1e17;
    for(int i=0;i<m;i++)
        hs[x[i]+1][y[i]+1]+=w[i];
    for(int i=1;i<=n;i++)
        for(int j=0;j<n;j++)
            hs[i][j+1]+=hs[i][j];
    for(int i=1;i<=n;i++){
        for(int j=0;j<=n;j++){
            for(int k=0;k<=n;k++){
                if(j<k){
                    dp[i][j]=max(dp[i][j],dp[i-1][k]+hs[i][k]-hs[i][j]);
                    dp2[i][k]=max(dp2[i][k],dp[i-1][k]+hs[i][k]-hs[i][j]);
                }
                else{
                    dp[i][j]=max(dp[i][j],dp2[i-1][k]+hs[i-1][j]-hs[i-1][k]);
                    dp2[i][j]=max(dp2[i][j],dp2[i-1][k]+hs[i-1][j]-hs[i-1][k]);
                }
            }
            dp2[i][j]=max(dp2[i][j],dp[i-1][j]+hs[i][j]);
        }
    }
    ll ans=0;
    for(int i=0;i<=n;i++)
        ans=max(ans,max(dp[n][i],dp2[n][i]));
    return ans;
}
ll xs(){
    ll hs[3][n+1];
    for(int i=0;i<3;i++)
        for(int j=0;j<=n;j++)
            hs[i][j]=0;
    for(int i=0;i<m;i++)
        hs[x[i]+1][y[i]+1]+=w[i];
    for(int i=1;i<3;i++)
        for(int j=0;j<n;j++)
            hs[i][j+1]+=hs[i][j];
    ll ans=0;
    for(int i=0;i<=n;i++)
        ans=max(ans,hs[1][i]+hs[2][n]-hs[2][i]);
    return ans;
}
ll ys(){
    ll a[n+1];
    ll dp[n+1];
    for(int i=0;i<=n;i++) 
        a[i]=dp[i]=0;
    for(int i=0;i<m;i++)
        a[x[i]+1]=w[i];
    dp[2]=max(a[1],a[2]);
    for(int i=3;i<=n;i++)
        dp[i]=max(dp[i-1],max(a[i-1]+dp[i-2],a[i]+a[i-2]+dp[i-3]));
    return dp[n];
}
ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W){
    n=N;m=M;x=X;y=Y;w=W;
    if(n<301) return dps();
    int mx,my;
    ll o=0;
    for(int i=mx=my=0;i<m;i++){
        mx=max(mx,x[i]);
        my=max(my,y[i]);
        o+=w[i];
    }
    if(mx<2) return xs();
    if(!my) return ys();
    return o;
}

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