# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627037 | lunchbox | Catfish Farm (IOI22_fish) | C++17 | 502 ms | 49020 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll INF = 1e18;
ll max_weights(int n, int m, vi x, vi y, vi w) {
vector<vector<pair<int, ll>>> s(n + 1);
for (int i = 0; i < m; i++)
s[x[i] + 1].push_back({y[i] + 1, w[i]});
for (int i = 0; i <= n; i++) {
s[i].push_back({0, 0});
s[i].push_back({n + 1, 0});
sort(s[i].begin(), s[i].end());
ll x = 0;
for (auto &[j, w] : s[i]) {
x += w;
w = x;
}
}
vector<vi> p(n + 1);
auto pos = [&](int i, int k) {
return lower_bound(p[i].begin(), p[i].end(), k) - p[i].begin();
};
auto sum = [&](int i, int k) {
return s[i][upper_bound(s[i].begin(), s[i].end(), make_pair(k, (ll) 0)) - s[i].begin() - 1].second;
};
vector<vector<array<ll, 2>>> f(n + 1);
# | 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... |