# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234176 | DanerZein | Horses (IOI15_horses) | C++14 | 21 ms | 8320 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>
#define mod 1000000007
using namespace std;
typedef long long ll;
int X1[1010],Y1[1010],t;
int init(int N, int X[], int Y[]) {
t=N;
// return 0;
ll ma=-1;
ll nm=1;
for(int i=0;i<N;i++){
X1[i]=X[i];
Y1[i]=Y[i];
nm=(X[i]%mod)*(nm%mod);
nm%=mod;
ma=max(ma,(Y[i]*nm)%mod);
}
return ma;
}
int updateX(int pos, int val) {
X1[pos]=val;
ll nm=1;
ll ma=-1;
for(int i=0;i<t;i++){
nm=(X1[i]%mod)*(nm%mod);
nm%=mod;
ma=max(ma,(Y1[i]*nm)%mod);
}
return ma;
}
int updateY(int pos, int val) {
Y1[pos]=val;
ll nm=1;
ll ma=-1;
for(int i=0;i<t;i++){
nm=(X1[i]%mod)*(nm%mod);
nm%=mod;
ma=max(ma,(Y1[i]*nm)%mod);
}
return ma;
}
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... |