Submission #1190214

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190214		simona1230	Horses (IOI15_horses)	C++20	0 / 100	7 ms	4536 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>
using namespace std;


int dp[16][1024];
int init(int N, int X[], int Y[])
{
    for(int i=0;i<N;i++)
    {
        for(int j=0;j<=1000;j++)
        {
            dp[i][j]=-1;
        }
    }
    int p=1;
    int ans=0;
	for(int i=0;i<N;i++)
    {
        p*=X[i];
        for(int j=0;j<=p;j++)
        {
            if(i==0)
            {
                dp[i][j]=(X[i]-j)*Y[i];
                continue;
            }
            int s=j/X[i];
            if(j%X[i])s++;
            for(int pj=s;pj<=p/X[i];pj++)
            {
                if(dp[i-1][pj]==-1)continue;
                dp[i][j]=max(dp[i][j],dp[i-1][pj]+(pj*X[i]-j)*Y[i]);
                ans=max(ans,dp[i][j]);
            }
        }
    }

    return ans;
}

int updateX(int pos, int val) {
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}

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