Submission #1221831

#TimeUsernameProblemLanguageResultExecution timeMemory
1221831laurraCatfish Farm (IOI22_fish)C++20
0 / 100
92 ms7496 KiB
#include "fish.h"
#include <vector>

using namespace std;

#define dim 100005
long long s[2][dim];
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W)
{
    long long maxi,sum,i,j;
    maxi=sum=0;
    for(int i=0;i<M;i++)
        s[X[i]][Y[i]]+=W[i];
    for(i=1;i<N;i++)
    {
        s[0][i]+=s[0][i-1];
        s[1][i]+=s[1][i-1];
    }
    maxi=s[1][N-1];
    for(j=0;j<N;j++)
    {
        sum=s[1][N-1]-s[1][j]+s[0][j];
        maxi=max(maxi,sum);
    }
    return maxi;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...