# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526335 | Belgutei | Horses (IOI15_horses) | C++17 | 13 ms | 8296 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;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define MOD 1000000007
ll x[1005];
ll y[1005];
int n,pos1;
int go(){
for(int i=0; i<n; i++){
ll tur=1;
bool ok=0;
for(int j=i+1; j<n; j++){
tur*=x[j];
if(y[j]<tur){
ok=1;
break;
}
ll tur1=tur*y[j];
if(y[j]<tur1){
ok=1;
break;
}
}
if(ok==0){
pos1=i;
break;
}
}
int tur=1;
for(int i=0; i<=pos1; i++){
tur*=x[i];
tur%=MOD;
}
tur*=y[pos1];
tur%=MOD;
return tur;
}
int init(int N, int X[], int Y[]) {
n=N;
for(int i=0; i<n; i++){
x[i]=X[i];
y[i]=Y[i];
}
return go();
}
int updateX(int pos, int val) {
x[pos]=val;
return go();
}
int updateY(int pos, int val) {
y[pos]=val;
return go();
}
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... |