# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234228 | DanerZein | Horses (IOI15_horses) | C++14 | 19 ms | 8448 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 unsigned long long ll;
int X1[1010],Y1[1010];
long long t,r=-1;
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])*(nm);
ll d=(Y[i]*nm);
//d%=mod;
ma=max(ma,d);
}
ma%=mod;
r=ma;
return r;
}
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])*(nm);
ll d=(Y1[i]*nm);
//d%=mod;
ma=max(ma,d);
}
ma%=mod;
r=ma;
return r;
}
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])*(nm);
ll d=(Y1[i]*nm);
//d%=mod;
ma=max(ma,d);
}
ma%=mod;
r=ma;
return r;
}
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... |