Submission #1362131

#TimeUsernameProblemLanguageResultExecution timeMemory
1362131activedeltorreCatfish Farm (IOI22_fish)C++20
3 / 100
39 ms7264 KiB
#include "fish.h"

#include <vector>
#include <iostream>
using namespace std;
long long mat[305][305];
long long spar[305][305];
long long dp[305][305][305];
long long cost(int col, int a, int b, int c)
{
    long long sum = 0;
    if (c >= b && c >= a)
    {
        sum += spar[col - 1][c] - spar[col - 1][max(a, b)];
    }
    if (c > b)
    {
        sum -= spar[col][b];
    }
    else
    {
        sum -= spar[col][c];
    }
    sum += spar[col + 1][c];
    return sum;
}
long long inf = 1e16;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W)
{
    int n = N, m = M;
    long long maxim=0;
    for (int i = 0; i < m; i++)
    {
        maxim += W[i];
    }
    return maxim;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...