# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620822 | 2022-08-03T09:31:38 Z | A_D | Horses (IOI15_horses) | C++14 | 13 ms | 8276 KB |
#include "horses.h" #include <bits/stdc++.h> using namespace std; const int N=1e3+100; long long x[N]; long long y[N]; const long long MOD=1e9+7; int init(int N, int X[], int Y[]){ long long ret=0; long long sum=1; for(int i=0;i<N;i++){ sum*=x[i]; if(sum*y[i]>ret){ sum%=MOD; ret=sum*y[i]; } } ret%=MOD; return (int)ret; } int updateX(int pos, int val) { x[pos]=val; long long ret=0; long long sum=1; for(int i=0;i<N;i++){ sum*=x[i]; if(sum*y[i]>ret){ sum%=MOD; ret=sum*y[i]; } } ret%=MOD; return (int)ret; } int updateY(int pos, int val) { y[pos]=val; long long ret=0; long long sum=1; for(int i=0;i<N;i++){ sum*=x[i]; if(sum*y[i]>ret){ sum%=MOD; ret=sum*y[i]; } } ret%=MOD; return (int)ret; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 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 | Runtime error | 13 ms | 8276 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 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 | - |