Submission #1169822

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169822		thelegendary08	Catfish Farm (IOI22_fish)	C++17	0 / 100	952 ms	2162688 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pb push_back
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<'\n';

using namespace std;
vector<vector<int>>s;
int sum(int col, int l, int r){
	if(l > r)return 0;
	if(l == 0)return s[col][r];
	else return s[col][r] - s[col][l-1];
}
int max_weights(signed n, signed m, std::vector<signed> x, std::vector<signed> y,
                      std::vector<signed> w) {
	int ans = 0;
	vector<vi>grid(n, vi(n));
	f0r(i,m){
		grid[x[i]][y[i]] = w[i];
	}
	vector<vi>s(n, vi(n));
	f0r(i, n){
		s[i][0] = grid[i][0];
		FOR(j, 1, n)s[i][j] = s[i][j-1] + grid[i][j];
	}
	::s = s;
	
	
	// vout(v);
	vector<vector<vi>> dp(n, vector<vi>(9, vi(9)));
	f0r(i, 9){
		f0r(j, 9){
			dp[1][i][j] = sum(0, i, j-1);
		}
	}
	FOR(i, 2, n){
		f0r(j, 9){
			f0r(k, 9){
				f0r(l, 9){
					if(k < j)dp[i][j][k] = max(dp[i][j][k], dp[i-1][l][j] + sum(i, k, j-1));
					else dp[i][j][k] = max(dp[i][j][k], dp[i-1][l][j] + sum(i-1, max(l,j), k-1));
				}
			}
		}
	}
	f0r(i, 9)f0r(j,9)ans = max(ans, dp[n-1][i][j]);
	return ans;
}

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