Submission #1369247

#TimeUsernameProblemLanguageResultExecution timeMemory
1369247leolin0214Catfish Farm (IOI22_fish)C++20
0 / 100
35 ms7260 KiB
#include "fish.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <array>

using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    
    long long a[2] = {0, 0};
    for (int i=0; i<M; i++) {
        a[X[i]] += W[i];
    }

    return max(a[0], a[1]);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...