| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 70230 |
2018-08-22T13:52:02 Z |
MladenP |
Secret (JOI14_secret) |
C++17 |
|
733 ms |
8684 KB |
#include <bits/stdc++.h>
#include "secret.h"
#define mid (l+r)/2
using namespace std;
int n, i, a[1010], d[1010][1010];
void init(int l, int r) {
if(l >= r) return;
for(int i = 0; i < n; i++) d[i][i] = a[i];
for(int i = mid+1; i <= r; i++) d[mid][i] = Secret(d[mid][i-1], a[i]);
for(int i = mid-2; i >= l; i--) d[i][mid-1] = Secret(a[i], d[i+1][mid-1]);
init(l, mid-1); init(mid+1, r);
}
void Init(int N, int A[]) {
for(i = 1, n = N; i <= n; i++) a[i] = A[i-1];
init(1, N);
}
int query(int l, int r, int L, int R) {
if(L < mid && mid <= R) return Secret(d[L][mid-1],d[mid][R]);
if(L == mid) return d[mid][R];
if(mid < L) return query(mid+1, r, L, R);
return query(l, mid-1, L, R);
}
int Query(int L, int R) {
L++; R++;
//if(L == R) return a[L];
return query(1, n, L, R);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
191 ms |
4348 KB |
Output is correct - number of calls to Secret by Init = 3331, maximum number of calls to Secret by Query = 1 |
| 2 |
Correct |
202 ms |
4580 KB |
Output is correct - number of calls to Secret by Init = 3340, maximum number of calls to Secret by Query = 1 |
| 3 |
Correct |
197 ms |
4580 KB |
Output is correct - number of calls to Secret by Init = 3349, maximum number of calls to Secret by Query = 1 |
| 4 |
Correct |
698 ms |
8564 KB |
Output is correct - number of calls to Secret by Init = 7491, maximum number of calls to Secret by Query = 1 |
| 5 |
Correct |
683 ms |
8584 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 6 |
Incorrect |
733 ms |
8684 KB |
Wrong Answer: Query(999, 999) - expected : 38146624, actual : 0. |
| 7 |
Correct |
642 ms |
8684 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 8 |
Correct |
646 ms |
8684 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 9 |
Correct |
666 ms |
8684 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
| 10 |
Correct |
674 ms |
8684 KB |
Output is correct - number of calls to Secret by Init = 7499, maximum number of calls to Secret by Query = 1 |
