| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 70235 |
2018-08-22T13:58:43 Z |
Pajaraja |
Secret (JOI14_secret) |
C++17 |
|
674 ms |
8576 KB |
#include "secret.h"
int val[1007][1007],a[1007],n;
void rek(int l,int r){int s=(l+r)/2;for(int i=s-1;i>=l;i--) val[i][s]=Secret(a[i],val[i+1][s]);for(int i=s+2;i<=r;i++) val[s+1][i]=Secret(val[s+1][i-1],a[i]);if(l==r) return;rek(l,s);rek(s+1,r);}
void Init(int N, int A[]) {n=N;for(int i=0;i<n;i++) val[i][i]=a[i]=A[i];rek(0,n-1);}
int ans(int l,int r,int lt,int rt){if(l==r) return a[l];int s=(l+r)/2;if(lt<=s && rt>s) return Secret(val[lt][s],val[s+1][rt]);if(rt<=s) return ans(l,s,lt,rt);return ans(s+1,r,lt,rt);}
int Query(int L, int R){return ans(0,n-1,L,R);}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
184 ms |
4472 KB |
Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
171 ms |
4472 KB |
Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
179 ms |
4536 KB |
Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1 |
| 4 |
Correct |
652 ms |
8268 KB |
Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1 |
| 5 |
Correct |
658 ms |
8500 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 6 |
Correct |
663 ms |
8500 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 7 |
Correct |
674 ms |
8500 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 8 |
Correct |
659 ms |
8500 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 9 |
Correct |
660 ms |
8576 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
| 10 |
Correct |
655 ms |
8576 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
