# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54648 | 2018-07-04T10:54:58 Z | gs18115 | Secret (JOI14_secret) | C++14 | 0 ms | 0 KB |
#include<iostream> #include<map> using namespace std; map<pair<int,int>,bool>CHK; map<pair<int,int>,int>SEC; int ST[4567]; int N2; int Secret2(int X,int Y) { pair<int,int>P; P=make_pair(X,Y); if(CHK[P]) return SEC[P]; CHK[P]=true; return SEC[P]=Secret(X,Y); } void Init(int N,int A[]) { for(N2=1;N2<N;N2<<=1); for(int i=0;i<N;i++) ST[i]=A[i]; } int Query(int L,int R) { int A=ST[L]; for(int i=L+1;i<=R;i++) A=Secret2(A,ST[i]); return A; }