# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626202 | mraron | Catfish Farm (IOI22_fish) | C++17 | 231 ms | 19840 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 <vector>
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long ;
#define sz(x) (int)(x).size()
#define xx first
#define yy second
//dp0[i][j] -> i. oszlopban j-ig elé építve piert max hogyha mindkettő szomszédosnál magasabb
//dp1[i][j] -> i. oszlopban j-ig elé építve piert max hogyha bal oldali számít
//dp2[i][j] -> i. oszlopban j-ig elé építve piert max hogyha jobb oldali számít
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
std::vector<int> W) {
vector<vector<pair<int,ll>>> lst(N+2, vector<pair<int,ll>>());
for(int i=0;i<M;++i) {
lst[X[i]].push_back({Y[i], W[i]});
}
for(int i=0;i<=N+1;++i) lst[i].push_back({N+10,0});
for(auto& i:lst) sort(i.begin(), i.end());
for(auto& i:lst)
for(int j=1;j<sz(i);++j) i[j].yy+=i[j-1].yy;
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... |