| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 703410 | Stavab | Horses (IOI15_horses) | C++14 | 1557 ms | 19872 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 <vector>
#define ll long long
#define MOD 1000000007
using namespace std;
struct num
{
ll a; ll b;
num(ll x, ll y): a(x), b(y) {};
void operator*=(ll x)
{
a *= x;
b *= x;
if(b >= MOD)
{
b %= MOD;
++a;
}
}
bool operator<(const num &n) const
{
if(a != n.a) return a < n.a;
else return b < n.b;
}
};
vector<num> mult;
vector<ll> x, y;
int ans()
{
num maxVal(0, 0);
for(int i = 0; i < mult.size(); i++)
{
num tmp = mult[i];
tmp *= y[i];
maxVal = max(maxVal, tmp);
}
return maxVal.b;
}
int init(int N, int X[], int Y[])
{
mult.assign(N, num(0, 0));
mult[0].b = X[0];
x.assign(N, 0);
x[0] = X[0];
y.assign(N, 0);
y[0] = Y[0];
for(int i = 1; i < N; i++)
{
y[i] = (ll)Y[i];
x[i] = (ll)X[i];
num tmp = mult[i - 1];
tmp *= x[i];
mult[i] = tmp;
}
return ans();
}
int updateX(int pos, int val)
{
x[pos] = (ll)val;
if(!pos)
{
mult[0].b = x[0];
pos++;
}
for(int i = pos; i < mult.size(); i++)
{
num tmp = mult[i - 1];
tmp *= x[i];
mult[i] = tmp;
}
return ans();
}
int updateY(int pos, int val)
{
y[pos] = (ll)val;
return ans();
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
