# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132305 | ioilolcom | Horses (IOI15_horses) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
int n;
const int mod=1e9+7;
int solve(int day,int horses){
if(day==n || horses==0) {
return 0;
}
horses=horses*X[day];
int ans=0;
for(int tosell=0; tosell<=horses; tosell++) {
ans=max(ans,solve(day+1,horses-tosell)+toseint*Y[day]);
}
ans%=mod;
return ans;
}
int init(int N, int X[], int Y[]) {
n=N;
int ans=solve(0,1);
return ans;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}