Submission #724321

#TimeUsernameProblemLanguageResultExecution timeMemory
724321nihaddhuseynliCatfish Farm (IOI22_fish)C++17
0 / 100
24 ms6824 KiB
#include "fish.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef long long int ll;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    ll ans =0;
        ans=0;
        ll b[300005][2];
        memset(b,0,sizeof(b));
        for(int i =0;i<M;i++)
        {
            b[Y[i]][X[i]]+=W[i];
        }
        for(int i =1;i<N-1;i++)
        {
            b[i][0]+=b[i-1][0];
            b[i][1]+=b[i-1][1];
        }
        ans=max(b[N-1][0],b[N-1][1]);
        if(N==2)
        {
            return ans;
        }   
        for(int i =0;i<N;i++)
        {
            ll cnt=b[N-1][1]-b[i][1];
            ans=max(ans,cnt+b[i][0]);
        }
        return ans;
    

}
#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...