# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795491 | 2023-07-27T10:27:30 Z | jasmin | Horses (IOI15_horses) | C++17 | 25 ms | 4780 KB |
#include "horses.h" #include<bits/stdc++.h> using namespace std; const int 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=-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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 25 ms | 4780 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |