# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795497 | jasmin | Horses (IOI15_horses) | C++17 | 25 ms | 4420 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 long long MOD=1e9+7;
bool bigger(pair<int,int> a, pair<int,int> b){
return a.first*b.second > a.second*b.first;
}
int solveSlow(int n, int x[], int y[]){
long long p=1; bool mod=false;
pair<int,int> maxi={1, 1}; int ind=n-1;
for(int i=n-1; i>=0; i--){
if(!mod){
if(bigger({y[i], p}, maxi)){
maxi={y[i], p};
ind=i;
}
}
p*=x[i];
if(p>MOD){
p%=MOD;
mod=true;
}
}
int ans=1;
for(int i=0; i<=ind; i++){
ans *= x[i];
ans%=MOD;
}
ans*=y[ind];
ans%=MOD;
return ans;
}
int init(int N, int X[], int Y[]) {
return solveSlow(N, X, Y);
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
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... |