#include <bits/stdc++.h>
#include <secret.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
using namespace std;
const int MOD = 1e9+7, MAXN = 1e5+5;
const string NAME = "";
pair<ll,bool> val[1005][1005];
void preprocess(int l, int r, int a[]){
int mid=(l+r)>>1;
val[mid][mid].fi=a[mid], val[mid][mid].se=1;
if(l==r) return;
preprocess(l,mid,a);
preprocess(mid+1,r,a);
for(int i = mid-1; i>=l; --i)
if(!val[i][mid].se) val[i][mid].fi=Secret(val[i+1][mid].fi,a[i]), val[i][mid].se=1;
for(int i = mid+1; i<=r; ++i)
if(!val[mid][i].se) val[mid][i].fi=Secret(val[mid][i-1].fi,a[i]), val[mid][i].se=1;
}
void Init(int n, int a[]){
for(int i = n; i>0; --i)
swap(a[i],a[i-1]);
preprocess(1,n,a);
}
int Query(int l, int r){
++l, ++r;
if(val[l][r].se) return val[l][r].fi;
for(int i = l; i<r; ++i)
if(val[l][i].se&&val[i+1][r].se) return Secret(val[l][i].fi,val[i+1][r].fi);
return val[l][l].fi;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
77 ms |
12872 KB |
Wrong Answer: Query(113, 206) - expected : 536899947, actual : 835515191. |
2 |
Incorrect |
77 ms |
12872 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 843778134. |
3 |
Incorrect |
83 ms |
12872 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 814958049. |
4 |
Incorrect |
293 ms |
19184 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 934575774. |
5 |
Incorrect |
298 ms |
19396 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 918843649. |
6 |
Incorrect |
295 ms |
19240 KB |
Wrong Answer: Query(200, 208) - expected : 277813445, actual : 102453254. |
7 |
Incorrect |
300 ms |
19272 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 522580392. |
8 |
Incorrect |
294 ms |
19180 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 322810476. |
9 |
Incorrect |
299 ms |
19224 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 247502630. |
10 |
Incorrect |
301 ms |
19272 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 814696017. |