| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1221433 | totoro | Catfish Farm (IOI22_fish) | C++20 | 15 ms | 2628 KiB |
#include <algorithm>
#include <map>
#include <numeric>
#include <vector>
#include "fish.h"
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
std::map<int, long long> sums;
long long ans = 0;
for (int i = 0; i < N; ++i) sums[X[i]] += W[i], ans = std::max(ans, sums[X[i]]);
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
