#include "secret.h"
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL)
#define sz(x) (int)((x).size())
#define pb push_back
#define vi vector<int>
#define vb vector<bool>
#define vvb vector<vb>
#define pi pair<int,int>
#define vpi vector<pi>
#define vvi vector<vi>
#define vc vector<char>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pbb() pop_back()
#define f first
#define s second
#define ll long long
//#define int long long
#define ull unsigned long long
#define line cout<<"_____________________________"<<endl;
#define hash cout<<"################"<<endl;
#define forr(i, a, b) for(int i=a; i<b; i++)
using namespace std;
const int N=1e5+1, mod=1e9+7, inf=1e18+1;
vvi ldp, rdp;
vi a;
int n;
void populate(int l, int r)
{
if(l>=r) return;
int m= (l+r)/2;
// l....m || m+1......r
for(int i=m+2; i<=r; i++) rdp[m+1][i]= Secret(rdp[m+1][i-1], a[i]);
for(int i=m-1; i>=l; i--) ldp[m][i]= Secret(ldp[m][i+1], a[i]);
populate(l, m);
populate(m+1, r);
}
void Init(int m, int A[])
{
n=m;
ldp.resize(n, vi(n));
rdp.resize(n, vi(n));
a.resize(n);
forr(i, 0, n) a[i]=ldp[i][i]=rdp[i][i]=A[i];
populate(0, n-1);
}
int query(int lx, int rx, int l, int r)
{
int mx= (lx+rx)/2;
// lx.........mx||mx+1..........rx
//....l...............r
if(l<=mx and mx+1<=r) return Secret( ldp[mx][l], rdp[mx+1][r]);
if(mx==r) return ldp[mx][l];
if(l==mx+1) return rdp[mx+1][r];
if(r<mx) return query(lx, mx, l, r);
return query(mx+1, rx,l, r);
}
int Query(int l, int r)
{
if(l==r) return a[l];
return query(0, n-1, l, r);
}
Compilation message
secret.cpp:25:39: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
25 | const int N=1e5+1, mod=1e9+7, inf=1e18+1;
| ~~~~^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
110 ms |
4536 KB |
Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015. |
2 |
Incorrect |
115 ms |
4580 KB |
Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560. |
3 |
Incorrect |
117 ms |
4536 KB |
Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500. |
4 |
Incorrect |
457 ms |
12228 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568. |
5 |
Incorrect |
419 ms |
12280 KB |
Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316. |
6 |
Incorrect |
424 ms |
12176 KB |
Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445. |
7 |
Incorrect |
423 ms |
12204 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873. |
8 |
Incorrect |
446 ms |
12220 KB |
Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792. |
9 |
Incorrect |
439 ms |
12236 KB |
Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577. |
10 |
Incorrect |
432 ms |
12268 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787. |