# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
606168 |
2022-07-26T05:22:29 Z |
kawaii |
Secret (JOI14_secret) |
C++14 |
|
498 ms |
8340 KB |
#include "secret.h"
#include<bits/stdc++.h>
using namespace std;
int n, a[1005], pre[1005][1005];
void dnc(int l, int r){
if(l == r) return;
int mid = l + r >> 1;
dnc(l, mid); dnc(mid + 1, r);
for(int i = mid - 1; i >= l; i--) pre[i][mid] = pre[mid][i] = Secret(a[i], pre[i + 1][mid]);
for(int i = mid + 2; i <= r; i++) pre[mid + 1][i] = pre[i][mid + 1] = Secret(pre[mid + 1][i - 1], a[i]);
}
void Init(int N, int A[]){
for(int i = 1; i <= N; i++) a[i] = A[i - 1], pre[i][i] = a[i];
n = N;
dnc(1, n);
}
int solve(int l, int r, int lf, int rt){
if(l == r) return a[l];
int mid = l + r >> 1;
if(lf <= mid && mid <= rt){
if(lf == mid) return Secret(a[lf], pre[mid + 1][rt]);
if(rt == mid) return pre[lf][mid];
return Secret(pre[lf][mid], pre[mid + 1][rt]);
}
if(rt < mid) return solve(l, mid, lf, rt);
else return solve(mid + 1, r, lf, rt);
}
int Query(int L, int R){
L++; R++;
return solve(1, n, L, R);
}
Compilation message
secret.cpp: In function 'void dnc(int, int)':
secret.cpp:9:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
9 | int mid = l + r >> 1;
| ~~^~~
secret.cpp: In function 'int solve(int, int, int, int)':
secret.cpp:23:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
23 | int mid = l + r >> 1;
| ~~^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
117 ms |
4292 KB |
Wrong Answer: Query(56, 56) - expected : 677274107, actual : 134970362. |
2 |
Incorrect |
113 ms |
4400 KB |
Wrong Answer: Query(389, 389) - expected : 472506730, actual : 472490344. |
3 |
Incorrect |
123 ms |
4284 KB |
Wrong Answer: Query(18, 18) - expected : 238214183, actual : 204658726. |
4 |
Incorrect |
439 ms |
8120 KB |
Wrong Answer: Query(788, 788) - expected : 937598145, actual : 926442046. |
5 |
Incorrect |
498 ms |
8220 KB |
Wrong Answer: Query(957, 957) - expected : 115761809, actual : 652361744. |
6 |
Incorrect |
437 ms |
8180 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 156045047. |
7 |
Correct |
452 ms |
8192 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
8 |
Correct |
442 ms |
8280 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
9 |
Correct |
447 ms |
8340 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |
10 |
Correct |
469 ms |
8332 KB |
Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1 |