# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628300 | 600Mihnea | Catfish Farm (IOI22_fish) | C++17 | 1080 ms | 95184 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;
void maxup(ll &a, ll b) {
a = max(a, b);
}
long long max_weights(int n, int cnt_fish, std::vector<int> XX, std::vector<int> YY, std::vector<int> WW) {
const ll inf = (ll) 1e18 + 7;
n += 7;
vector<set<int>> interestingSet(n);
vector<vector<int>> interesting(n);
vector<vector<vector<ll>>> dp(2, vector<vector<ll>> (n));
vector<vector<ll>> both(n);
vector<ll> dp_zero(n, 0LL);
vector<vector<pair<int, ll>>> pe(n);
assert((int) XX.size() == cnt_fish);
assert((int) YY.size() == cnt_fish);
assert((int) WW.size() == cnt_fish);
for (int i = 0; i < cnt_fish; i++) {
int x = XX[i] + 5, y = YY[i] + 1, w = WW[i];
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... |