Submission #70271

# Submission time Handle Problem Language Result Execution time Memory
70271 2018-08-22T14:27:56 Z Pajaraja Secret (JOI14_secret) C++17
100 / 100
641 ms 8604 KB
#include "secret.h"
#define g return
#define q int
q i,v[1007][1007],a[1007],n,s;void t(q l,q r){s=(l+r)/2;for(i=s-1;i>=l;i--)v[i][s]=Secret(a[i],v[i+1][s]);for(i=s+2;i<=r;i++)v[s+1][i]=Secret(v[s+1][i-1],a[i]);if(l==r)g;t(l,s);t(s+1,r);}void Init(q N,q*A){n=N;for(i=0;i<n;i++)v[i][i]=a[i]=A[i];t(0,n-1);}q b(q l,q r,q o,q u){if(l==r) g a[l];s=(l+r)/2;if(o<=s&&u>s)g Secret(v[o][s],v[s+1][u]);if(u<=s)g b(l,s,o,u);g b(s+1,r,o,u);}q Query(q L,q R){g b(0,n-1,L,R);}
# Verdict Execution time Memory Grader output
1 Correct 208 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 172 ms 4580 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 170 ms 4580 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 600 ms 8404 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 597 ms 8584 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 599 ms 8584 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 641 ms 8584 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 638 ms 8588 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 636 ms 8588 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 637 ms 8604 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1