제출 #421033

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421033		LouayFarah	말 (IOI15_horses)	C++14	0 / 100	1582 ms	95800 KiB

horses

#include "bits/stdc++.h"
#include "horses.h"
using namespace std;
 
const int MOD = 1e9+7;
 
int n;
vector<int> x, y;
vector<vector<int>> dp(1001, vector<int>(10001, -1));
 
int solve(int h, int i, int curr)
{
    if(i==n)
    {
        return dp[h][curr] = curr;
    }
 
    if(dp[h][curr]!=-1)
        return dp[h][curr];
 
    int t = h*x[i];
 
    int maxi = curr;
    for(int j = 0; j<=t; j++)
    {
        maxi = max(maxi, solve(t-j, i+1, (curr%MOD + ((j%MOD)*(y[i])%MOD)%MOD))%MOD);
    }
    return maxi;
}
 
int init(int N, int X[], int Y[])
{
    n = N;
    x.assign(n, 0);
    y.assign(n, 0);
 
    for(int i = 0; i<n; i++)
    {
        x[i] = X[i];
        y[i] = Y[i];
    }
 
    int res = solve(1, 0, 0);
    return res;
}
 
int updateX(int pos, int val)
{
    x[pos] = val;
    int res = solve(1, 0, 0);
    return res;
}
 
int updateY(int pos, int val)
{
    y[pos] = val;
    int res = solve(1, 0, 0);
    return res;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23