| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 137318 | eohomegrownapps | Horses (IOI15_horses) | C++14 | 1563 ms | 12024 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;
typedef long long ll;
ll md = 1000000007;
vector<ll> x;
vector<ll> y;
ll n;
int query(){
ll mx = 1;
ll current = 1;
for (ll i = 0; i<n; i++){
current*=x[i];
current%=md;
mx=max(mx,(current*y[i])%md);
}
return mx;
}
int init(int N, int X[], int Y[]) {
n=N;
x.resize(n);
y.resize(n);
for (ll i = 0; i<n; i++){
x[i]=X[i];
y[i]=Y[i];
}
return query();
}
int updateX(int pos, int val) {
x[pos]=val%md;
return query();
}
int updateY(int pos, int val) {
y[pos]=val%md;
return query();
}
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... | ||||
