| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 466837 | Carmel_Ab1 | 말 (IOI15_horses) | C++17 | 1584 ms | 11976 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 unsigned long long ll;
typedef vector<ll> vl;
//#include "grader.cpp"
vl x,y;
void chkmax(ll& ans,ll has,ll p){
ll mod=1e9+7;
if(ans/p<has && ans/has<p)
ans=((has)%mod*(p%mod))%mod;
}
int init(int n, int X[], int Y[]) {
x.resize(n);
y.resize(n);
const ll mod=1e9+7;
ll has=1,ans=0;
for(int i=0; i<n; i++)
x[i]=ll(1ll*X[i]),y[i]=ll(1ll*Y[i]);
for(int i=0; i<n; i++){
has*=x[i];
chkmax(ans,has,y[i]);
assert(ans<mod);
}
return int(ans);
}
int updateX(int pos, int val) {
const ll mod=1e9+7;
ll has=1,ans=0;
x[pos]=ll(val);
int n=x.size();
for(int i=0; i<n; i++){
has*=x[i];
chkmax(ans,has,y[i]);
assert(ans<mod);
}
return int(ans);
}
int updateY(int pos, int val) {
const ll mod=1e9+7;
ll has=1,ans=0;
y[pos]=ll(val);
int n=x.size();
for(int i=0; i<n; i++){
has*=x[i];
chkmax(ans,has,y[i]);
assert(ans<mod);
}
return int(ans);
}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... | ||||
