# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
859465 |
2023-10-10T07:58:07 Z |
kim |
Catfish Farm (IOI22_fish) |
C++17 |
|
0 ms |
0 KB |
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
struct A{
int x,y,w;
A(int x_,int y_,int w_):x(x_),y(y_),w(w_){}
static bool cmpX(const A&l,const A&r){
if(l.x==r.x) return l.y<r.y;
return l.x<r.x;
}
static bool cmpY(const A&l,const A&r){
if(l.y==r.y) return l.x<r.x;
return l.y<r.y;
}
};
vector<A> fish;
int dp[100005][3];
int n,m;
vector<pii> fx[100005],fy[100005];
ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W) {
n=N;
m=M;
int sum=0;
for(int i=0;i<M;++i){
fish.emplace_back(X[i],Y[i],W[i]);
if(Y[1]==1) sum+=W[i];
fx[X[i]].emplace_back(Y[i],W[i]);
fy[Y[i]].emplace_back(X[i],W[i]);
if(X[i]==0) dp[0][1]=W[i];
}
sort(fish.begin(),fish.end(),A::cmpY);
for(int i=1;i<N;++i){
dp[i][0]=max({dp[i-1][0],dp[i-1][1],dp[i-1][2]});
if(fx[i].size()){
dp[i][1]=dp[i-1][0]+fx[i][0].s;
if(i>1) dp[i][2]=dp[i-1][1]+fx[i][0].s;
else dp[i][2]=0;
}
else dp[i][1]=dp[i][2]=0;
}
return max(dp[N-1][1],dp[N-1][0]);
return 0;
}
Compilation message
/usr/bin/ld: /tmp/ccV7ZjFN.o: in function `main':
grader.cpp:(.text.startup+0x25e): undefined reference to `max_weights(int, int, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status