# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625842 | ETK | Catfish Farm (IOI22_fish) | C++17 | 130 ms | 15392 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"
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define sz(x) int(x.size())
#define ll long long
using namespace std;
const int N = 2e5 + 5;
#define inf 2e18
ll max_weights(int n,int m,vi X,vi Y,vi W){
vector <vector<pii>> vec(n);
rep(i,0,m)vec[X[i]].pb({Y[i],W[i]});
vector <ll> f,g,lstf,lstg,Mx(n,-inf);
rep(x,0,n){
sort(ALL(vec[x]));
int m = sz(vec[x]);
swap(f,lstf),swap(g,lstg);
f = g = vector <ll> (m,-inf);
int j = sz(lstf) - 1;
ll mxlst = -inf,mxcur = -inf;
if(x){
per(i,m - 1,0){
int y = vec[x][i].fi,w = vec[x][i].se;
f[i] = max(mxcur,0ll) + w;
# | 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... |