# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830331 | Shithila | 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;
vector<int> x,y;
int n;
int profit()
{
long long max=0;
long long mul=1;
for(int i=0;i<N;i++)
{
mul=mul*x[i];
long long val=mul*y[i];
if(val>max) max=val;
}
int ans=max%(1e9+7);
}
int init(int N, int X[], int Y[]) {
for(int i=0;i<N;i++)
{
x.push_back<X[i]>;
y.push_back<Y[i]>;
}
n=N;
return profit();
}
int updateX(int pos, int val) {
x[pos]=val;
return profit();
}
int updateY(int pos, int val) {
y[pos]=val;
return profit();
}