Submission #1055631

#	Time	Username	Problem	Language	Result	Execution time	Memory
1055631		vjudge1	Catfish Farm (IOI22_fish)	C++17	0 / 100	28 ms	8256 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll fishies[3002][3002];
ll dp[3002][2][3002];
inline ll ones(int col,int len){
    return fishies[col][len];
}
ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W) {
    for(int i=0;i<M;i++)
        fishies[X[i]+1][Y[i]+1]=W[i];
    for(int i=1;i<=2;i++)
        for(int j=1;j<=N+1;j++)
            fishies[i][j]+=fishies[i][j-1];
    if(N==2) return max(ones(1,N),ones(2,N));
    ll K=ones(2,N),bst=0;
    for(int i=1;i<=N;i++)
        bst=max(bst,ones(1,i)-ones(2,i));
    return K+bst;
}

• 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