# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
174615 | mat_v | Horses (IOI15_horses) | C++14 | 35 ms | 16184 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>
#include "horses.h"
#define mod 1000000007
#define maxn 500005
using namespace std;
typedef long long ll;
ll add(ll x, ll y){
return (x + y)%mod;
}
ll mul(ll x, ll y){
return (x * y)%mod;
}
ll power(ll x, ll y){
if(y == 0)return 1;
ll pola = power(x, y / 2);
pola = mul(pola, pola);
if(y%2 == 1)pola = mul(pola, x);
return pola;
}
int n;
ll x[maxn];
ll y[maxn];
int init(int N, int X[], int Y[]) {
n = N;
for(int i=1; i<=n; i++){
x[i] = X[i - 1];
y[i] = Y[i - 1];
}
ll res = 0;
ll p = 1;
for(int i=1; i<=n; i++){
p *= x[i];
res = max(res, p * y[i]);
}
return res;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
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... |