제출 #1247425

#제출 시각아이디문제언어결과실행 시간메모리
1247425fskarica메기 농장 (IOI22_fish)C++20
0 / 100
359 ms38136 KiB
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

const int MAX = 2010;
int n, m;
vector <int> vx, vy, w;
ll dp[MAX][MAX];
int mat[MAX][MAX];

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N, m = M, vx = X, vy = Y, w = W;

    for (int i = 0; i < m; i++) {
        vx[i]++;
        vy[i]++;

        mat[vx[i]][vy[i]] = w[i];
    }

    for (int i = 2; i <= n; i++) {
        ll maxx = 0;
        for (int j = n; j >= 0; j--) {
            maxx = max(maxx, dp[i - 1][j]);
            dp[i][j] = maxx;
            maxx += mat[i][j];
        }

        maxx = 0;
        for (int j = 0; j <= n; j++) {
            maxx = max(maxx, dp[i - 1][j]);
            maxx += mat[i - 1][j];

            dp[i][j] = maxx;
        }
    }

    ll ret = 0;
    for (int i = 0; i <= n; i++) ret = max(ret, dp[n][i]);

    return ret;
}
#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...