제출 #1284199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284199		trandangquang	Catfish Farm (IOI22_fish)	C++20	0 / 100	26 ms	4112 KiB

fish

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

#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define _ << " " <<

template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}

const int MAX = 333;

ll dp[MAX][MAX][2],sum[MAX][MAX];

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    assert(N<=300);

    rep(i,M) sum[++X[i]][++Y[i]]=W[i];
    foru(i,1,N) foru(j,1,N) sum[i][j]+=sum[i][j-1];

    foru(i,0,N) dp[1][i][0]=0;

    foru(i,1,N) foru(j,0,N){
        foru(k,j,N){
            maxi(dp[i+1][k][0], dp[i][j][0] + (sum[i][k]-sum[i][j]));
            maxi(dp[i+1][k][0], dp[i][j][1]);
        }
        foru(k,0,j-1){
            maxi(dp[i+1][k][1], dp[i][j][0] + (sum[i+1][j]-sum[i+1][k]));
            maxi(dp[i+1][k][1], dp[i][j][1] + (sum[i+1][j]-sum[i+1][k]));
        }
        foru(k,0,N){
            maxi(dp[i+2][k][0], max(dp[i][j][0],dp[i][j][1]) + sum[i+1][N]);
        }
    }

    ll res=0;
    foru(i,0,N) foru(j,0,1) maxi(res, dp[N][i][j]);
    return res;
}

//int main(){
//    cout<<max_weights(5,4,{0,1,4,3},{2,1,4,3},{5,2,1,3});
//}

• 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