# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109093 | Garu | 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 <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long ll;
int updateX(int pos,int val)
{
X[pos] = val;
ll ans = 0;
ll profit = 0;
ll horses = 1;
for(int i = 0 ; i < n ; i++)
{
horses*=X[i];
horses%=MOD;
profit = (horses % MOD * y[i] % MOD) % MOD;
ans = max(ans , profit);
}
return ans;
}
int updateY(int pos,int val)
{
Y[pos] = val;
ll ans = 0;
ll profit = 0;
ll horses = 1;
for(int i = 0 ; i < n ; i++)
{
horses*=X[i];
horses%=MOD;
profit = (horses % MOD * y[i] % MOD) % MOD;
ans = max(ans , profit);
}
return ans;
}
int init(int N , int X[] , int Y[])
{
ll ans = 0;
ll profit = 0;
ll horses = 1;
for(int i = 0 ; i < n ; i++)
{
horses*=X[i];
horses%=MOD;
profit = (horses % MOD * y[i] % MOD) % MOD;
ans = max(ans , profit);
}
return ans;
}