Submission #845813

#	Time	Username	Problem	Language	Result	Execution time	Memory
845813		Marco_Escandon	메기 농장 (IOI22_fish)	C++17	6 / 100	91 ms	14804 KiB

fish

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cad[3][1000000]= { };
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W)
{
    for(int i=0; i<M; i++)
    {
        cad[X[i]][Y[i]+1]+=W[i];
    }
    for(int i=1; i<=N; i++)
    {
        cad[0][i]+=cad[0][i-1];
    }
    for(int i=N+2; i>1; i--)
    {
        cad[1][i]+=cad[1][i+1];
    }
    ll bs=0;
    for(int i=0; i<=N+3; i++)
    {
        bs=max(bs,cad[0][i]+cad[1][i+1]);
    }
    ll c1=0,c2=0;
    for(int i=0; i<M; i++)
    {
        if(X[i]==0)c1+=W[i];
        else c2+=W[i];
    }
    bs=max(bs,max(c1,c2));
    if(N<=2)
    return max(c1,c2);
    return bs;
}

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