Submission #1234695

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234695		Muhammad_Aneeq	Catfish Farm (IOI22_fish)	C++17	0 / 100	12 ms	2880 KiB

fish

#include "fish.h"
#include <vector>
#include <iostream>
using namespace std;
int const N=1e5+10;
long long dp[N][2],pre[N][2]={};
// 0 if we are updating it from behind 1 if being updated from
long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) 
{
    for (int i=0;i<M;i++)
        pre[X[i]][Y[i]+1]=W[i];
    for (int i=0;i<2;i++)
        for (int j=1;j<=N;j++)
            pre[i][j]+=pre[i][j-1];
    if (N==2)
    {
        return max(pre[0][N],pre[1][N]);
    }
    long long ans=max(pre[0][N],pre[1][N]);
    for (int i=0;i<=N;i++)
    {
        ans=max(ans,pre[0][i]+pre[1][N]-pre[1][i]);
    }
    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