# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
740289 |
2023-05-12T09:29:45 Z |
BidoTeima |
Secret (JOI14_secret) |
C++17 |
|
428 ms |
8196 KB |
#include "secret.h"
#include <bits/stdc++.h>
const int N = 1e3;
int val[N][N];
int a[N];
void rec(int l, int r){
if(l == r){
val[l][l] = a[l];
return;
}
int mid = (l + r) >> 1;
// (l, mid), (l + 1, mid), ..., (mid, mid)
int pre = a[mid];
for(int i = mid; i >= l; i--){
if(i < mid)pre = Secret(pre, a[i]);
val[i][mid] = pre;
}
pre = a[r];
for(int i = r; i >= mid + 1; i--){
if(i < r)pre = Secret(pre, a[i]);
val[i][r] = pre;
}
rec(l, mid);
rec(mid + 1, r);
}
void Init(int n, int A[]) {
for(int i = 0; i < n; i++){
a[i] = A[i];
}
memset(val, -1, sizeof(val));
rec(0, n - 1);
}
int Query(int L, int R) {
if(L == R)
return val[L][L];
for(int i = L; i + 1 <= R; i++){
if(val[L][i] != -1 && val[i + 1][R] != -1)
return Secret(val[L][i], val[i + 1][R]);
}
if(val[L][R] != -1)
return val[L][R];
return -1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
112 ms |
6268 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : -1. |
2 |
Incorrect |
120 ms |
6208 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : -1. |
3 |
Incorrect |
115 ms |
6180 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : -1. |
4 |
Incorrect |
419 ms |
8168 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : -1. |
5 |
Incorrect |
420 ms |
8120 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : -1. |
6 |
Incorrect |
428 ms |
8196 KB |
Wrong Answer: Query(738, 741) - expected : 983692994, actual : -1. |
7 |
Incorrect |
421 ms |
8188 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : -1. |
8 |
Incorrect |
428 ms |
8124 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : -1. |
9 |
Incorrect |
424 ms |
8140 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : -1. |
10 |
Incorrect |
424 ms |
8148 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : -1. |