#include "secret.h"
using namespace std;
int stuff[10][1005];
int global_n;
void build(int stage,int st,int dr,int a[]){
if(st == dr){
stuff[stage][st] = a[st];
return ;
}
int mid = (st + dr) / 2;
stuff[stage][mid] = a[mid];
stuff[stage][mid + 1] = a[mid + 1];
for(int i = mid - 1;i >= st;i--){
stuff[stage][i] = Secret(a[i],stuff[stage][i + 1]);
}
for(int i = mid + 2;i <= dr;i++){
stuff[stage][i] = Secret(stuff[stage][i - 1],a[i]);
}
build(stage + 1,st,mid,a);
build(stage + 1,mid + 1,dr,a);
}
int query(int stage,int st,int dr,int l,int r){
int mid = (st + dr) / 2;
if(l <= mid && mid <= r){
if(r == mid){
return stuff[stage][l];
}
return Secret(stuff[stage][l],stuff[stage][r]);
}
else if(mid < l){
return query(stage + 1,mid + 1,dr,l,r);
}
else{
return query(stage + 1,st,mid,l,r);
}
}
void Init(int n, int a[]) {
global_n = n;
build(0,0,n - 1,a);
}
int Query(int l, int r) {
return query(0,0,global_n - 1,l,r);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
170 ms |
2536 KB |
Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1 |
2 |
Correct |
168 ms |
2632 KB |
Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1 |
3 |
Correct |
172 ms |
2552 KB |
Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1 |
4 |
Execution timed out |
582 ms |
4540 KB |
Time limit exceeded (wall clock) |
5 |
Execution timed out |
585 ms |
4556 KB |
Time limit exceeded (wall clock) |
6 |
Execution timed out |
583 ms |
4600 KB |
Time limit exceeded (wall clock) |
7 |
Execution timed out |
580 ms |
4336 KB |
Time limit exceeded (wall clock) |
8 |
Execution timed out |
588 ms |
4468 KB |
Time limit exceeded (wall clock) |
9 |
Execution timed out |
584 ms |
4348 KB |
Time limit exceeded (wall clock) |
10 |
Execution timed out |
584 ms |
4556 KB |
Time limit exceeded (wall clock) |