Submission #628638

#	Time	Username	Problem	Language	Result	Execution time	Memory
628638		MateGiorbelidze	Catfish Farm (IOI22_fish)	C++17	52 / 100	530 ms	218864 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
 
ll a[3001][3001] , b[3001][3001] , d[3001][3001];
int n , m;
 
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    n = N; m = M;
    
    for (int i = 0; i < m; i++) {
    	d[Y[i] + 1][X[i] + 1] = W[i];
	}
	
	for (int j = 1; j <= n; j++) {
		
		if (j != n) {
			
			a[1][j] = b[1][j - 1] + d[1][j];
				
			for (int i = 2; i <= n; i++) {
				
				a[i][j] = max(a[i - 1][j] , a[i - 1][j - 1]) + d[i][j];
				
			}
			
		}
		
		if (j == 1) continue;
		
		b[n][j] = max(a[n][j - 2] , b[1][j - 2]) + d[n][j];
		
		for (int i = n - 1; i > 0; i--) {
			
			b[i][j] = max(b[i + 1][j] , b[i + 1][j - 1]) + d[i][j];
			
		}
		
	}
	
	ll ans = max(a[n][n - 1] , b[1][n]);
	
	return ans;
                      	
}

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