# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620822 | A_D | Horses (IOI15_horses) | C++14 | 13 ms | 8276 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;
const int N=1e3+100;
long long x[N];
long long y[N];
const long long MOD=1e9+7;
int init(int N, int X[], int Y[]){
long long ret=0;
long long sum=1;
for(int i=0;i<N;i++){
sum*=x[i];
if(sum*y[i]>ret){
sum%=MOD;
ret=sum*y[i];
}
}
ret%=MOD;
return (int)ret;
}
int updateX(int pos, int val) {
x[pos]=val;
long long ret=0;
long long sum=1;
for(int i=0;i<N;i++){
sum*=x[i];
if(sum*y[i]>ret){
sum%=MOD;
ret=sum*y[i];
}
}
ret%=MOD;
return (int)ret;
}
int updateY(int pos, int val) {
y[pos]=val;
long long ret=0;
long long sum=1;
for(int i=0;i<N;i++){
sum*=x[i];
if(sum*y[i]>ret){
sum%=MOD;
ret=sum*y[i];
}
}
ret%=MOD;
return (int)ret;
}
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... |