#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define er erase
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int oo = 1e18 + 7, mod = 1e9 + 7;
int n, x, y, a[1005], ans[1005][1005], answer;
void build(int l, int r){
if(r <= (l + 1)) return;
int mid = (l + r) >> 1;
for(int i = mid - 1; i >= l; i--) ans[i][mid] = Secret(ans[i + 1][mid], a[i]);
for(int i = mid + 2; i <= r; i++) ans[mid + 1][i] = Secret(ans[mid + 1][i - 1], a[i]);
build(l, mid);
build(mid + 1, r);
}
void search(int l, int r){
int mid = (l + r) >> 1;
if(x < mid || y > mid) return;
if(x <= mid && y > mid){
answer = Query(ans[x][mid], ans[mid + 1][y]);
return;
}
search(l, mid);
search(mid + 1, r);
}
void Init(int N, int A[]){
n = N;
for(int i = 0; i < n; i++) a[i + 1] = A[i];
build(1, n);
}
int Query(int X, int Y){
x = X;
y = Y;
answer = 0;
search(1, n);
return answer;
}
/*
TEST HERE
INPUT #1
OUTPUT #1
INPUT #2
OUTPUT #2
INPUT #3
OUTPUT #3
*/
Compilation message
secret.cpp:15:21: warning: overflow in implicit constant conversion [-Woverflow]
const int oo = 1e18 + 7, mod = 1e9 + 7;
~~~~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
137 ms |
4472 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 0. |
2 |
Incorrect |
137 ms |
4472 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0. |
3 |
Incorrect |
140 ms |
4472 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 0. |
4 |
Incorrect |
493 ms |
8440 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 0. |
5 |
Incorrect |
497 ms |
8468 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 0. |
6 |
Incorrect |
500 ms |
8440 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 0. |
7 |
Incorrect |
504 ms |
8348 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
8 |
Incorrect |
500 ms |
8440 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 0. |
9 |
Incorrect |
503 ms |
8432 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0. |
10 |
Incorrect |
497 ms |
8568 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |