# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830372 | 2023-08-19T04:45:50 Z | Shithila | Horses (IOI15_horses) | C++14 | 1500 ms | 8348 KB |
#include "horses.h" #include <bits/stdc++.h> using namespace std; vector<int> x,y; int n; long long profit() { long long max=0; long long mul=1; int maxpos=0; for(int i=0;i<n;i++) { mul=mul*x[i]; long long val=mul*y[i]; if(val>max) { max=y[i]; mul=1; maxpos=i; } } mul=1; for(int i=0;i<maxpos;i++) { mul=mul*x[i]; mul=mul%((long long)1e9+7); } long long ans=mul*max; ans=ans%((long long)1e9+7); return ans; } int init(int N, int X[], int Y[]) { for(int i=0;i<N;i++) { x.push_back(X[i]); y.push_back(Y[i]); } n=N; return profit(); } int updateX(int pos, int val) { x[pos]=val; return profit(); } int updateY(int pos, int val) { y[pos]=val; return profit(); }
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 | Execution timed out | 1554 ms | 8348 KB | Time limit exceeded |
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 | - |