Submission #633047

#TimeUsernameProblemLanguageResultExecution timeMemory
633047Lynkcat_Catfish Farm (IOI22_fish)C++17
3 / 100
100 ms8452 KiB
#include "fish.h"
#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
// #define int ll
// #define N 
using namespace std;
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W)
{
	vector<ll>f(N,0);
	for (int i=0;i<M;i++)
	{
		f[X[i]]+=W[i];
	}
	ll mx=0;
	ll ans=0;
	for (int i=0;i<N;i++)
	{
		if (i-2>=0) mx=max(mx,f[i-2]);
		f[i]+=mx;
		ans=max(ans,f[i]);
	}
	return ans;
}
	
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...