Submission #925242

#	Time	Username	Problem	Language	Result	Execution time	Memory
925242		IS_Rushdi	Catfish Farm (IOI22_fish)	C++17	23 / 100	544 ms	103372 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;


long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
    long long dp[n+1][11][11]{};
    int sum[n+1][11]{};
    for(int i = 0; i < m; i++) x[i] += 1;
    for(int i = 0; i < m; i++) y[i] += 1;
    for(int i = 0; i < m; i++) sum[x[i]][y[i]] += w[i];
    long long ans = 0;
    
    for(int i = 0; i < 1; i++){
        for(int j = 0; j < 11; j++){
            for(int k = 0; k < 11; k++){
                dp[i][j][k] = -1e18;
            }
        }
    }
    dp[0][0][0] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < 11; j++){
            for(int k = 0; k < 11; k++){
                for(int v = 0; v < 11; v++){
                    long long now = dp[i-1][k][j];
                    int cur = v;
                    while(cur > max(j,k)) now += sum[i-1][cur--];
                    cur = k;
                    while(cur > v) now += sum[i][cur--];
                    
                    dp[i][v][k] = max(dp[i][v][k],now);
                    ans = max(ans,now);
                }
            }
        }
    }
    
    return ans;
}

// int main(){
//     cout << max_weights(5, 4, {0, 1, 4, 3}, {2, 1, 4, 3}, {5, 2, 1, 3}) << '\n';
// }

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