# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620665 | 2022-08-03T08:02:05 Z | Hazem | Horses (IOI15_horses) | C++14 | 29 ms | 24728 KB |
#include <bits/stdc++.h> #define LL long long using namespace std; const int M = 5e5+10; const int MOD = 1e9+7; LL add(LL a,LL b){ return (a+b)%MOD; } LL mult(LL a,LL b){ return (a*b)%MOD; } LL a[M],b[M],n; LL calc(){ LL ans = 0,cur = 1; for(int i=1;i<=n;i++){ assert(cur>=mult(cur,a[i])); cur = mult(cur,a[i]); ans = max(ans,mult(cur,b[i])); } return ans; } int init(int N, int X[], int Y[]) { n = N; a[0] = 1; for(int i=1;i<=n;i++) a[i] = X[i-1],b[i] = Y[i-1]; return calc(); } int updateX(int pos, int val) { a[pos+1] = val; return calc(); } int updateY(int pos, int val) { b[pos+1] = val; return calc(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 29 ms | 24728 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |