# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632830 | Olympia | Catfish Farm (IOI22_fish) | C++17 | 843 ms | 2097152 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>
//#include <fish.h>
using namespace std;
int64_t max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
for (int i = 0; i < X.size(); i++) {
X[i]++;
}
int my = 0;
for (int y: Y) {
my = max(my, y);
}
my += 2;
vector<pair<int,int64_t> > vec[N + 10];
map<int,int64_t> s[N + 10];
for (int i = 0; i < X.size(); i++) {
vec[X[i]].push_back(make_pair(Y[i], W[i]));
s[X[i]][Y[i]] = W[i];
}
int64_t pref[N + 10][my + 2];
for (int i = 0; i <= N + 9; i++) {
pref[i][0] = 0;
for (int j = 1; j <= my + 1; j++) {
pref[i][j] = pref[i][j - 1];
if (s[i].count(j - 1)) pref[i][j] += s[i][j - 1];
}
}
int64_t dp[N + 1][my + 1][3];
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= my; j++) {
for (int d = 0; d < 3; d++) {
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... |