Submission #1037233

#TimeUsernameProblemLanguageResultExecution timeMemory
1037233IssaCatfish Farm (IOI22_fish)C++17
35 / 100
1018 ms465748 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 3e3 + 100; const int maxl = 11; int n; ll dp[maxn][maxn][2]; ll a[maxn][maxn]; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){ n = N; for(int i = 0; i < M; i++){ X[i]++; Y[i]++; a[X[i]][Y[i]] += W[i]; } for(int i = 1; i <= n; i++){ for(int j = 1; j <= n; j++){ a[i][j] += a[i][j-1]; } } for(int i = 2; i <= n; i++){ for(int j = 0; j <= n; j++){ dp[i][j][0] = dp[i][j][1] = -1e18; } } for(int i = 1; i < n; i++){ for(int j = 0; j <= n; j++){ for(int k = 0; k <= n; k++){ if(k >= j) dp[i+1][k][1] = max(dp[i+1][k][1], dp[i][j][1] + a[i][k] - a[i][j]); if(k <= j) dp[i+1][k][0] = max(dp[i+1][k][0], max(dp[i][j][1], dp[i][j][0]) + a[i+1][j] - a[i+1][k]); if(i > 1){ dp[i+1][k][0] = max(dp[i+1][k][0], max(dp[i-1][j][1], dp[i-1][j][0]) + a[i][max(j, k)]); dp[i+1][k][1] = max(dp[i+1][k][1], max(dp[i-1][j][1], dp[i-1][j][0]) + a[i][max(j, k)]); } } } } ll res = 0; for(int i = 1; i <= n; i++){ for(int j = 0; j <= n; j++){ for(int c = 0; c < 2; c++){ res = max(res, dp[i][j][c]); } } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...