# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626663 | ITO | Catfish Farm (IOI22_fish) | C++17 | 166 ms | 22260 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
vector<vector<pair<int, ll>>> v(N, vector<pair<int, ll>>(0));
vector<ll> ru[2], rd[2];
int p0 = 1, p1 = 0;
ll co = 0;
for (int i = 0; i < M; i++) {
v[X[i]].push_back({Y[i], W[i]});
}
for (int i = 0; i < N; i++) {
v[i].push_back({0, 0});
v[i].push_back({N, 0});
sort(v[i].begin(), v[i].end());
for (int j = 1; j < v[i].size(); j++) v[i][j].second += v[i][j - 1].second;
}
for (int j = 0; j < v[0].size(); j++) {
ru[0].push_back(0);
rd[0].push_back(0);
}
for (int i = 1; i < N; i++) {
ru[p0].clear();
rd[p0].clear();
int j, k = 1;
ll te = ru[p1][0];
Compilation message (stderr)
# | 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... |