제출 #684871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
684871		Konti2	메기 농장 (IOI22_fish)	C++17	14 / 100	71 ms	29712 KiB

fish

#include <bits/stdc++.h>
#include "fish.h"

using namespace std;

using ll = long long;

ll t[301][301];
ll dp[301][301][301];
ll sum[301][301];

ll max_weights(int N, int M, vector<int> x, vector<int> y, vector<int> w){
	  ll ans = 0;
	  for (int i = 0; i < M; i++){
		  t[x[i]][y[i]] = w[i];
	  }
	  for (int i = 0; i < N; i++){
		  for (int h = 1; h <= 9; h++){
			  sum[i][h] = t[i][h-1] + sum[i][h-1];
		  }
		  if (!i) continue;
		  for (int a = 0; a <= 9; a++){
			  for (int b = 0; b <= 9; b++){
				  for (int c = 0; c <= 9; c++){
					  ll tmp = dp[i-1][b][c];
					  if (b > a){
						  tmp += (sum[i][b] - sum[i][a]);
					  }
					  if (a > c && a > b){
						   tmp += (sum[i-1][a] - sum[i-1][max(b,c)]);
					  }
					//  cout << i << " " << a << " " << b << " " << c << " " << tmp << "\n";
					  dp[i][a][b] = max(dp[i][a][b], tmp);
					  ans = max(ans, dp[i][a][b]);
				  }
			  }
		  }	
	  }
						  
	  
	  return ans;
  }
	
	
/*int main(){
	int n;
	cin >> n;
	int m;
	cin >> m;
	vector<int> x(m);
	vector<int> y(m);
	vector<int> w(m);
	for (int i = 0; i < m; i++){
		cin >> x[i];
		cin >> y[i];
		cin >> w[i];
	}
	cout << max_weights(n, m, x, y, w);
	return 0;
}
		  

*/ 

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