Submission #1070322

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070322		beaconmc	Catfish Farm (IOI22_fish)	C++17	35 / 100	1090 ms	9256 KiB

fish

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

const ll maxn = 305;


bool fish[maxn][maxn];
ll weights[maxn][maxn];


ll dp[maxn][maxn][2];



long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    FOR(i,0,maxn){
        FOR(j,0,maxn){
                fish[i][j] = false;
                dp[i][j][0] = 0;
                dp[i][j][1] = 0;
        }
    }

    FOR(i,0,M){
        Y[i]++;
        fish[X[i]][Y[i]] = true;
        weights[X[i]][Y[i]] = W[i];
    }

    FOR(i,2,N+1){
        FOR(j,0,N+1){
            FOR(k,0,2){
                ll temp = 0;
                ll add = 0;
                if (k==0){
                    FOR(p,j+1,N+1){
                        if (fish[i-1][p]) add += weights[i-1][p];
                        temp = max(temp, dp[i-1][p][0] + add);
                        temp = max(temp, dp[i-1][p][1] + add);
                    }
                }else{
                    FOR(p,0,j+1) if (fish[i-2][p]) add += weights[i-2][p];
                    FOR(p,0,j+1){
                        if (fish[i-2][p]) add -= weights[i-2][p];
                        temp = max(temp, dp[i-1][p][0]);
                        temp = max(temp, dp[i-1][p][1] + add);
                    }
                }
                dp[i][j][k] = temp;
            }
        }
    }


    ll ans = 0;
    FOR(i,0,N+1) FOR(j,0,N+1)FOR(k,0,2){
        if (dp[i][j][k]==305) cout << i << " " << j << " " << k << endl;
        ans = max(ans, dp[i][j][k]);
    }
    return ans;







}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 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