Submission #627351

#TimeUsernameProblemLanguageResultExecution timeMemory
627351ValenzCatfish Farm (IOI22_fish)C++17
0 / 100
1129 ms2097152 KiB
#include <cassert>
#include <cstdio>
 
#include <vector>
 
long long max_weights(int N, int M,std::vector<int> X,std::vector<int> Y,std::vector<int> W)
{
    std::vector<std::vector<int>> pond(N,std::vector<int>(N,0));
    for(int i=0;i<M;i++)
    {
        pond[X[i]][Y[i]]=W[i];
    }
    long long ans=0;
    for(int i=0;i<M;i++)
    {
        ans+=W[i];
    }
    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...