제출 #702570

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
702570		boris_mihov	메기 농장 (IOI22_fish)	C++17	0 / 100	46 ms	8104 KiB

fish

#include "fish.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
 
typedef long long llong;
const int MAXN = 300 + 10;
 
int n, m;
int t[MAXN][MAXN];
bool bl[MAXN][10][10][10];
llong dp[MAXN][10][10][10];
llong f(int idx, int curr, int last1, int last2)
{
    if (idx == n + 1)
    {
        return 0;
    }

    if (bl[idx][curr][last1][last2])
    {
        return dp[idx][curr][last1][last2];
    }

    bl[idx][curr][last1][last2] = true;
    dp[idx][curr][last1][last2] = f(idx + 1, 0, curr, last1);

    if (curr < 8)
    {
        llong add = t[curr + 1][idx + 1];
        if (last2 < curr + 1 && last1 < idx - 1)
        {
            add += t[curr + 1][idx - 1];
        }

        if (last1 >= curr + 1)
        {
            add -= t[curr + 1][idx];
        }

        dp[idx][curr][last1][last2] = std::max(dp[idx][curr][last1][last2], f(idx, curr + 1, last1, last2) + add);
    }

    return dp[idx][curr][last1][last2];
}

llong 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)
    {
        t[Y[i] + 1][X[i] + 1] = W[i];
    }   
    
    return f(1, 0, 0, 0);
}

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