# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079705 | ArthuroWich | Catfish Farm (IOI22_fish) | C++17 | 239 ms | 38632 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;
#define int long long int
vector<vector<int>> ind;
vector<vector<pair<int, int>>> pref;
int query(int i, int j) {
pair<int, int> c = {j, INT64_MAX};
auto ind = upper_bound(pref[i].begin(), pref[i].end(), c);
ind--;
c = *ind;
return c.second;
}
int max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
int n = N, m = M;
pref.resize(n+5, vector<pair<int, int>>(1, {INT64_MIN, 0}));
ind.resize(n+5);
for (int i = 0; i < m; i++) {
pref[X[i]+1].push_back({Y[i], W[i]});
}
for (int i = 0; i <= n; i++) {
sort(pref[i].begin(), pref[i].end());
}
for (int i = 0; i <= n; i++) {
for (int j = 1; j < pref[i].size(); j++) {
pref[i][j].second += pref[i][j-1].second;
}
}
ind[0].push_back(-1);
ind[n+1].push_back(-1);
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... |