# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627013 | jhhope1 | Catfish Farm (IOI22_fish) | C++17 | 157 ms | 26440 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"
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<pii, ll> tri;
const int MAXN = 100010;
const ll INF = 1e18;
vector<pii> HW[MAXN];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
vector<tri> P;
for(int i=0 ; i<M ; i++){
P.emplace_back(pii(X[i], Y[i]), W[i]);
}
sort(P.begin(), P.end());
for(int i=0 ; i<M ; i++){
HW[P[i].first.first].emplace_back(P[i].first.second, P[i].second);
}
vector<ll> U(HW[0].size(), 0), D(HW[0].size(), 0);
ll T = 0, S = 0;
for(int j=0 ; j<HW[0].size() ; j++){
S += HW[0][j].second;
D[j] = S;
}
for(int i=1 ; i<N ; i++){
vector<ll> new_U(HW[i].size(), 0), new_D(HW[i].size(), 0);
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... |