Submission #1305481

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305481		vtnoo	Catfish Farm (IOI22_fish)	C++20	9 / 100	20 ms	9012 KiB

fish

#pragma once
 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
 
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W){
	vector<ll> s(N, 0ll);
	for(int i=0;i<M;i++){
		s[X[i]]=W[i];
	}
	vector<vector<ll>> dp(N, vector<ll>(2, 0));
	// dp[i][j] = {casilla, existe pared?}
	for(int i=1;i<N;i++){
		//~ cout<<"==========================="<<endl;
		//~ cout<<i<<endl;
		dp[i][0]=dp[i-1][0];
		dp[i][0]=max(dp[i-1][1]+s[i], dp[i][0]);
		if(i==1){
			dp[i][1]=dp[i-1][1];
			dp[i][1]=max(dp[i][1], dp[i-1][0]+s[i-1]);
		}else{
			dp[i][1]=dp[i-1][1];
			dp[i][1]=max({dp[i][1], dp[i-2][0]+s[i-1], dp[i-1][0]});
		}
		//~ cout<<dp[i][0]<<" "<<dp[i][1]<<endl;
	}
	return max(dp[N-1][0], dp[N-1][1]);
}

Compilation message (stderr)

fish.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16