Submission #1043165

#TimeUsernameProblemLanguageResultExecution timeMemory
1043165ezzzayCatfish Farm (IOI22_fish)C++17
0 / 100
47 ms23124 KiB
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#include <vector>
#define ll long long
const int MN=1e6;
ll ps[MN][2];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    ll ans=0;
    for(int i=0;i<M;i++){
        ps[Y[i]][X[i]]+=W[i];
    }
   
    for(int i=1;i<MN-5;i++){
        ps[i][0]+=ps[i-1][0];
        ps[i][1]+=ps[i-1][1];
    }
    
    for(int i=0;i<=N;i++){
       
        ll k=ps[N+5][1]-ps[i][1]+ps[i][0];
        ans=max(ans,k);
    }
    
    ans=max(ans,ps[N+5][0]);
    if(N>2)ans=max(ans,ps[N+5][1]);
    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...