# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1011280 | 2024-06-30T08:56:44 Z | Mardonbekhazratov | 말 (IOI15_horses) | C++17 | 1500 ms | 20016 KB |
#include "horses.h" #include<algorithm> #include<vector> #include<iostream> const __int128_t INFLL=1e18; const int INF=1e9; const int MOD=1e9+7; using namespace std; int n; vector<int>x,y; int get(){ vector<__int128_t>suff(n+2); suff[n]=1; for(int i=n-1;i>=0;i--){ suff[i]=max(suff[i+1]*x[i],suff[n]*x[i]*y[i]); if(suff[i]>=INFLL){ long long ans=suff[i]%MOD; for(int j=i-1;j>=0;j--) ans=ans*x[j]%MOD; return ans; } } return suff[0]%MOD; } int init(int N, int X[], int Y[]) { n=N; x.resize(n); y.resize(n); for(int i=0;i<n;i++) x[i]=X[i],y[i]=Y[i]; return get(); } int updateX(int pos, int val) { x[pos]=val; return get(); } int updateY(int pos, int val) { y[pos]=val; return get(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 0 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Correct | 0 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Correct | 0 ms | 348 KB | Output is correct |
18 | Correct | 0 ms | 348 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 0 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Correct | 0 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Correct | 0 ms | 348 KB | Output is correct |
18 | Correct | 0 ms | 348 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 1 ms | 348 KB | Output is correct |
21 | Correct | 0 ms | 348 KB | Output is correct |
22 | Correct | 0 ms | 348 KB | Output is correct |
23 | Correct | 5 ms | 348 KB | Output is correct |
24 | Correct | 5 ms | 348 KB | Output is correct |
25 | Correct | 5 ms | 508 KB | Output is correct |
26 | Correct | 5 ms | 496 KB | Output is correct |
27 | Correct | 5 ms | 344 KB | Output is correct |
28 | Correct | 5 ms | 348 KB | Output is correct |
29 | Correct | 5 ms | 476 KB | Output is correct |
30 | Correct | 6 ms | 344 KB | Output is correct |
31 | Correct | 5 ms | 348 KB | Output is correct |
32 | Correct | 5 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1573 ms | 16084 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 0 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Correct | 0 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 436 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Correct | 0 ms | 348 KB | Output is correct |
18 | Correct | 0 ms | 348 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
21 | Correct | 0 ms | 348 KB | Output is correct |
22 | Correct | 0 ms | 348 KB | Output is correct |
23 | Correct | 6 ms | 348 KB | Output is correct |
24 | Correct | 5 ms | 348 KB | Output is correct |
25 | Correct | 6 ms | 604 KB | Output is correct |
26 | Correct | 5 ms | 452 KB | Output is correct |
27 | Correct | 5 ms | 344 KB | Output is correct |
28 | Correct | 5 ms | 348 KB | Output is correct |
29 | Correct | 5 ms | 348 KB | Output is correct |
30 | Correct | 5 ms | 348 KB | Output is correct |
31 | Correct | 5 ms | 492 KB | Output is correct |
32 | Correct | 6 ms | 348 KB | Output is correct |
33 | Execution timed out | 1589 ms | 20016 KB | Time limit exceeded |
34 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 0 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 348 KB | Output is correct |
14 | Correct | 0 ms | 348 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Correct | 0 ms | 408 KB | Output is correct |
18 | Correct | 0 ms | 344 KB | Output is correct |
19 | Correct | 0 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
21 | Correct | 0 ms | 348 KB | Output is correct |
22 | Correct | 0 ms | 348 KB | Output is correct |
23 | Correct | 5 ms | 348 KB | Output is correct |
24 | Correct | 5 ms | 348 KB | Output is correct |
25 | Correct | 5 ms | 348 KB | Output is correct |
26 | Correct | 5 ms | 348 KB | Output is correct |
27 | Correct | 5 ms | 348 KB | Output is correct |
28 | Correct | 5 ms | 492 KB | Output is correct |
29 | Correct | 6 ms | 460 KB | Output is correct |
30 | Correct | 6 ms | 348 KB | Output is correct |
31 | Correct | 6 ms | 480 KB | Output is correct |
32 | Correct | 6 ms | 348 KB | Output is correct |
33 | Execution timed out | 1592 ms | 18280 KB | Time limit exceeded |
34 | Halted | 0 ms | 0 KB | - |