# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
960944 |
2024-04-11T09:34:51 Z |
pcc |
Secret (JOI14_secret) |
C++17 |
|
385 ms |
6192 KB |
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
const int mxn = 1010;
vector<int> pref[mxn*4],suf[mxn*4];
int arr[mxn];
int N;
map<pii,int> mp;
int ask(int a,int b){
if(mp.find(pii(a,b)) != mp.end())return mp[pii(a,b)];
else return mp[pii(a,b)] = Secret(a,b);
}
#define mid ((l+r)>>1)
#define ls now*2+1
#define rs now*2+2
void build(int now,int l,int r){
if(l == r){
pref[now].push_back(arr[l]);
suf[now].push_back(arr[l]);
return;
}
build(ls,l,mid);
build(rs,mid+1,r);
pref[now] = pref[ls];
for(int i = mid+1;i<=r;i++)pref[now].push_back(ask(pref[now].back(),arr[i]));
suf[now] = suf[rs];
reverse(suf[now].begin(),suf[now].end());
for(int i = mid;i>l;i--)suf[now].push_back(ask(arr[i],suf[now].back()));
suf[now].push_back(pref[now].back());
reverse(suf[now].begin(),suf[now].end());
//cout<<l<<' '<<r<<":";cout<<endl;for(auto &i:pref[now])cout<<i<<',';cout<<endl;for(auto &i:suf[now])cout<<i<<',';cout<<endl;
return;
}
int getval(int now,int l,int r,int s,int e){
if(l == r)return arr[l];
if(mid>=s&&mid<e){
return ask(suf[ls].end()[s-mid-1],pref[rs][e-mid-1]);
}
if(mid>=e)return getval(ls,l,mid,s,e);
else return getval(rs,mid+1,r,s,e);
}
#undef ls
#undef rs
#undef mid
void Init(int NN, int A[]) {
N = NN;
for(int i = 0;i<N;i++)arr[i] = A[i];
build(0,0,N-1);
return;
}
int Query(int L, int R) {
return getval(0,0,N-1,L,R);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
114 ms |
3844 KB |
Output is correct - number of calls to Secret by Init = 4088, maximum number of calls to Secret by Query = 1 |
2 |
Correct |
111 ms |
3684 KB |
Output is correct - number of calls to Secret by Init = 4097, maximum number of calls to Secret by Query = 1 |
3 |
Correct |
111 ms |
3680 KB |
Output is correct - number of calls to Secret by Init = 4107, maximum number of calls to Secret by Query = 1 |
4 |
Partially correct |
377 ms |
5732 KB |
Output isn't correct - number of calls to Secret by Init = 8967, maximum number of calls to Secret by Query = 1 |
5 |
Partially correct |
384 ms |
5752 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
6 |
Partially correct |
373 ms |
5732 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
7 |
Partially correct |
385 ms |
5988 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
8 |
Partially correct |
382 ms |
6192 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
9 |
Partially correct |
377 ms |
5968 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |
10 |
Partially correct |
384 ms |
5800 KB |
Output isn't correct - number of calls to Secret by Init = 8977, maximum number of calls to Secret by Query = 1 |