# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
661160 | mychecksedad | Catfish Farm (IOI22_fish) | C++17 | 306 ms | 57308 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 int ll;
#define pb push_back
const int N = 1e5 + 100;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
vector<ll> fishes[N];
vector<vector<int>> states(n + 1, {0});
for(int i = 0; i < m; ++i){
++y[i];
for(int k = max(0, x[i] - 1); k <= min(n - 1, x[i] + 1); ++k){
states[k].pb(y[i]);
}
}
for(int i = 0; i <= n; ++i){
sort(states[i].begin(), states[i].end());
states[i].erase(unique(states[i].begin(), states[i].end()), states[i].end());
fishes[i].resize(states[i].size());
}
for(int i = 0; i < m; ++i){
int j = x[i];
int Y = lower_bound(states[j].begin(), states[j].end(), y[i]) - states[j].begin();
fishes[j][Y] += w[i];
}
vector<vector<ll>> dp_up(n + 1), dp_down(n + 1);
for(int i = 0; i <= n; ++i){
int sz = states[i].size();
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... |