Submission #682532

#	Time	Username	Problem	Language	Result	Execution time	Memory
682532		sunwukong123	Catfish Farm (IOI22_fish)	C++17	0 / 100	1077 ms	4104 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 3005;
int dp[MAXN][MAXN][2]; // dp[i][h][has this node been added by the left?]
int V[MAXN][MAXN];
int ans;
long long max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W) {
    int height = 0;
    FOR(i,0,m-1){
        V[X[i]][Y[i]]=W[i];
        chmax(height, Y[i]);
    }
    FOR(i,0,n-1) {
        int lf = 0;
        FOR(h,0,height) {
            if(i)lf += V[i-1][h];
            //db3(i,h,dp[i][h]);
            if(i-1>=0) {
                FOR(y,0,h-1){ // left side smaller than i
                    int extra=0;
                    FOR(zz,y+1,h)extra+=V[i-1][zz];
                    chmax(dp[i][h][0], dp[i-1][y][0] + extra);
                    chmax(ans, dp[i][h][1]);
                }
                int cc=0;
                FOR(y,h+1,height) {
                    cc+=V[i][y];
                    chmax(dp[i][h][1], max(dp[i-1][y][0], dp[i-1][y][1]) + cc);
                    chmax(ans, dp[i][h][1]);
                }
            }
            //db3(i,h,dp[i][h]);
            if(i-2>=0) {
                FOR(y,0,height) {
                    int cc = 0;
                    int higher=max(height, h);
                    FOR(zz,1,higher) {
                        if(V[i-1][zz]) {
                            cc+=V[i-1][zz];
                        }
                    }
                    chmax(dp[i][h][0], max(dp[i-2][y][0], dp[i-2][y][1]) + cc);
                    chmax(ans, dp[i][h][0]);
                }
            }
            //db3(i,h,dp[i][h]);
            if(i-3>=0) {
                int cc = 0;
                FOR(y,0,h){
                    cc+=V[i-2][y];
                    chmax(dp[i][h][0], max(dp[i-3][y][0], dp[i-3][y][1]) + cc + lf);
                    chmax(ans, dp[i][h][0]);
                }
            }
        }
    }
    return ans;
}

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