text stringlengths 49 983k |
|---|
#include <cstdio>
#include <algorithm>
#define bi(x) (1<<(x-1))
#define rep(i,j,k) for (i=j;i<=k;i++)
#define down(i,j,k) for (i=j;i>=k;i--)
using namespace std;
const int N=2e5+5,K=20,Sn=1<<19;
int n,sn,V,v,k,i,j,lef,rig;
int a[N],c[N],l[N],r[N];
int rr[N][K],ls[Sn],rs[Sn];
void work(int *r,int *rs)
{
int i,j,v=V;
rep(j,1,k)
{
rr[n][j]=n;
down(i,n-1,1)
if (abs(a[i+1]-a[i])<=v) rr[i][j]=rr[i+1][j];
else rr[i][j]=i;
v>>=1;
}
rep(i,1,n) r[i]=rr[i][1];
rep(i,0,sn) rs[i]=0;
rep(i,0,sn-1)
{
rep(j,2,k)
if (!(i&bi(j)))
rs[i^bi(j)]=max(rs[i^bi(j)],rr[rs[i]+1][j]);
}
}
int main()
{
// freopen("camel.in","r",stdin);
// freopen("camel.out","w",stdout);
scanf("%d%d",&n,&V);
rep(i,1,n) scanf("%d",&a[i]);
for (k=1,v=V;v>0;v>>=1) k++;
sn=(1<<k)-1;
work(r,rs);
reverse(a+1,a+1+n);
work(l,ls);
rep(i,1,n) l[i]=n-l[i]+1;
reverse(l+1,l+1+n);
rep(i,0,sn) {
lef=rs[i]; rig=n-ls[sn^i]+1;
if (rig-lef<=1) c[1]++;
else if (r[lef+1]>=rig-1) {
c[l[lef+1]]++; c[r[lef+1]+1]--;
}
}
rep(i,1,n) {
c[i]+=c[i-1];
if (c[i]>0) printf("Possible\n");
else printf("Impossible\n");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, V, a[maxn], L[maxn][20], R[maxn][20];
int d[20], fl[1 << 18], fr[1 << 18], ans[maxn];
int main() {
scanf("%d %d", &n, &V);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int m = (int)log2(V) + 1;
for (int i = 0; i <= m; i++) {
d[i] = V >> i;
}
for (int i = 0; i <= m; i++) {
L[0][i] = L[1][i] = 1;
R[n][i] = R[n + 1][i] = n;
for (int j = 2; j <= n; j++) {
L[j][i] = a[j] - a[j - 1] <= d[i] ? L[j - 1][i] : j;
}
for (int j = n - 1; j; j--) {
R[j][i] = a[j + 1] - a[j] <= d[i] ? R[j + 1][i] : j;
}
}
for (int i = 0; i < 1 << m; i++) {
fr[i] = n + 1;
for (int j = 0; j < m; j++) if (i >> j & 1) {
fl[i] = max(fl[i], R[fl[i ^ (1 << j)] + 1][j + 1]);
fr[i] = min(fr[i], L[fr[i ^ (1 << j)] - 1][j + 1]);
}
}
for (int i = 0; i <= n + 1; i++) {
ans[i] = n + 2;
}
for (int i = 0; i < 1 << m; i++) {
ans[fl[i]] = min(ans[fl[i]], fr[i ^ ((1 << m) - 1)]);
}
for (int i = n; ~i; i--) {
ans[i] = min(ans[i], ans[i + 1]);
}
for (int i = 1; i <= n; i++) {
if (ans[L[i][0] - 1] <= R[i][0] + 1) printf("Possible\n");
else printf("Impossible\n");
}
return 0;
} |
#include <cstdio>
#include <iostream>
#define MN 266666
int n, v;
int a[MN];
int f[MN], g[MN];
int b[MN];
int nxt[20][MN];
int lst[20][MN];
int main()
{
scanf("%d%d", &n, &v);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
int x = v;
int m = 0;
while(x) {b[m++] = x / 2; x /= 2;}
b[m] = v;
for(int i = 0; i <= m; i++)
{
lst[i][1] = 1;
for(int j = 2; j <= n; j++)
{
if(a[j] - a[j - 1] <= b[i]) lst[i][j] = lst[i][j - 1];
else lst[i][j] = j;
}
}
int tot = 0;
for(int i = 0; i <= m; i++)
{
nxt[i][n] = n;
for(int j = n - 1; j >= 1; j--)
{
if(a[j + 1] - a[j] <= b[i]) nxt[i][j] = nxt[i][j + 1];
else {nxt[i][j] = j; if(i == m) tot++;}
}
}
if(m < tot)
{
for(int i = 1; i <= n; i++) puts("Impossible");
return 0;
}
for(int S = 0; S < (1 << m); S++) g[S] = n + 1;
for(int S = 0; S < (1 << m); S++)
{
for(int i = 0; i < m; i++)
{
if(!((S >> i) & 1))
{
f[S | (1 << i)] = std::max(f[S | (1 << i)], nxt[i][f[S] + 1]);
g[S | (1 << i)] = std::min(g[S | (1 << i)], lst[i][g[S] - 1]);
}
}
}
for(int i = 1; i <= n; i++)
{
bool ok = 0;
for(int S = 0; S < (1 << m); S++)
{
int T = ((1 << m) - 1) ^ S;
if(f[S] >= i - 1 && g[T] <= nxt[m][i] + 1) {ok = 1; break;}
}
for(int j = i; j <= nxt[m][i]; j++)
{
if(ok) puts("Possible");
else puts("Impossible");
}
i = nxt[m][i];
}
} |
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int x[252521];
int ne[252521][20],rne[252521][20];
int dp[(1<<20)+10],rdp[(1<<20)+10];
vector<int> v;
int main()
{
int n,V;
cin>>n>>V;
rep(i,n) cin>>x[i];
while(V>0){
v.pb(V);V/=2;
}
v.pb(0);int m=v.size();
rep(i,n) rep(j,m){
rne[i][j]=i;
if(i>0 && x[i]-x[i-1]<=v[j]) rne[i][j]=rne[i-1][j];
}
for(int i=n-1;i>=0;i--) rep(j,m){
ne[i][j]=i;
if(i<n-1 && x[i+1]-x[i]<=v[j]) ne[i][j]=ne[i+1][j];
}
memset(dp,0,sizeof(dp));
rep(i,(1<<20)+5) rdp[i]=n-1;
rep(i,(1<<m)) rep(j,m){
if((i&(1<<j))>0) continue;
dp[i+(1<<j)]=max(dp[i+(1<<j)],dp[i]>=n?n:ne[dp[i]][j]+1);
rdp[i+(1<<j)]=min(rdp[i+(1<<j)],rdp[i]<0?-1:rne[rdp[i]][j]-1);
}
//rep(i,(1<<m)) cout<<i<<' '<<dp[i]<<' '<<rdp[i]<<endl;
if(dp[(1<<m)-1]<n){
//assert(dp[(1<<m)-1]<n && rdp[(1<<m)-1]>=0);
rep(i,n) cout<<"Impossible"<<endl;
return 0;
}
int now=0;
while(now<n){
int f=0;
rep(i,(1<<(m-1))){
if(dp[(1<<m)-2-(i<<1)]>=now && rdp[(i<<1)]<=ne[now][0]) f=1;
}
REP(i,now,ne[now][0]+1){
if(f>0) cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
}
now=ne[now][0]+1;
}
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
const int MAXN = 2e6 + 10;
int N, V;
int X[MAXN];
int v[MAXN], vn;
int l[19][MAXN], r[19][MAXN];
int f[MAXN], g[MAXN], h[MAXN];
int main() {
register int s, i, j;
scanf("%d%d", &N, &V);
for(i = 1; i <= N; ++i)
scanf("%d", X + i);
v[0] = V; V >>= 1;
while(V)
v[++vn] = V, V >>= 1;
v[++vn] = 0;
reverse(v, v + vn + 1);
for(i = 0; i <= vn; ++i) {
l[i][1] = 1;
for(j = 2; j <= N; ++j)
l[i][j] = X[j] - X[j - 1] <= v[i] ? l[i][j - 1] : j;
r[i][N] = N;
for(j = N - 1; j; --j)
r[i][j] = X[j + 1] - X[j] <= v[i] ? r[i][j + 1] : j;
}
f[0] = 0; g[0] = N + 1;
for(s = 1; s <= (1 << (vn + 1)) - 1; ++s) {
f[s] = 0; g[s] = N + 1;
for(i = 0; i <= vn; ++i)
if(s & (1 << i)) {
int x = s ^ (1 << i);
f[s] = max(f[s], f[x] == N ? N : r[i][f[x] + 1]);
g[s] = min(g[s], g[x] == 1 ? 1 : l[i][g[x] - 1]);
}
}
for(i = 0; i <= N; ++i)
h[i] = N + 2;
for(i = 0; i <= (1 << vn) - 1; ++i)
h[f[i]] = min(h[f[i]], g[((1 << vn) - 1) ^ i]);
for(i = N - 1; i >= 0; --i)
h[i] = min(h[i], h[i + 1]);
for(i = 1; i <= N; ++i)
puts(h[l[vn][i] - 1] <= r[vn][i] + 1 ? "Possible" : "Impossible");
return 0;
} |
#include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c = getchar();
bool f = false;
for (x = 0; !isdigit(c); c = getchar()) {
if (c == '-') {
f = true;
}
}
for (; isdigit(c); c = getchar()) {
x = x * 10 + c - '0';
}
if (f) {
x = -x;
}
}
template<typename T, typename... U> inline void read(T& x, U& ... y) {
read(x), read(y...);
}
const int N=2e5+10;
int n,V;
int A[N],L[20][N],R[20][N],Fl[1<<20],Fr[1<<20],G[N];
void Calc(int m,int d) {
R[m][n]=n;
for(int i=n-1;i;--i) {
if(A[i+1]-A[i]<=d) R[m][i]=R[m][i+1];
else R[m][i]=i;
}
L[m][1]=1;
for(int i=2;i<=n;++i) {
if(A[i]-A[i-1]<=d) L[m][i]=L[m][i-1];
else L[m][i]=i;
}
}
//#define rua
int main() {
// ios::sync_with_stdio(false);
#ifdef rua
freopen("GG.in","r",stdin);
#endif
read(n,V);
for(int i=1;i<=n;++i) read(A[i]);
int mlog=0;
while(V) Calc(mlog++,V),V>>=1;
Calc(mlog,V);
Fr[0]=n+1;
for(int i=1;i<1<<mlog;++i) {
Fr[i]=n;
for(int j=0;j<mlog;++j) {
if(i>>j&1) {
Fl[i]=max(Fl[i],R[j+1][Fl[i^(1<<j)]+1]);
Fr[i]=min(Fr[i],L[j+1][Fr[i^(1<<j)]-1]);
}
}
}
for(int i=0;i<1<<mlog;++i) {
int l=Fl[i],r=Fr[((1<<mlog)-1)^i];
int a=L[0][r-1],b=R[0][l+1];
if(a<=b) ++G[a],--G[b+1];
}
for(int i=1;i<=n;++i) {
G[i]+=G[i-1];
puts(G[i]?"Possible":"Impossible");
}
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long lint;
int const N=2e5+10;
int const S=1<<19;
int n,V;
lint d[N];
int logV,a[25][N];
int U,f1[S],f2[S];
int upFind(int a[],int x)
{
int L=1,R=a[0];
while(L<R-1)
{
int mid=(L+R)>>1;
if(a[mid]<=x) L=mid+1;
if(a[mid]>x) R=mid;
}
if(a[L]>x) return a[L];
else return a[R];
}
int lowFind(int a[],int x)
{
int L=1,R=a[0];
while(L<R-1)
{
int mid=(L+R)>>1;
if(a[mid]<x) L=mid;
if(a[mid]>=x) R=mid-1;
}
if(a[R]<x) return a[R]+1;
else return a[L]+1;
}
int main()
{
scanf("%d%d",&n,&V);
logV=0;
while((1<<logV)<=V) logV++;
logV++;
for(int i=1;i<=n;i++) scanf("%lld",&d[i]),d[i-1]=d[i]-d[i-1];
d[n]=0;
for(int i=1;i<=logV;i++)
{
a[i][0]=1;
for(int j=1;j<=n;j++)
{
a[i][a[i][0]]=j;
if(d[j]>(V>>(i-1))) a[i][0]++;
}
}
if(a[1][0]>logV)
{
for(int i=1;i<=n;i++) printf("Impossible\n");
return 0;
}
U=(1<<logV)-1;
for(int s=0;s<=U;s++) f1[s]=0,f2[s]=n+1;
for(int s=0;s<=U;s+=2)
for(int i=2;i<=logV;i++)
{
int s0=1<<(i-1);
if(s&s0) continue;
f1[s|s0]=max(f1[s|s0],upFind(a[i],f1[s]));
f2[s|s0]=min(f2[s|s0],lowFind(a[i],f2[s]-1));
}
for(int i=1;i<=a[1][0];i++)
{
bool f=false;
int fr=a[1][i-1]+1,to=a[1][i];
if(i==1) fr=1;
for(int s=0;s<=U&&!f;s+=2)
if(fr<=f1[s]+1 && f2[U-s-1]-1<=to) f=true;
if(f) for(int j=fr;j<=to;j++) printf("Possible\n");
else for(int j=fr;j<=to;j++) printf("Impossible\n");
}
return 0;
} |
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 200005;
int d[maxn], f[524290], g[524290];
int h[20][maxn][2], n, m, i, j, k, LG, b[30], cnt;
inline int solve(int m)
{
if (m == 0)
{
b[0] = 1;
return 1;
}
int nex = solve(m >> 1);
b[nex] = m;
return nex + 1;
}
inline int lower(int x, int t)
{
int l = 1, r = n;
while (l < r - 1)
{
int mid = l + r >> 1;
if (h[t][mid][1] <= x) l = mid;
else r = mid;
}
if (h[t][l][1] > x) return h[t][l][1];
else return h[t][r][1];
}
inline int upper(int x, int t)
{
int l = 1, r = n;
while (l < r - 1)
{
int mid = l + r >> 1;
if (h[t][mid][0] < x) l = mid;
else r = mid;
}
if (h[t][r][0] < x) return h[t][r][0];
else return h[t][l][0];
}
int main()
{
cin >> n >> m;
LG = solve(m);
for(i = 1; i <= n; i ++)
scanf("%d", &d[i]);
for(j = 0; j < LG; j ++)
{
int lim = b[j];
for(i = 1; i <= n;)
{
k = i;
while (d[k + 1] - d[k] <= lim && k + 1 <= n) k ++;
for(int l = i; l <= k; l ++)
h[j][l][0] = i, h[j][l][1] = k;
i = k + 1;
if (j == LG - 1) cnt ++;
}
}
if (cnt >= 19)
{
for(i = 1; i <= n; i ++)
puts("Impossible");
return 0;
}
int all = 1 << LG - 1;
for(int s = 0; s < all; s ++)
g[s] = n + 1;
for(int s = 0; s < all; s ++)
for(i = 0; i < LG - 1; i ++)
if (!(s >> i & 1))
{
int opt = s | (1 << i);
f[opt] = max(f[opt], lower(f[s], i));
g[opt] = min(g[opt], upper(g[s], i));
}
for(i = 1; i <= n;)
{
bool ok = 0;
for(j = all - 1; ; j = (j - 1) & (all - 1))
{
if (f[j] >= i - 1 && g[(all - 1) ^ j] <= h[LG - 1][i][1] + 1) {ok = 1; break;}
if (j == 0) break;
}
for(j = i; j <= h[LG - 1][i][1]; j ++)
if (ok) puts("Possible");
else puts("Impossible");
i = h[LG - 1][i][1] + 1;
}
} |
#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define fill( x, y ) memset( x, y, sizeof x )
#define copy( x, y ) memset( x, y, sizeof x )
using namespace std;
typedef long long LL;
typedef pair < int, int > pa;
const int MAXN = 200020;
const int INF = 0x3f3f3f3f;
int n, m, v[20], tot, a[MAXN], d[MAXN];
int f[MAXN][20], g[MAXN][20];
int dpl[MAXN << 2], dpr[MAXN << 2], ans[MAXN];
int main()
{
#ifdef wxh010910
freopen( "data.in", "r", stdin );
#endif
scanf( "%d%d", &n, &m );
for( int i = 1 ; i <= n ; i++ ) scanf( "%d", &a[ i ] );
while( m ) v[ tot++ ] = m, m >>= 1;
v[ tot++ ] = 0;
d[ 1 ] = d[ n + 1 ] = INF;
for( int i = 2 ; i <= n ; i++ ) d[ i ] = a[ i ] - a[ i - 1 ];
for( int j = 0 ; j < tot ; j++ )
{
for( int i = 1 ; i <= n ; i++ )
if( d[ i ] > v[ j ] ) f[ i ][ j ] = i;
else f[ i ][ j ] = f[ i - 1 ][ j ];
for( int i = n ; i ; i-- )
if( d[ i + 1 ] > v[ j ] ) g[ i ][ j ] = i;
else g[ i ][ j ] = g[ i + 1 ][ j ];
}
fill( dpr, 0x3f );
dpr[ 0 ] = n + 1;
for( int i = 0 ; i < ( 1 << tot ) ; i++ )
for( int j = 0 ; j < tot ; j++ ) if( !( i >> j & 1 ) )
{
if( dpl[ i ] >= n ) dpl[ i | ( 1 << j ) ] = n;
else dpl[ i | ( 1 << j ) ] = max( dpl[ i | ( 1 << j ) ], g[ dpl[ i ] + 1 ][ j ] );
if( dpr[ i ] <= 1 ) dpr[ i | ( 1 << j ) ] = 1;
else dpr[ i | ( 1 << j ) ] = min( dpr[ i | ( 1 << j ) ], f[ dpr[ i ] - 1 ][ j ] );
}
for( int i = 0 ; i < ( 1 << tot ) ; i++ )
{
if( i & 1 ) continue;
int l = dpl[ i ], r = dpr[ ( 1 << tot ) - 1 - i - 1 ];
if( l >= r ) ans[ 1 ]++;
else
{
int L = f[ l + 1 ][ 0 ], R = g[ l + 1 ][ 0 ];
if( R + 1 >= r ) ans[ L ]++, ans[ R + 1 ]--;
}
}
for( int i = 1, cur = 0 ; i <= n ; i++ )
{
cur += ans[ i ];
if( cur ) puts( "Possible" );
else puts( "Impossible" );
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=200005,M=20,L=266666;
int n,m,x[N],U,dp1[L],dp2[L];
int nex[M][N],pre[M][N],sz[M],k;
int mx[N];
void make(int V,int*nx,int*pr){
nx[n]=n;
for(int i=n-1;i>=1;i--)if(x[i+1]-x[i]>V)nx[i]=i;else nx[i]=nx[i+1];
pr[1]=1;
for(int i=2;i<=n;i++)if(x[i]-x[i-1]>V)pr[i]=i;else pr[i]=pr[i-1];
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",&x[i]);
for(int i=m>>1;i>=1;i>>=1)sz[k++]=i;sz[k++]=0;
sz[k]=m;
for(int i=0;i<=k;i++)make(sz[i],nex[i],pre[i]);
U=1<<k;
for(int i=0;i<U;i++)dp1[i]=0,dp2[i]=n+1;
for(int i=0;i<U;i++)for(int j=0;j<k;j++)
if(~i>>j&1){
if(dp1[i]==n)dp1[i|1<<j]=n;
else dp1[i|1<<j]=max(dp1[i|1<<j],nex[j][dp1[i]+1]);
if(dp2[i]==1)dp2[i|1<<j]=1;
else dp2[i|1<<j]=min(dp2[i|1<<j],pre[j][dp2[i]-1]);
}
memset(mx,-1,sizeof(mx));
for(int i=0;i<U;i++){
mx[dp2[i]]=max(mx[dp2[i]],dp1[(U-1)^i]);
}
for(int i=1;i<=n+1;i++)
mx[i]=max(mx[i],mx[i-1]);
for(int i=1;i<=n;i++){
if(mx[nex[k][i]+1]>=pre[k][i]-1)
puts("Possible");
else
puts("Impossible");
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=1000005;
int n,m,x[MAXN],cnt[20];
int l[20][MAXN],r[20][MAXN],f1[MAXN*2],f2[MAXN*2];
bool ans[MAXN];
int uf(int id,int pos){
pos++;
int p=upper_bound(l[id]+1,l[id]+cnt[id]+1,pos)-l[id]-1;
if(p<=0) return pos;
return max(r[id][p],pos-1);
}
int lf(int id,int pos){
pos--;
int p=lower_bound(r[id]+1,r[id]+cnt[id]+1,pos)-r[id];
if(p>=cnt[id]+1) return pos;
return min(l[id][p],pos+1);
}
int main(){
memset(f2,0x3f,sizeof f2);
scanf("%d%d",&n,&m);
int tot=0;
for(tot=0;(1<<tot)<=m;tot++);
for(int i=1;i<=n;i++)
scanf("%d",&x[i]);
x[0]=-INF; x[n+1]=INF;
for(int log=0;log<=tot;log++){
int d=m>>log;
cnt[log]=1;
l[log][1]=1;
for(int i=1;i<=n;i++){
r[log][cnt[log]]=i;
if(x[i+1]-x[i]>d){
cnt[log]++;
l[log][cnt[log]]=i+1;
}
}
cnt[log]--;
}
if(cnt[0]>tot+1){
for(int i=1;i<=n;i++) printf("Impossible\n");
return 0;
}
int sum=(1<<(tot+1));
f1[0]=0,f2[0]=n+1;
for(int s=0;s<sum;s+=2)
for(int i=0;i<=tot;i++){
if(!(s&(1<<i))) continue;
f1[s]=max(f1[s],uf(i,f1[s-(1<<i)]));
f2[s]=min(f2[s],lf(i,f2[s-(1<<i)]));
}
for(int i=1;i<=cnt[0];i++){
int ln=l[0][i],rn=r[0][i];
for(int s1=0;s1<sum;s1+=2){
int s2=sum-1-s1-1;
int lpos=f1[s1];
int rpos=f2[s2];
if(lpos>=ln-1&&rpos<=rn+1){
ans[i]=1;
break;
}
}
}
int pos=1;
for(int i=1;i<=n;i++){
if(ans[pos]) printf("Possible\n");
else printf("Impossible\n");
if(x[i+1]-x[i]>m) pos++;
}
fclose(stdin);
fclose(stdout);
}
|
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-9;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
int n,m,N,S;
vi a,b;
vi ff(int x){
vi c(n);
int I=0;
for(int i=0;i<n-1;i++) if(a[i+1]-a[i]>x){
while(I<=i) c[I++]=i;
}
while(I<n) c[I++]=n-1;
return c;
}
vi f(){
vi dp(S);
vvi c(N);
dp[0]--;
for(int i=0;i<N;i++) c[i]=ff(b[i+1]);
for(int i=0;i<S;i++) for(int j=0;j<N;j++) if(i&1<<j){
int I=dp[i-(1<<j)];
dp[i]=max(dp[i],(I<n-1?c[j][I+1]:n-1));
}
reverse(a.begin(),a.end());
for(int i=0;i<n;i++) a[i]*=-1;
return dp;
}
int main(){
cin>>n>>m;
a=vi(n);
for(auto &i:a) cin>>i;
while(m){
b.push_back(m);
m/=2;
}
b.push_back(0);
N=(int)b.size()-1;
S=1<<N;
vi L=f(),R=f(),c=ff(b[0]),d(n+1);
for(int i=0;i<S;i++){
int l=L[i],r=n-R[S-i-1]-1;
if(r<=l+1) d[0]++;
else if(c[l+1]+1>=r){
d[l+1]++;
d[r]--;
}
}
for(int i=1;i<=n;i++) d[i]+=d[i-1];
for(int i=0;i<n;i++) cout<<(d[i]?"Possible":"Impossible")<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int N,V,M = 19;
int A[200010];
int mem[2][20][2000010];
int dp[2][2000010];
int ans[200010];
int INF = 1001001001;
int unit(int id,int bit)
{
if(!bit)
{
if(id)return 0;
else return N - 1;
}
if(dp[id][bit] != -1)return dp[id][bit];
int res;
if(id)res = 0;
else res = N - 1;
for(int i = 0; i < M; i++)
{
if(bit & (1 << i))
{
if(id)res = max(res,mem[id][i][unit(id,bit - (1 << i))] + 1);
else res = min(res,mem[id][i][unit(id,bit - (1 << i))] - 1);
}
}
return dp[id][bit] = res;
}
int main()
{
scanf("%d%d",&N,&V);
for(int i = 0; i < N; i++)scanf("%d",A + i);
int v = V;
int cnt = 0;
while(V)V /= 2,cnt++;
M = cnt + 1;
for(int i = 0; i < 20; i++)
{
int tmp = 0;
for(int j = 0; j < N; j++)
{
if(j && A[j] - A[j - 1] > v)tmp = j;
mem[0][i][j] = tmp;
}
tmp = N - 1;
for(int j = N - 1; j >= 0; j--)
{
if(j != N - 1 && A[j + 1] - A[j] > v)tmp = j;
mem[1][i][j] = tmp;
}
v /= 2;
}
memset(dp,-1,sizeof(dp));
for(int i = 0; i < (1 << M - 1); i++)
{
int l = unit(1,((1 << M - 1) - 1 << 1) - (i << 1));
int r = unit(0,(i << 1));
if(l > r)
{
for(int j = 0; j < N; j++)printf("Possible\n");
return 0;
}
if(mem[1][0][l] >= r)
{
ans[l]++;
ans[r + 1]--;
}
}
for(int i = 1; i < N; i++)ans[i] += ans[i - 1];
for(int i = 0; i < N; i++)
{
if(ans[i])printf("Possible\n");
else printf("Impossible\n");
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX_N = 200005;
inline void chmax(int &x, int y) {
if (x < y) x = y;
}
inline void chmin(int &x, int y) {
if (x > y) x = y;
}
int prefix[1 << 18], suffix[1 << 18], f[MAX_N];
int L[25][MAX_N], R[25][MAX_N], N, V, val[25], tot, X[MAX_N];
void work(int *l, int *r, int v) {
int last = 1;
l[1] = l[0] = 1;
for (int i = 2; i <= N; ++i) {
if (X[i] - X[i - 1] > v) last = i;
l[i] = last;
}
last = N, r[N] = r[N + 1] = N;
for (int i = N - 1; i >= 1; --i) {
if (X[i + 1] - X[i] > v) last = i;
r[i] = last;
}
}
int main() {
scanf("%d%d", &N, &V);
for (int i = 1; i <= N; ++i)
scanf("%d", &X[i]);
int temp = V;
while (temp) {
val[tot++] = temp;
temp = temp >> 1;
}
val[tot++] = 0;
for (int i = 0; i < tot; ++i)
work(L[i], R[i], val[i]);
int S = (1 << tot - 1) - 1;
for (int i = 1; i <= S; ++i) suffix[i] = N + 1;
prefix[0] = 0, suffix[0] = N + 1;
for (int mask = 0; mask <= S; ++mask) {
for (int j = 1; j < tot; ++j)
if (!(mask & (1 << j - 1))) {
chmax(prefix[mask | (1 << j - 1)], R[j][prefix[mask] + 1]);
chmin(suffix[mask | (1 << j - 1)], L[j][suffix[mask] - 1]);
}
}
memset(f, -1, sizeof f);
for (int mask = 0; mask <= S; ++mask)
chmax(f[suffix[mask]], prefix[S ^ mask]);
for (int i = 1, mx = -1, pos = 1; i <= N; ++i) {
int l = L[0][i], r = R[0][i];
while (pos <= r + 1) chmax(mx, f[pos++]);
if (mx + 1 >= l) puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
#define FR first
#define SE second
using namespace std;
typedef pair<int,int> pii;
const int INF=0x3f3f3f3f;
const int N=200010;
int n,V,X[N],dep=0;
int L[20][N],R[20][N];
int exL[N<<4],exR[N<<4];
pii seg[N];
bool ans[N];
int main()
{
scanf("%d%d",&n,&V);
for(int i=1;i<=n;i++) scanf("%d",X+i);
X[0]=-INF-V-1;X[n+1]=INF+V+1;
for(int v=V;v>=0;v>>=1,dep++)
{
R[dep][n+1]=n+1;
for(int i=1;i<=n;i++) L[dep][i]=(X[i]-X[i-1]<=v)?L[dep][i-1]:i;
for(int i=n;i>=1;i--) R[dep][i]=(X[i+1]-X[i]<=v)?R[dep][i+1]:i;
if(v==0){dep++;break;}
}
for(int i=1;i<=n;i++) seg[i]=pii(L[0][i],R[0][i]);
int cnt=unique(seg+1,seg+1+n)-(seg+1);
for(int i=0;i<(1<<dep);i++) exR[i]=n+1;
for(int s=0;s<(1<<dep);s+=2)
for(int i=0;i<dep;i++)
{
if(!(s&(1<<i))) continue;
exL[s]=max(exL[s],R[i][exL[s^(1<<i)]+1]);
exR[s]=min(exR[s],L[i][exR[s^(1<<i)]-1]);
}
if(cnt>dep) goto output;
for(int i=1;i<=cnt;i++)
for(int s=0;s<(1<<dep);s+=2)
if(exL[s]>=seg[i].FR-1&&exR[(1<<dep)-1-s-1]<=seg[i].SE+1)
{
for(int j=seg[i].FR;j<=seg[i].SE;j++) ans[j]=1;
break;
}
output: for(int i=1;i<=n;i++) puts(ans[i]?"Possible":"Impossible");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N=200010;
int n,m,v[20],x[N],f[N][20],g[N][20],F[1<<20],G[1<<20],ans[1<<20];
void work()
{
scanf("%d %d",&n,&v[0]);
for (int i=1; i<=n; i++) scanf("%d",&x[i]);
for (int t=v[0]; (v[++m]=t/=2); );
x[0]=-int(2e9),x[n+1]=-x[0];
for (int i=n; i; i--)
for (int j=1; j<=m; j++)
if (x[i+1]-x[i]<=v[j]) f[i][j]=f[i+1][j];
else f[i][j]=i;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
if (x[i]-x[i-1]<=v[j]) g[i][j]=g[i-1][j];
else g[i][j]=i;
for (int i=0; i<(1<<m); i++) G[i]=n+1;
for (int i=1; i<(1<<m); i++)
for (int j=1,k; j<=m; j++)
if (i&(1<<(j-1)))
k=i-(1<<(j-1)),F[i]=max(F[i],f[F[k]+1][j]),G[i]=min(G[i],g[G[k]-1][j]);
for (int i=0; i<=n; i++) ans[i]=n+2;
for (int i=0; i<(1<<m); i++) ans[F[i]]=min(ans[F[i]],G[(1<<m)-1-i]);
for (int i=n-1; i>=0; i--) ans[i]=min(ans[i],ans[i+1]);
for (int l,r=1; r<=n; r++)
{
l=r;
while ((r<n)&&(x[r+1]-x[r]<=v[0])) r++;
for (int i=l; i<=r; i++)
puts(ans[l-1]<=r+1?"Possible":"Impossible");
}
}
int main()
{
work();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=600005;
int a[N],L[25][N],R[25][N],f[N],g[N],S[N];
int main()
{
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
ios::sync_with_stdio(false);
int n,m,k,cnt=0;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(i!=1&&a[i]-a[i-1]>m) ++cnt;
}
k=log2(m)+2;
// cout<<k<<endl;
if(cnt>k)
{
for(int i=1;i<=n;i++) cout<<"Impossible"<<endl;
return 0;
}
int s=m;
for(int i=0;i<k;i++)
{
L[i][1]=1;
R[i][n]=n;
for(int j=2;j<=n;j++)
{
if(a[j]-a[j-1]>s) L[i][j]=j;
else L[i][j]=L[i][j-1];
}
for(int j=n-1;j>=1;j--)
{
if(a[j+1]-a[j]>s) R[i][j]=j;
else R[i][j]=R[i][j+1];
}
s/=2;
}
/*for(int i=0;i<k;i++)
{
for(int j=1;j<=n;j++) cout<<L[i][j]<<" ";
cout<<endl;
for(int j=1;j<=n;j++) cout<<R[i][j]<<" ";
cout<<endl;
}
cout<<endl;*/
for(int i=0;i<(1<<k);i++)
{
f[i]=0;
g[i]=n+1;
}
for(int i=0;i<(1<<(k-1));i++)
{
for(int j=1;j<k;j++)
{
if(!(i&(1<<(j-1))))
{
if(f[i]==n) f[i|(1<<(j-1))]=n;
else f[i|(1<<(j-1))]=max(f[i|(1<<(j-1))],R[j][f[i]+1]);
if(g[i]==1) g[i|(1<<(j-1))]=1;
else g[i|(1<<(j-1))]=min(g[i|(1<<(j-1))],L[j][g[i]-1]);
}
}
}
/* for(int i=0;i<(1<<(k-1));i++) cout<<f[i]<<" ";
cout<<endl;
for(int i=0;i<(1<<(k-1));i++) cout<<g[i]<<" ";
cout<<endl;*/
for(int i=0;i<=n;i++) S[i]=0x7f7f7f7f;
for(int i=0;i<(1<<(k-1));i++)
{
// cout<<i<<" "<<(1<<(k-1))<<" "<<((1<<(k-1))^i)<<endl;
S[f[i]]=min(S[f[i]],g[((1<<(k-1))-1)^i]);
}
// for(int i=0;i<=n;i++) cout<<S[i]<<" ";
// cout<<endl;
for(int i=n-1;i>=0;i--) S[i]=min(S[i],S[i+1]);
// for(int i=0;i<=n;i++) cout<<S[i]<<" ";
// cout<<endl;
for(int i=1;i<=n;i++)
{
if(S[L[0][i]-1]<=R[0][i]+1) cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
}
return 0;
}
|
#include <cstdio>
#define ref(i,x,y)for(int i=x;i<=y;++i)
#define def(i,x,y)for(int i=x;i>=y;--i)
const int N=200001;
int n,m,v,a[N],b[N],pl[19][N],pr[19][N],fl[1<<18],fr[1<<18];
void updmax(int&a,int b){if(b>a)a=b;}
void updmin(int&a,int b){if(b<a)a=b;}
int main(){
scanf("%d%d",&n,&v);
ref(i,1,n)scanf("%d",&a[i]);
ref(i,0,18){
pl[i][1]=1;pr[i][n]=n;
pl[i][0]=1;pr[i][n+1]=n;
ref(j,1+1,n)if(a[j]-a[j-1]<=v)pl[i][j]=pl[i][j-1];else pl[i][j]=j;
def(j,n-1,1)if(a[j+1]-a[j]<=v)pr[i][j]=pr[i][j+1];else pr[i][j]=j;
if(!v){m=i;break;}
v>>=1;
}
ref(i,0,(1<<m)-1)fl[i]=0,fr[i]=n+1;
ref(i,0,(1<<m)-1)ref(j,1,m)if(!(i>>j-1&1)){
int I=i|(1<<j-1);
updmax(fl[I],pr[j][fl[i]+1]);
updmin(fr[I],pl[j][fr[i]-1]);
}
ref(i,0,(1<<m)-1)if(pr[0][fl[i]+1]>=fr[((1<<m)-1)^i]-1)
b[pr[0][fl[i]+1]]=1;
ref(i,1,n)if(b[pr[0][i]])printf("Possible\n");
else printf("Impossible\n");
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <assert.h>
#include <algorithm>
using namespace std;
struct P{
int S,w;
P(){}
P(int a,int b){S=a;w=b;}
}G[1000005];
int n,v,m,a[200005],len[25],L[200005][25],R[200005][25],f[1000005],g[1000005];
priority_queue<P> q;
bool cmp(P a,P b){
return a.w<b.w;
}
bool operator <(P a,P b){
return a.w<b.w;
}
int main(){
scanf("%d%d",&n,&v);
while(v) len[m++]=v,v>>=1;len[m++]=0;
for(int i=0;i<m/2;i++) swap(len[i],len[m-i-1]);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++){
for(int p=0;p<m;p++){
L[i][p]=L[i-1][p];
if(i==1||a[i]-a[i-1]>len[p]) L[i][p]=i;
}
}
for(int i=n;i;i--){
for(int p=0;p<m;p++){
R[i][p]=R[i+1][p];
if(i==n||a[i+1]-a[i]>len[p]) R[i][p]=i;
}
}
f[0]=0;g[0]=n+1;
for(int i=1;i<(1<<m);i++){
g[i]=n+1;
for(int p=0;p<m;p++) if(i&(1<<p)){
f[i]=max(f[i],f[i^(1<<p)]);
f[i]=max(f[i],R[f[i^(1<<p)]+1][p]);
g[i]=min(g[i],L[g[i^(1<<p)]-1][p]);
}
}
int S=(1<<m-1)-1;
for(int i=0;i<=S;i++) G[i]=P(i,g[i]);
sort(G,G+S+1,cmp);
for(int i=1,pos=0;i<=n;i++){
while(G[pos].w<=R[i][m-1]+1&&pos<=S) q.push(P(S^G[pos].S,f[S^G[pos].S])),pos++;
if(q.empty()||q.top().w<L[i][m-1]-1) puts("Impossible");
else puts("Possible");
}
return 0;
} |
#include <queue>
#define OK puts("Possible")
#define NO puts("Impossible")
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
template <typename T>
void read(T &x) {
x = 0; bool f = 0;
char c = getchar();
for (;!isdigit(c);c=getchar()) if (c=='-') f=1;
for (;isdigit(c);c=getchar()) x=x*10+(c^48);
if (f) x=-x;
}
const int N = 200500;
int f[N<<1][24], n, v;
int x[N], R[N][24], D[100], LG;
vector<int> to;
inline int T(int x) { return 1 << x; }
inline void Mx(int &x, int y) { y > x && (x = y); }
int main() {
read(n), read(v);
for (int i = 1;i <= n; i++) read(x[i]);
while (v) D[LG++] = v, v >>= 1; LG++;
for (int i = 0;i < LG; i++) {
R[n+1][i] = R[n][i] = n;
if (i == 0) to.push_back(n);
for (int j = n - 1;j >= 1; j--)
if (x[j+1] - x[j] <= D[i]) R[j][i] = R[j+1][i];
else {
R[j][i] = j; if (i == 0) to.push_back(j);
}
}
if (to.size() > LG) { for (int i = 1;i <= n; i++) NO; return 0; }
if (to.size() == 1) { for (int i = 1;i <= n; i++) OK; return 0; }
LG--; int all = (1 << LG) - 1;
for (int i = 0;i <= all; i++) {
for (int j = 0;j < to.size(); j++) {
if (R[f[i][j]+1][0] == to[j]) f[i][j] = to[j];
for (int k = 1;k <= LG; k++) {
if (i & T(k-1)) continue;
Mx(f[i | T(k-1)][j], R[f[i][j]+1][k]);
}
}
}
int block = to.size() - 1;
for (int i = 1;i <= n; i++) {
f[all][block] == n ? OK : NO;
if (to[block] == i) block--;
}
return 0;
} |
#include <bits/stdc++.h>
#define FI(i,a,b) for(int i=(a);i<=(b);i++)
#define FD(i,a,b) for(int i=(a);i>=(b);i--)
#define LL long long
#define Ldouble long double
#define PI 3.1415926535897932384626
#define PII pair<int,int>
#define PLL pair<LL,LL>
#define mp make_pair
#define fi first
#define se second
using namespace std;
int n, v, s[200005], pt, previous_pt = 1, p;
int fr[200005][20], dv[20];
void gen(int l, int r, int V){
// printf("[%d %d %d]\n", l, r, V);
FI(i, l, r){
if(V) printf("Possible\n");
else printf("Impossible\n");
}
return;
}
int dp[1111111];
bool res(int X){
FI(i, 0, (1 << p + 1) - 1) dp[i] = -1;
dp[0] = 0;
FI(i, 0, (1 << p + 1) - 1){
if(dp[i] == -1) continue;
FI(j, 0, p){
if(i & (1 << j)){}
else{
if(j == 0 && dp[i] + 1 != X) continue;
if(j != 0 && dp[i] + 1 == X) continue;
dp[i + (1 << j)] = max(dp[i + (1 << j)], fr[dp[i] + 1][j]);
}
}
}
FI(i, 0, (1 << p + 1) - 1) if(dp[i] == n) return true;
return false;
}
int main(){
scanf("%d %d", &n, &v);
FI(i, 1, n) scanf("%d", &s[i]);
FI(i, 2, n) if(s[i] - s[i - 1] > v) pt++;
dv[0] = v;
while(dv[p]){
dv[p + 1] = dv[p];
dv[++p] /= 2;
}
FI(i, 0, p){
int q = 1;
FI(j, 1, n){
q = max(q, j);
while(q < n && s[q + 1] - s[q] <= dv[i]) q++;
fr[j][i] = q;
}
fr[n + 1][i] = n;
}
if(pt >= 20){
FI(i, 1, n) printf("Impossible\n");
return 0;
}
FI(i, 2, n) if(s[i] - s[i - 1] > v){
gen(previous_pt, i - 1, res(previous_pt));
previous_pt = i;
}
gen(previous_pt, n, res(previous_pt));
return 0;
}
|
/*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
#define pii pair<int,int>
#define fst first
#define scd second
#define mp make_pair
using namespace std;
const int inf=0x3f3f3f3f;
const int Maxn=(1<<19)+5;
const int N=2e5+5;
const int M=20;
int read(){
int s=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){s=s*10+c-'0';c=getchar();}
return s*f;
}
pii P[N];
int n,V,cnt,tot,Sta,a[N],L[M][N],R[M][N],Ans[N],FL[Maxn],FR[Maxn];
int main(){
// freopen("_.in","r",stdin);
// freopen("_.out","w",stdout);
n=read();V=read();
for(int i=1;i<=n;i++)a[i]=read();a[0]=-inf;a[n+1]=inf;
for(int v=V;;v>>=1){
tot++;L[tot][0]=0;R[tot][n+1]=n+1;
for(int i=1;i<=n;i++)L[tot][i]=(a[i]-a[i-1]<=v?L[tot][i-1]:i);
for(int i=n;i>=1;i--)R[tot][i]=(a[i+1]-a[i]<=v?R[tot][i+1]:i);
if(v==0)break;
}
Sta=(1<<tot)-1;
for(int i=1;i<=n;i++)P[i]=mp(L[1][i],R[1][i]);
sort(P+1,P+n+1);cnt=unique(P+1,P+n+1)-P-1;
for(int S=0;S<=Sta;S++){FL[S]=0;FR[S]=n+1;}
for(int S=0;S<=Sta;S+=2){
for(int i=1;i<=tot;i++){
if(!((S>>(i-1))&1))continue;
FL[S]=max(FL[S],R[i][FL[S^(1<<(i-1))]+1]);
FR[S]=min(FR[S],L[i][FR[S^(1<<(i-1))]-1]);
}
}
if(cnt>tot){for(int i=1;i<=tot;i++)puts("Impossible");return 0;}
for(int i=1;i<=cnt;i++){
for(int S=0;S<=Sta;S+=2){
if(FL[S]>=P[i].fst-1&&FR[Sta^S^1]<=P[i].scd+1){
for(int j=P[i].fst;j<=P[i].scd;j++)Ans[j]=1;
break;
}
}
}
for(int i=1;i<=n;i++)puts(Ans[i]?"Possible":"Impossible");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int N, V;
cin >> N >> V;
vector<int> X(N);
for (int i = 0; i < N; ++i) cin >> X[i];
vector<int> vs = {V};
while (vs.back()) vs.emplace_back(vs.back() / 2);
reverse(vs.begin(), vs.end());
int sz = int(vs.size()) - 1;
vector<vector<int>> L(sz + 1, vector<int>(N));
vector<vector<int>> R(sz + 1, vector<int>(N));
for (int i = 0; i <= sz; ++i) {
L[i][0] = 0;
for (int j = 1; j < N; ++j) {
if (X[j] - X[j - 1] <= vs[i]) L[i][j] = L[i][j - 1];
else L[i][j] = j;
}
R[i][N - 1] = N - 1;
for (int j = N - 2; j >= 0; --j) {
if (X[j + 1] - X[j] <= vs[i]) R[i][j] = R[i][j + 1];
else R[i][j] = j;
}
}
vector<int> forw(1 << sz, -1);
vector<int> backw(1 << sz, N);
for (int mask = 0; mask < (1 << sz); ++mask) {
for (int i = 0; i < sz; ++i) if (!(mask & (1 << i))) {
int nmask = mask | (1 << i);
forw[nmask] = max(forw[nmask], R[i][min(forw[mask] + 1, N - 1)]);
backw[nmask] = min(backw[nmask], L[i][max(backw[mask] - 1, 0)]);
}
}
vector<int> cnt(N);
for (int mask = 0; mask < (1 << sz); ++mask) {
int lv = forw[mask];
int rv = backw[mask ^ ((1 << sz) - 1)];
int low = L[sz][max(rv - 1, 0)];
int high = R[sz][min(lv + 1, N - 1)];
if (low <= high) {
++cnt[low];
if (high + 1 < N) --cnt[high + 1];
}
}
for (int i = 0; i < N; ++i) {
if (i) cnt[i] += cnt[i - 1];
cout << (cnt[i] ? "Possible" : "Impossible") << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define x first
#define y second
int n, v;
int x[200010];
int hn;
int gl[20][200010];
int gr[20][200010];
void in(){
read(n, v);
for(int i=1; i<=n; ++i) read(x[i]);
}
void build(){
for(;;++hn, v/=2){
for(int i=1; i<=n;){
int j;
for(j=i+1; j<=n && x[j]-x[j-1] <= v; ++j);
for(int k=i; k<j; ++k){
gl[hn][k]=i;
gr[hn][k]=j-1;
}
i=j;
}
if(v == 0) break;
}
}
int dpL[524288];
int dpR[524288];
void do_dp(){
int M = (1<<hn);
for(int i=0; i<M; ++i){
dpL[i] = 0;
dpR[i] = n+1;
for(int j=1; j<=hn; ++j){
int key = (1 << (j-1));
if(i & key){
int bl=dpL[i^key], br=dpR[i^key];
dpL[i] = max(dpL[i], bl == n ? n : gr[j][bl+1]);
dpR[i] = min(dpR[i], br == 1 ? 1 : gl[j][br-1]);
}
}
}
}
bool all_yes;
bool yes[200010];
void apply_gugan(int a, int b){
if(a > b){
all_yes = true;
} else {
if(gl[0][a] == gl[0][b]){
yes[gl[0][a]]=1;
}
}
}
void Fill(){
int M = (1<<hn);
for(int i=1; i<M; ++i){
dpL[i] = max(dpL[i], dpL[i&(i-1)]);
dpR[i] = min(dpR[i], dpR[i&(i-1)]);
}
for(int i=0; i<M; ++i){
int l=dpL[i]+1;
int r=dpR[(M-1)^i]-1;
apply_gugan(l, r);
}
}
int main()
{
in(); build(); do_dp(); Fill();
for(int i=1; i<=n; ++i){
puts((all_yes || yes[gl[0][i]])?"Possible":"Impossible");
}
return 0;
}
|
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int x[252521];
int ne[252521][20],rne[252521][20];
int dp[(1<<20)+10],rdp[(1<<20)+10];
vector<int> v;
int main()
{
int n,V;
cin>>n>>V;
rep(i,n) cin>>x[i];
while(V>0){
v.pb(V);V/=2;
}
v.pb(0);int m=v.size();
rep(i,n) rep(j,m){
rne[i][j]=i;
if(i>0 && x[i]-x[i-1]<=v[j]) rne[i][j]=rne[i-1][j];
}
for(int i=n-1;i>=0;i--) rep(j,m){
ne[i][j]=i;
if(i<n-1 && x[i+1]-x[i]<=v[j]) ne[i][j]=ne[i+1][j];
}
memset(dp,0,sizeof(dp));
rep(i,(1<<20)+5) rdp[i]=n-1;
rep(i,(1<<m)) rep(j,m){
if((i&(1<<j))>0) continue;
dp[i+(1<<j)]=max(dp[i+(1<<j)],ne[dp[i]][j]+1);
rdp[i+(1<<j)]=min(rdp[i+(1<<j)],rne[rdp[i]][j]-1);
}
//rep(i,(1<<m)) cout<<i<<' '<<dp[i]<<' '<<rdp[i]<<endl;
if(rdp[(1<<m)-1]>=0){
//assert(dp[(1<<m)-1]<n && rdp[(1<<m)-1]>=0);
rep(i,n) cout<<"Impossible"<<endl;
return 0;
}
int now=0;
while(now<n){
int f=0;
rep(i,(1<<(m-1))){
if(dp[(1<<m)-2-(i<<1)]>=now && rdp[(i<<1)]<=ne[now][0]) f=1;
}
REP(i,now,ne[now][0]+1){
if(f>0) cout<<"Possible"<<endl;
else cout<<"Impossible"<<endl;
}
now=ne[now][0]+1;
}
}
|
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#define For(i,x,y) for (int i=x;i<y;i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lf else if
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> Vi;
int IN(){
int c,f,x;
while (!isdigit(c=getchar())&&c!='-');c=='-'?(f=1,x=0):(f=0,x=c-'0');
while (isdigit(c=getchar())) x=(x<<1)+(x<<3)+c-'0';return !f?x:-x;
}
const int N=200000+19;
int f[1<<20],g[1<<20];
int x[N],A[20][N],B[20][N];
int n,V,pV,mx;
int main(){
n=IN(),pV=V=IN();
For(i,1,n+1) x[i]=IN();
for (mx=0;;mx++){
int sum=0;
for (int l=1,r;l<=n;l=r+1){
for (r=l;r+1<=n&&x[r+1]-x[r]<=V;r++);
For(i,l,r+1) A[mx][i]=r,B[mx][i]=l;
sum++;
}
if (mx==0&&sum>20){
For(i,1,n+1) puts("Impossible");
return 0;
}
if (V==0) break;
V/=2;
}
For(t,0,1<<mx){
f[t]=0;
g[t]=n+1;
}
For(t,0,1<<mx){
For(i,0,mx) if (!(t>>i&1)){
f[t|1<<i]=max(f[t|1<<i],A[i+1][f[t]+1]);
g[t|1<<i]=min(g[t|1<<i],B[i+1][g[t]-1]);
}
}
V=pV;
for (int l=1,r;l<=n;l=r+1){
bool chk=0;
for (r=l;r+1<=n&&x[r+1]-x[r]<=V;r++);
For(t,0,1<<mx){
if (f[t]>=l-1&&g[((1<<mx)-1)^t]<=r+1) chk=1;
}
For(i,l,r+1) puts(chk?"Possible":"Impossible");
}
} |
#include <bits/stdc++.h>
const int maxn = 1 << 18;
int n, m, M, v[20], f[maxn + 10], g[maxn + 10], x[maxn + 10], y[maxn + 10], z[maxn + 10], LOG[maxn + 10], ans[maxn + 10], fy[maxn + 10][20], fz[maxn + 10][20];
void chkmax(int &x, int y) {
(x < y) && (x = y);
return;
}
void chkmin(int &x, int y) {
(x > y) && (x = y);
return;
}
int main() {
scanf("%d%d", &n, v);
while(v[m]) {
v[m + 1] = v[m] >> 1;
++m;
}
v[m] = v[0];
v[0] = 0;
M = 1 << m;
for (int i = 2; i < M; ++i) {
LOG[i] = LOG[i >> 1] + 1;
}
for (int i = 1; i <= n; ++i) {
scanf("%d", x + i);
z[i] = y[i - 1] = x[i] - x[i - 1];
}
for (int i = 0; i <= m; ++i) {
int lst = n;
fy[n][i] = n;
for (int j = n - 1; j; --j) {
if(y[j] > v[i]) {
lst = j;
}
fy[j][i] = lst;
}
lst = 1;
fz[1][i] = 1;
for (int j = 2; j <= n; ++j) {
if(z[j] > v[i]) {
lst = j;
}
fz[j][i] = lst;
}
}
for (int s = 0; s < M; ++s) {
g[s] = n + 1;
}
for (int s = 1; s < M; ++s) {
int t = s;
while(t) {
int x = (t & (-t)), i = LOG[x], y = s ^ x, j = f[y];
chkmax(f[s], j == n ? n : fy[j + 1][i]);
j = g[y];
chkmin(g[s], j == 1 ? 1 : fz[j - 1][i]);
t ^= x;
}
}
for (int s = 0; s < M; ++s) {
int t = M - 1 ^ s;
int l = f[s] + 1, r = g[t] - 1;
if(l >= r) {
for (int i = 1; i <= n; ++i) {
puts("Possible");
}
return 0;
}
int i = fy[l][m];
if(i >= r) {
++ans[l];
--ans[r + 1];
}
}
for (int i = 1; i <= n; ++i) {
ans[i] += ans[i - 1];
puts(ans[i] ? "Possible" : "Impossible");
}
return 0;
} |
//by xiqiao
#include<bits/stdc++.h>
#define maxn 200005
using namespace std;
typedef long long ll;
int n;
int l[maxn][30],r[maxn][30];
int a[maxn];
void pre_work(int wh,int v){
l[0][wh]=0;l[1][wh]=0;
for(int i=2;i<=n;i++){
if(a[i-1]-a[i-2]<=v)l[i][wh]=l[i-1][wh];
else l[i][wh]=i-1;
}
r[n][wh]=n;r[n-1][wh]=n;
for(int i=n-2;i>=0;i--){
if(a[i+1]-a[i]<=v)r[i][wh]=r[i+1][wh];
else r[i][wh]=i+1;
}
}
int f[maxn*3],f2[maxn*3];
int main(){
//freopen("1.in","r",stdin);
int V;
scanf("%d%d",&n,&V);
for(int i=0;i<n;i++)scanf("%d",&a[i]);
int g=0;
for(int x=V;x;x>>=1){
pre_work(g++,x);
}
pre_work(g++,0);
for(int i=0;i<(1<<g);i++)f[i]=0;
for(int i=0;i<(1<<g);i++){
for(int j=0;j<g;j++){
if((1<<j)&i)continue;
f[i|(1<<j)]=max(f[i|(1<<j)],r[f[i]][j]);
}
}
for(int i=0;i<(1<<g);i++)f2[i]=n;
for(int i=0;i<(1<<g);i++){
for(int j=0;j<g;j++){
if((1<<j)&i)continue;
f2[i|(1<<j)]=min(f2[i|(1<<j)],l[f2[i]][j]);
}
}
if(f[(1<<g)-1]<n){
for(int i=0;i<n;i++)puts("Impossible");
return 0;
}
int L,R;L=1;
for(L=0;L<n;L=R){
bool ok=0;R=r[L][0];
for(int j=0;j<(1<<g);j++){
if(j&1)continue;
if(f[j]>=L && f2[(1<<g)-2-j]<=R){
ok=1;break;
}
}
for(int j=L;j<R;j++){
if(!ok)puts("Impossible");
else puts("Possible");
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n, v, num[200007], val[20], l, tl[200007][20], tr[200007][20], dp1[500007], dp2[500007], s;
int mn[200007];
int read()
{
int num = 0, f = 1;
char c = getchar();
while ((c < '0' || c>'9') && c != '-')c = getchar();
if (c == '-')f = -1, c = getchar();
while (c >= '0' && c <= '9')num = num * 10 + c - '0', c = getchar();
return num * f;
}
int main()
{
n = read();
v = read();
for (int i = 1; i <= n; i++)
num[i] = read();
while (v >> l)l++;
val[l] = v;
for (int i = l - 1; i >= 0; i--)
val[i] = (val[i + 1] >> 1);
for (int i = 0; i <= l; i++)
tl[1][i] = 1;
for (int i = 2; i <= n; i++)
for (int j = 0; j <= l; j++)
if (num[i] - num[i - 1] > val[j])
tl[i][j] = i;
else tl[i][j] = tl[i - 1][j];
for (int i = 0; i <= l; i++)
tr[n][i] = n;
for (int i = n - 1; i >= 1; i--)
for (int j = 0; j <= l; j++)
if (num[i + 1] - num[i] > val[j])
tr[i][j] = i;
else tr[i][j] = tr[i + 1][j];
for (int i = 0; i < (1 << l); i++)
for (int j = 0; j < l; j++)
if (!((i >> j) & 1))
dp1[i ^ (1 << j)] = max(dp1[i ^ (1 << j)], dp1[i] == n ? n : tr[dp1[i] + 1][j]);
memset(dp2, 0x3f3f3f, sizeof dp2);
dp2[0] = n + 1;
for (int i = 0; i < (1 << l); i++)
for (int j = 0; j < l; j++)
if (!((i >> j) & 1))
dp2[i ^ (1 << j)] = min(dp2[i ^ (1 << j)], dp2[i] == 1 ? 1 : tl[dp2[i] - 1][j]);
s = (1 << l) - 1;
memset(mn, 0x3f3f3f, sizeof mn);
for (int i = 0; i <= s; i++)
mn[dp1[i]] = min(mn[dp1[i]], dp2[i ^ s]);
for (int i = n; i >= 0; i--)
mn[i] = min(mn[i], mn[i + 1]);
for (int i = 1; i <= n; i++)
if (mn[tl[i][l] - 1] <= tr[i][l] + 1)
printf("Possible\n");
else printf("Impossible\n");
return 0;
} |
//2018-1-18
//miaomiao
//
#include <bits/stdc++.h>
using namespace std;
#define Set(a, v) memset(a, v, sizeof(a))
#define For(i, a, b) for(int i = (a); i <= (int)(b); ++i)
#define M 18
#define N (200000+5)
int n, m, dn, pos[N], dis[M], nxt[N][M], beg[N], endd[N];
int f[1<<M];
bool Solve(int l, int r){
if(l == 1 && r == n) return true;
f[0] = 0;
int tmp;
For(i, 1, (1<<dn)-1){
f[i] = 0;
For(j, 1, dn) if(i & (1<<(j-1))){
tmp = f[i ^ (1<<(j-1))] + 1;
if(tmp >= l && tmp <= r) tmp = r+1;
f[i] = max(f[i], nxt[tmp][j]);
if(f[i]+1 >= l && f[i]+1 <= r) f[i] = r;
}
if(f[i] >= n) return true;
}
return false;
}
int main(){
scanf("%d%d", &n, &m);
For(i, 1, n) scanf("%d", &pos[i]);
int st, ed, cnt = 0;
for(int d = m; d >= 0; d >>= 1){
st = 1; if(d != m) dis[++dn] = d;
while(st <= n){
ed = st;
while(ed < n && pos[ed+1]-pos[ed] <= d) ++ed;
For(i, st, ed) nxt[i][dn] = ed;
if(d == m){
beg[++cnt] = st; endd[cnt] = ed;
}
st = ed+1;
}
if(!d) break;
}
For(i, 1, dn) nxt[n+1][i] = n+1;
// For(i, 1, n) For(j, 1, dn) printf("nxt[%d][%d] = %d\n", i, j, nxt[i][j]);
if(cnt > dn+1){
For(i, 1, n) puts("Impossible"); return 0;
}
For(si, 1, cnt){
// printf("%d -> %d free\n", beg[si], end[si]);
if(Solve(beg[si], endd[si])){
For(i, beg[si], endd[si]) puts("Possible");
}else{
For(i, beg[si], endd[si]) puts("Impossible");
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define uint unsigned
#define PI pair<int,int>
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline int read(){
int x = 0; char ch = gc(); bool positive = 1;
for (; !isdigit(ch); ch = gc()) if (ch == '-') positive = 0;
for (; isdigit(ch); ch = gc()) x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(int a){
if(a<0){
a=-a; putchar('-');
}
if(a>=10)write(a/10);
putchar('0'+a%10);
}
inline void writeln(int a){
if(a<0){
a=-a; putchar('-');
}
write(a); puts("");
}
inline int rnd(int x){
return rand()%x;
}
inline ull rnd(){
return ((ull)rand()<<30^rand())<<4|rand()%4;
}
const int M=20,N=1<<M,inf=1e9+3e5;
int n,v,gao,f[1<<M],g[1<<M],x[N],lst[M][N],nxt[M][N],tong[N];
int main(){
n=read(); v=read(); x[0]=-inf; x[n+1]=inf;
for(int i=1;i<=n;i++)x[i]=read();
for(int i=0;;i++){
int dali=v>>i; gao=i; nxt[i][n+1]=n; lst[i][0]=1;
for(int j=1;j<=n;j++)if(x[j]-x[j-1]<=dali)lst[i][j]=lst[i][j-1]; else lst[i][j]=j;
for(int j=n;j;j--)if(x[j+1]-x[j]<=dali)nxt[i][j]=nxt[i][j+1]; else nxt[i][j]=j;
if((v>>i)==0)break;
}
f[0]=0; g[0]=n+1;
for(int i=1;i<(1<<gao);i++){
f[i]=0; g[i]=n+1;
for(int j=0;j<gao;j++)if(i>>j&1)f[i]=max(f[i],nxt[j+1][f[i^(1<<j)]+1]);
for(int j=0;j<gao;j++)if(i>>j&1)g[i]=min(g[i],lst[j+1][g[i^(1<<j)]-1]);
}
for(int i=0;i<=n+1;i++)tong[i]=-1;
for(int i=0;i<(1<<gao);i++){
int l=f[i],r=g[((1<<gao)-1)^i];
tong[r]=max(tong[r],l);
}
for(int i=1;i<=n;i++)tong[i]=max(tong[i],tong[i-1]);
for(int i=1;i<=n;i++){
int l=lst[0][i],r=nxt[0][i];
puts(tong[r+1]>=l-1?"Possible":"Impossible");
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
template<class T>
void selectMin(T & x, const T & y)
{
if (x > y)
x = y;
}
template<class T>
void selectMax(T & x, const T & y)
{
if (x < y)
x = y;
}
const int MAXN = 2e5 + 10;
const int MAXLOG = 20 + 5;
const int PINF = 0x3F3F3F3F;
const char NSOL[] = "Impossible";
const char FSOL[] = "Possible";
int N, V;
int lg2 = -1;
int exp_2[MAXLOG];
int R[MAXLOG][MAXN];
int cnt[MAXLOG];
int dp1[MAXN << 3], dp2[MAXN << 3];
int A[MAXN];
void prepare()
{
exp_2[0] = 1;
for (int i = 1; i < MAXLOG; i++)
exp_2[i] = exp_2[i - 1] * 2;
}
int main()
{
prepare();
cin >> N >> V;
for (int i = 1; i <= N; i++)
cin >> A[i];
int x = V * 2;
while (x)
{
x /= 2, lg2++;
// Split segments
for (int i = 1; i < N; i++)
{
if (A[i + 1] - A[i] <= x)
continue;
R[lg2][++cnt[lg2]] = i;
}
R[lg2][++cnt[lg2]] = N;
}
if (cnt[0] > lg2 + 1)
{
for (int i = 1; i <= N; i++)
puts(NSOL);
return 0;
}
for (int s = 0; s < exp_2[lg2]; s++)
dp2[s] = N + 1;
for (int s = 0; s < exp_2[lg2]; s++)
for (int i = 1; i <= lg2; i++)
{
if (s & exp_2[i - 1])
continue;
selectMax(dp1[s | exp_2[i - 1]],
*upper_bound(R[i] + 1, R[i] + cnt[i] + 1, dp1[s]));
selectMin(dp2[s | exp_2[i - 1]],
R[i][lower_bound(R[i] + 1, R[i] + cnt[i] + 1, dp2[s] - 1)
- R[i] - 1] + 1);
}
for (int i = 1; i <= cnt[0]; i++)
{
bool solution = false;
for (int s = 0; s < exp_2[lg2]; s++)
if (dp1[s] >= R[0][i - 1] && dp2[exp_2[lg2] - s - 1] <= R[0][i] + 1)
{
solution = true;
break;
}
for (int j = R[0][i - 1] + 1; j <= R[0][i]; j++)
puts(solution ? FSOL : NSOL);
}
}
|
#include <cstdio>
#include <algorithm>
#include <cctype>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 262144+5;
int n, m, v, p[N], l[20][N], r[20][N];
int d[N], f[N], g[N];
void func(int v, int *l, int *r)
{
l[1] = 1, r[n] = n;
for(int i = 2; i <= n; ++i) l[i] = p[i]-p[i-1] <= v?l[i-1]:i;
for(int i = n-1; i; --i) r[i] = p[i+1]-p[i] <= v?r[i+1]:i;
l[0] = 1, r[n+1] = n;
}
void pusha(int l, int r) { if(l <= r) ++d[l], --d[r+1]; }
int main()
{
n = read(), v = read();
for(int i = 1; i <= n; ++i) p[i] = read();
for( ; v; ++m, v >>= 1) func(v, l[m], r[m]); func(0, l[m], r[m]);
g[0] = n+1;
for(int s = 1; s < 1<<m; ++s)
{
g[s] = n;
for(int i = 0; i < m; ++i)
if(s>>i&1) f[s] = max(f[s], r[i+1][f[s^(1<<i)]+1]), g[s] = min(g[s], l[i+1][g[s^(1<<i)]-1]);
}
for(int s = 0; s < 1<<m; ++s) pusha(l[0][g[s^((1<<m)-1)]-1], r[0][f[s]+1]);
for(int i = 1; i <= n; ++i) d[i] += d[i-1], puts(d[i]?"Possible":"Impossible");
return 0;
} |
#include<bits/stdc++.h>
#include<vector>
#define N 200005
using namespace std;
vector<int> G[N];
int n,m,v,a[N],r[20][N],f[1<<20],g[1<<20],ufs[20][N];
int find(int op,int x){ return ufs[op][x] ? ufs[op][x]=find(op,ufs[op][x]) : x;}
int main()
{
int i,j,x,p,y,T;
scanf("%d %d",&n,&v);
for(i=v,m=0;i;i>>=1,m++);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=0;i<=m;i++){
for(j=1;j<=n;j++) r[i][j]=j;
for(j=1;j<n;j++)
if(a[j+1]-a[j]<=(v>>i))
x=find(i,j),ufs[i][j+1]=x,r[i][x]=j+1;
}
for(i=1;i<(1<<m);i++)
for(j=0;j<m;j++)
if((i>>j)&1){
x=r[j+1][find(j+1,min(f[i^(1<<j)]+1,n))];
f[i]=max(f[i],x);
}
for(i=0;i<(1<<m);i++) g[i]=n+1;
for(i=1;i<(1<<m);i++)
for(j=0;j<m;j++)
if((i>>j)&1){
x=find(j+1,max(g[i^(1<<j)]-1,1));
g[i]=min(g[i],x);
}
T=(1<<m)-1,p=0,y=-100;
for(i=0;i<=T;i++)
G[g[T^i]].push_back(f[i]);
for(i=1;i<=n;i++){
x=find(0,i);
while(p<=r[0][x]+1){
for(j=0;j<G[p].size();j++)
y=max(y,G[p][j]);
p++;
}
if(y<x-1) printf("Impossible\n");
else printf("Possible\n");
}
return 0;
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 200010
#define MAXS 1000010
using namespace std;
int read(){
char c;
while(((c=getchar())<'0' || c>'9') && c!='-');
int flag=1;
int res=c-'0';
if(c=='-'){
flag=-1;
res=0;
}
while((c=getchar())>='0' && c<='9') res=res*10+c-'0';
return res*flag;
}
int n,m,v0,maxs;
int a[MAXN];
int lim[MAXN];
int f1[MAXS],f2[MAXS];
int p[20][MAXN][2];
int c[MAXN];
void calcP(int l){
int last=1;
for(int i=1;i<=n;i++){
if(i==n || a[i+1]-a[i]>lim[l]){
for(int j=last;j<=i;j++){
p[l][j][0]=last;
p[l][j][1]=i;
}
last=i+1;
}
}
p[l][0][0]=1;
p[l][n+1][1]=n;
}
void dp(){
f1[0]=0; f2[0]=n+1;
for(int s=1;s<maxs;s++){
f2[s]=n+1;
for(int i=1,l=1;i<=m;i++,l<<=1)
if(s&l){
f1[s]=max(f1[s],p[i][f1[s^l]+1][1]);
f2[s]=min(f2[s],p[i][f2[s^l]-1][0]);
}
}
}
int main(){
#ifdef DEBUG
freopen("g012e.in","r",stdin);
#endif
n=read(); v0=read();
for(int i=1;i<=n;i++) a[i]=read();
lim[0]=v0;
while(v0) lim[++m]=(v0/=2);
maxs=1<<m;
for(int i=0;i<=m;i++) calcP(i);
dp();
memset(c,-1,sizeof c);
for(int i=0;i<maxs;i++)
c[f2[i]]=max(c[f2[i]],f1[(maxs-1)^i]);
int cur=-1,now=-1;
for(int i=1;i<=n;i++)
if(p[0][i][0]==i){
while(cur<p[0][i][1]+1) now=max(now,c[++cur]);
if(now>=i-1)
for(int j=p[0][i][0];j<=p[0][i][1];j++)
puts("Possible");
else
for(int j=p[0][i][0];j<=p[0][i][1];j++)
puts("Impossible");
}
return 0;
} |
#include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdio>
#include<vector>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
#define repd(i,x,y) for(int i=x; i>=y; --i)
#define pb push_back
using namespace std;
const int N=200005,M=20;
bool ans[N];
int n,m,a[N],c;
int g1[M][N],g2[M][N],f1[1<<M],f2[1<<M];
vector <int> vt[N],Q[N];
struct data{int x,y;} dat[N];
int getint()
{
char ch;
int f=1;
while(!isdigit(ch=getchar())) if(ch=='-') f=-1;
int x=ch-48;
while(isdigit(ch=getchar())) x=x*10+ch-48;
return x*f;
}
int main()
{
n=getint(),m=getint();
rep(i,1,n) a[i]=getint();
for(int x=m; ; x>>=1,++c)
{
int i=1,j=1;
while(j+1<=n && a[j+1]-a[j]<=x) ++j;
rep(k,1,n+1) g2[c][k]=n+1;
rep(k,1,n)
{
if(k>j) i=j=k;
while(j+1<=n && a[j+1]-a[j]<=x) ++j;
if(!c) dat[k]=(data){i,j};
else
{
g1[c][i]=max(g1[c][i],j);
g2[c][j]=min(g2[c][j],i);
}
}
g1[c][n+1]=n,g2[c][0]=1;
rep(k,1,n) g1[c][i]=max(g1[c][i],g1[c][i-1]);
repd(k,n,1) g2[c][i]=min(g2[c][i],g2[c][i+1]);
if(!x) break;
}
rep(i,0,(1<<c)-1) f2[i]=n+1;
rep(i,0,(1<<c)-1)
{
rep(j,0,c-1) if(!(i&(1<<j)))
{
f1[i|(1<<j)]=max(f1[i|(1<<j)],g1[j+1][f1[i]+1]);
f2[i|(1<<j)]=min(f2[i|(1<<j)],g2[j+1][f2[i]-1]);
}
}
int S=(1<<c)-1;
rep(i,0,S)
{
int x=min(f1[i]+1,n);
int y=max(f2[S^i]-1,1);
vt[x].pb(y);
}
rep(i,1,n) Q[dat[i].x].pb(i);
int p=n+1;
repd(i,n,1)
{
int sz=vt[i].size();
rep(j,0,sz-1) p=min(p,vt[i][j]);
sz=Q[i].size();
rep(j,0,sz-1) ans[Q[i][j]]=p<=dat[Q[i][j]].y;
}
rep(i,1,n) if(ans[i]) puts("Possible"); else puts("Impossible");
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x); i<=(y); i++)
#define per(i,x,y) for (int i=(x); i>=(y); i--)
#define N 1048576
#define ll long long
using namespace std;
int n,m,cnt,a[N],b[109],l[20][N],r[20][N],f[N],g[N];
struct node{ int x,y; node(){} node(int a,int b){ x=a,y=b; } }c[N];
const bool cmp(const node &x,const node &y){ return x.y<y.y; }
int main(){
scanf("%d%d",&n,&m);
for (; m; m>>=1) b[++cnt]=m; cnt++;
rep (i,1,cnt>>1) swap(b[i],b[cnt-i+1]);
m=1<<cnt-1;
rep (i,1,n) scanf("%d",&a[i]);
rep (i,1,cnt){//预处理l[i][j]和r[i][j]表示第i层第j个点所在线段的左右端点
l[i][1]=1; r[i][n]=n;
rep (j,2,n) l[i][j]=a[j]-a[j-1]<=b[i]?l[i][j-1]:j;
per (j,n-1,1) r[i][j]=a[j+1]-a[j]<=b[i]?r[i][j+1]:j;
}
rep (i,0,m-1) g[i]=n+1,f[i]=0;//f[i]表示状态为i，从1开始延伸出去的最远长度；g[i]表示从n开始延伸的最远长度
//状态s的意思是，如果某位为1则表示当前层选了线段
rep (i,1,m-1) rep (j,1,cnt-1) if ((i>>j-1)&1){
int k=i^1<<j-1;//f[k]->f[i]
f[i]=max(f[i],f[k]<n?r[j][f[k]+1]:n);
g[i]=min(g[i],g[k]>1?l[j][g[k]-1]:1);
}
rep (i,0,m-1)
if (f[i]+1<g[m-1^i]) c[i+1]=node(f[i]+1,g[m-1^i]-1);
else{
rep(j,1,n) puts("Possible"); return 0;
}
sort(c+1,c+1+m,cmp);
for (int i=1,j=1,k=0; i<=n; i++){
while (j<=m && c[j].y<=r[cnt][i]){
k=max(k,c[j].x); j++;
}
if (k>=l[cnt][i]) puts("Possible"); else puts("Impossible");
}
return 0;
} |
#include<cstdio>
#include<cstring>
int n,v,a[200001],fa[200001][21],l[200002][21],r[200002][21],V[21],cnt,fl[1048576],fr[1048576],k,L,R;
bool b[200001];
int ask(int x,int y) {return fa[x][y]==x?x:fa[x][y]=ask(fa[x][y],y);}
int getmin(int a,int b) {return a<b?a:b;}
int getmax(int a,int b) {return a>b?a:b;}
void unite(int x,int y,int z)
{
int p=ask(x,z),q=ask(y,z);
if (p==q) return;
fa[p][z]=q;
l[q][z]=getmin(l[p][z],l[q][z]);
r[q][z]=getmax(r[q][z],r[p][z]);
}
int main()
{
scanf("%d%d",&n,&v); cnt=-1;
memset(b,0,sizeof(b));
for (int i=1; i<=n; i++) scanf("%d",&a[i]);
while (v) V[++cnt]=v,v>>=1; V[++cnt]=0;
for (int i=0; i<=cnt; i++)
{
for (int j=1; j<=n; j++) fa[j][i]=l[j][i]=r[j][i]=j;
for (int j=1; j<n; j++) if (a[j+1]-a[j]<=V[i]) unite(j,j+1,i);
}
for (int i=0; i<=cnt; i++) r[n+1][i]=n,l[0][i]=1;
k=(1<<cnt);
for (int i=0; i<k; i++) fl[i]=0,fr[i]=n+1;
for (int i=1; i<k; i++)
for (int j=0; j<cnt; j++)
if ((i>>j)&1)
{
fl[i]=getmax(fl[i],r[ask(fl[i^(1<<j)]+1,j+1)][j+1]);
fr[i]=getmin(fr[i],l[ask(fr[i^(1<<j)]-1,j+1)][j+1]);
}
for (int i=0; i<k; i++)
{
L=fl[i]; R=fr[i^(k-1)];
if (R<=L+1)
{
for (int j=1; j<=n; j++) printf("Possible\n");
return 0;
}
if (ask(L+1,0)==ask(R-1,0)) b[ask(L+1,0)]=1;
}
for (int i=1; i<=n; i++) if (b[ask(i,0)]) printf("Possible\n"); else printf("Impossible\n");
return 0;
} |
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
const int inf=1e9;
const ll Inf=1e18;
const int N=1e6+10;
const int mod=0;
int gi() {
int x=0,o=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
}
template<typename T> bool chkmax(T &a,T b) { return a<b?a=b,1:0; };
template<typename T> bool chkmin(T &a,T b) { return a>b?a=b,1:0; };
int add(int a,int b) { return a+b>=mod?a+b-mod:a+b; }
int sub(int a,int b) { return a-b<0?a-b+mod:a-b; }
void inc(int &a,int b) { a=(a+b>=mod?a+b-mod:a+b); }
void dec(int &a,int b) { a=(a-b<0?a-b+mod:a-b); }
int n,v,x[N],st[N],l[N][20],r[N][20],f[N],g[N],mn[N],top=0;
int main() {
cin>>n>>v;
for(int i=1;i<=n;i++) x[i]=gi();
while(v) st[++top]=v,v>>=1;
st[++top]=0;
reverse(st+1,st+top+1);
for(int j=1;j<=top;j++) {
l[1][j]=1;
for(int i=2;i<=n;i++) l[i][j]=(x[i]-x[i-1]<=st[j])?l[i-1][j]:i;
r[n][j]=n;
for(int i=n-1;i;i--) r[i][j]=(x[i+1]-x[i]<=st[j])?r[i+1][j]:i;
}
f[0]=0;g[0]=n+1;
for(int i=1;i<(1<<top);i++) {
f[i]=0,g[i]=n+1;
for(int j=1;j<=top;j++)
if(i>>(j-1)&1) {
chkmax(f[i],(f[i^(1<<(j-1))]==n)?n:r[f[i^(1<<(j-1))]+1][j]);
chkmin(g[i],(g[i^(1<<(j-1))]==1)?1:l[g[i^(1<<(j-1))]-1][j]);
}
}
memset(mn,0x3f,sizeof(mn));
for(int i=0;i<(1<<(top-1));i++) chkmin(mn[f[i]],g[((1<<(top-1))-1)^i]);
for(int i=n-1;i;i--) chkmin(mn[i],mn[i+1]);
for(int i=1;i<=n;i++) puts(mn[l[i][top]-1]<=r[i][top]+1?"Possible":"Impossible");
return 0;
}
|
#include <bits/stdc++.h>
inline int read() {
int ret, cc, sign = 1;
while (!isdigit(cc = getchar()))
sign = cc == '-' ? -1 : sign;
ret = cc - 48;
while ( isdigit(cc = getchar()))
ret = cc - 48 + ret * 10;
return ret * sign;
}
const int MAXN = 300010;
int val[MAXN];
int pos[MAXN];
int left[30][MAXN];
int right[30][MAXN];
int dp[2][MAXN];
int tot, n, V;
int main() {
#ifdef ARK
freopen("test.in", "r", stdin);
#endif
n = read(), V = read();
for (int i = 1; i <= n; ++i)
pos[i] = read();
val[0] = V / 2;
while (val[tot])
val[tot + 1] = val[tot] / 2, ++tot;
for (int i = 0; i <= tot; ++i) {
right[i][n + 1] = n + 1, right[i][n] = n;
for (int j = n - 1; j >= 1; --j)
if (pos[j + 1] - pos[j] <= val[i])
right[i][j] = right[i][j + 1];
else
right[i][j] = j;
left[i][1] = 1;
for (int j = 2; j <= n; ++j)
if (pos[j] - pos[j - 1] <= val[i])
left[i][j] = left[i][j - 1];
else
left[i][j] = j;
}
int U = (1 << (tot + 1)) - 1;
dp[0][0] = 0, dp[1][0] = n + 1;
for (int S = 1; S <= U; ++S) {
dp[1][S] = n + 1;
for (int j = 0; j <= tot; ++j)
if (S >> j & 1) {
dp[0][S] = std::max(right[j][dp[0][S ^ (1 << j)] + 1], dp[0][S]);
dp[1][S] = std::min(left[j][dp[1][S ^ (1 << j)] - 1], dp[1][S]);
}
}
for (int i = 1; i <= n; ++i) {
int r = i;
while (r < n && pos[r + 1] - pos[r] <= V) r++;
bool flag = 0;
for (int S = 0; S <= U; ++S)
if (dp[0][S] >= i - 1 && dp[1][U ^ S] <= r + 1) {
flag = 1;
break;
}
for (int j = i; j <= r; ++j)
puts(flag ? "Possible" : "Impossible");
i = r;
}
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
const int N=200005;
int l[N][20],r[N][20],dpl[1<<18],dpr[1<<18],f[N],x[N],a[N];
int main(){
int n,v,m=0;
scanf("%d%d",&n,&v);
for (;1<<m<=v;m++);
for (int i=m;i;i--,v>>=1) a[i]=v;
for (int i=1;i<=n;i++) scanf("%d",&x[i]);
for (int i=0;i<=m;i++) l[0][i]=0,r[n+1][i]=n+1;
for (int i=1;i<=n;i++)
for (int j=0;j<=m;j++)
if (x[i]-x[i-1]<=a[j]) l[i][j]=l[i-1][j];
else l[i][j]=i-1;
for (int i=n;i;i--)
for (int j=0;j<=m;j++)
if (x[i+1]-x[i]<=a[j]) r[i][j]=r[i+1][j];
else r[i][j]=i+1;
int L=1<<m;
for (int i=0;i<L;i++){
dpl[i]=1;dpr[i]=n;
for (int j=0;j<m;j++)
if ((i>>j)&1){
dpl[i]=max(dpl[i],r[dpl[i^1<<j]][j]);
dpr[i]=min(dpr[i],l[dpr[i^1<<j]][j]);
}
}
for (int i=0;i<L;i++)
f[dpr[i]]=max(f[dpr[i]],dpl[(L-1)^i]);
for (int i=1;i<=n;i++) f[i]=max(f[i],f[i-1]);
for (int i=1;i<=n;i++)
if (f[r[i][m]-1]>l[i][m]) printf("Possible\n");
else printf("Impossible\n");
} |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long LL;
int kano()
{
char ch=getchar();int w=0,u=1;
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')u=-1;
for(;ch>='0'&&ch<='9';ch=getchar())w=w*10+ch-'0';
return w*u;
}
int n,v,o,u,mx;
int a[200005];
int p[21][200005],r[21][200005];
int f[2][262145];
bool bo[200005];
int main()
{
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
n=kano();v=kano();
for(int i=1;i<=n;i++)a[i]=kano();
for(o=v,u=0;o>0;o=o>>1,u++)
{
int la=1;p[u][1]=1;r[u][1]=1;
for(int i=2;i<=n;i++)
{
if(a[i]-a[i-1]<=o)
{
p[u][la]=i;
r[u][i]=la;
}
else
{
la=i;
p[u][la]=i;
r[u][i]=la;
}
}
}
for(int i=1;i<=n;i++)p[u][i]=r[u][i]=i;
mx=1<<u;mx--;
for(int i=0;i<=mx;i++)
{
if(f[0][i]>n)f[0][i]=n;
for(int j=1,l=1;j<=mx;j=j<<1,l++)
{
if(i&j)continue;
if(f[0][i]!=n)f[0][i|j]=max(f[0][i|j],p[l][r[l][f[0][i]+1]]);
else f[0][i|j]=n;
}
}
for(o=v>>1,u=1;o>0;o=o>>1,u++)
{
int la=n;p[u][n]=n;r[u][n]=n;
for(int i=n-1;i>=1;i--)
{
if(a[i+1]-a[i]<=o)
{
p[u][la]=i;
r[u][i]=la;
}
else
{
la=i;
p[u][la]=i;
r[u][i]=la;
}
}
}
for(int i=1;i<=n;i++)p[u][i]=r[u][i]=i;
for(int i=0;i<=mx;i++)f[1][i]=n+1;
for(int i=0;i<=mx;i++)
{
if(f[1][i]<1)f[1][i]=1;
for(int j=1,l=1;j<=mx;j=j<<1,l++)
{
if(i&j)continue;
if(f[1][i]!=1)f[1][i|j]=min(f[1][i|j],p[l][r[l][f[1][i]-1]]);
else f[1][i|j]=1;
}
}
r[0][0]=r[0][1];
r[0][n+1]=r[0][n];
for(int i=0;i<=mx;i++)
{
int j=~i&mx;
if(r[0][f[0][i]+1]==r[0][f[1][j]-1])bo[r[0][f[0][i]+1]]=1;
else if(r[0][f[0][i]+1]>r[0][f[1][j]-1])
{
bo[0]=1;
break;
}
}
for(int i=1;i<=n;i++)
{
if(bo[0]||bo[r[0][i]])puts("Possible");
else puts("Impossible");
}
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 200050;
int n, v, x[N];
int dp1[(1 << 19) + 3], dp2[(1 << 19) + 3];
int tor[20][N], tol[20][N], len[20], dep, mxr[N];
inline void gi(int &x){
int f = 1; x = 0; char c = getchar();
while(c < '0' || c > '9'){
if(c == '-')f = -1;
c = getchar();
}
while(c >= '0' && c <= '9'){
x = x * 10 + c - '0';
c = getchar();
}
x *= f;
}
int main()
{
int i, j, d;
gi(n), gi(v), x[0] = -2e9, x[n+1] = 2e9;
for(len[0] = v; len[dep] != 0; dep ++)
len[dep + 1] = len[dep] >> 1;
for(dep ++, i = 1; i <= n; i ++)gi(x[i]);
for(d = 0; d < dep; d ++){
tol[d][0] = n, tor[d][n + 1] = n;
for(i = 1; i <= n; i ++)tol[d][i] = (x[i] - x[i - 1] <= len[d]) ? tol[d][i - 1] : n + 1 - i;
for(i = n; i >= 1; i --)tor[d][i] = (x[i + 1] - x[i] <= len[d]) ? tor[d][i + 1] : i;
}
for(i = 0; i < (1 << dep); i += 2){
for(j = 1; j < dep; j ++){
if((i & (1 << j)) == 0){
dp1[i | (1 << j)] = max(dp1[i | (1 << j)], tor[j][dp1[i] + 1]);
dp2[i | (1 << j)] = max(dp2[i | (1 << j)], tol[j][n - dp2[i]]);
}
}
}
memset(mxr, 0xc0, sizeof(mxr));
for(i = 0, j = ((1 << dep) - 1) ^ 1; j >= 0; i += 2, j -= 2)
mxr[dp1[i]] = max(mxr[dp1[i]], dp2[j]);
for(i = 1; i <= n; i ++){
if(mxr[n - tol[0][i]] + tor[0][i] >= n)puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#define SF scanf
#define PF printf
#define MAXN 1000010
#define INF 0x3FFFFFFF
using namespace std;
int n,v,logv;
int x[MAXN];
int f1[MAXN],f2[MAXN];
int l[22][MAXN],r[22][MAXN],cnt[22];
int find_l(int x,int pos){
pos++;
int now=upper_bound(l[x]+1,l[x]+1+cnt[x],pos)-l[x];
now--;
if(now<=0)
return pos;
return max(r[x][now],pos-1);
}
int find_r(int x,int pos){
pos--;
int now=lower_bound(r[x]+1,r[x]+1+cnt[x],pos)-r[x];
if(now>cnt[x])
return pos;
return min(l[x][now],pos+1);
}
int ans[MAXN];
int main(){
memset(f2,0x3f3f3f3f,sizeof f2);
SF("%d%d",&n,&v);
for(int i=1;i<=n;i++)
SF("%d",&x[i]);
x[0]=-INF;
x[n+1]=INF;
for(logv=0;(1<<logv)<=v;logv++);
logv++;
for(int i=0;i<logv;i++){
int v1=v>>i;
cnt[i]=1;
l[i][cnt[i]]=1;
for(int j=1;j<=n;j++)
if(x[j+1]-x[j]>v1){
r[i][cnt[i]]=j;
cnt[i]++;
l[i][cnt[i]]=j+1;
}
cnt[i]--;
}
if(cnt[0]>logv){
for(int i=1;i<=n;i++)
PF("Impossible\n");
return 0;
}
f1[0]=0;
f2[0]=n+1;
for(int mask=0;mask<(1<<logv);mask+=2)
for(int i=1;i<logv;i++)
if((mask&(1<<i))!=0){
f1[mask]=max(f1[mask],find_l(i,f1[mask^(1<<i)]));
f2[mask]=min(f2[mask],find_r(i,f2[mask^(1<<i)]));
}
for(int i=1;i<=cnt[0];i++){
int lft=l[0][i];
int rit=r[0][i];
for(int mask=0;mask<(1<<logv);mask+=2){
int mask2=((1<<logv)-2)^mask;
if(f1[mask]>=lft-1&&f2[mask2]<=rit+1){
ans[i]=1;
break;
}
}
}
int las=1;
for(int i=1;i<=n;i++){
if(i>r[0][las])
las++;
if(ans[las]==0)
PF("Impossible\n");
else
PF("Possible\n");
}
} |
#include<iostream>
#include<cstring>
#include<cstdio>
#define MN 200000
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,V,x[MN+5],s,nxt[20][MN+5],res[MN+5],f[1<<18];
inline void R(int&x,int y){y>x?x=y:0;}
void Solve(int l,int r)
{
memset(f,200,sizeof(f));f[0]=l==1?r+1:1;
for(int i=0;i<1<<s;++i)
for(int j=1;j<=s;++j) if(!(i&(1<<j-1)))
R(f[i|(1<<j-1)],nxt[j][f[i]]==l?r+1:nxt[j][f[i]]);
if(f[(1<<s)-1]>n) for(int i=l;i<=r;++i) res[i]=1;
}
int main()
{
n=read();V=read();
for(int i=1;i<=n;++i) x[i]=read();
for(int t=V;;t>>=1,++s)
{
nxt[s][n]=nxt[s][n+1]=n+1;
for(int i=n-1;i;--i) nxt[s][i]=x[i+1]-x[i]>t?i+1:nxt[s][i+1];
if(!t) break;
}
int tot=0;
for(int i=1;i<=n;i=nxt[0][i],++tot);
if(tot<=s+1) for(int b=1;b<=n;b=nxt[0][b],++tot) Solve(b,nxt[0][b]-1);
for(int i=1;i<=n;++i) puts(res[i]?"Possible":"Impossible");
return 0;
}
|
#include <bits/stdc++.h>
#define N 400010
using namespace std;
inline int read()
{
int x=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int n,v,p[N],lgl[N][20],lgr[N][20];
int Fl[N],Fr[N],sc,XD[N];
int main()
{
n=read(); v=read();
for(int i=1;i<=n;i++)
p[i]=read();
for(int t=v,_=0;t;t>>=1,_++)
{
for(int i=1;i<=n;i++)
{
int j=i;
while(p[j+1]-p[j]<=t&&j+1<=n) j++;
for(int x=i;x<=j;x++)
lgl[x][_]=j,lgr[x][_]=i;
i=j;
} sc=max(sc,_);
} sc++;
for(int i=1;i<=n;i++) lgl[i][sc]=lgr[i][sc]=i;
memset(XD,0x3f,sizeof XD);
memset(Fr,0x3f,sizeof Fr); Fr[0]=n+1;
for(int i=0;i<(1<<sc);i++)
{
for(int k=1;k<=sc;k++) if(!(i&(1<<(k-1))))
{
Fl[i|(1<<(k-1))]=max(Fl[i|(1<<(k-1))],lgl[Fl[i]+1][k]);
Fr[i|(1<<(k-1))]=min(Fr[i|(1<<(k-1))],lgr[Fr[i]-1][k]);
}
}
for(int i=0;i<(1<<sc);i++) XD[Fl[i]]=min(XD[Fl[i]],Fr[((1<<sc)-1)^i]);
for(int i=n;i>=1;i--) XD[i]=min(XD[i],XD[i+1]);
for(int i=1;i<=n;i++)
{
if(lgl[i][0]==n&&lgr[i][0]==1) puts("Possible");
else
{
if(XD[lgr[i][0]-1]<=lgl[i][0]+1) puts("Possible");
else puts("Impossible");
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m;
int po[1000100];
int mlg;
vector<int>li[22];
int mr[22][1000100];
int ml[22][1000100];
void get_line(int pos,int ma)
{
li[pos].push_back(0);
for(int i=1;i<=n;++i)
if(i==1||po[i]-po[i-1]>ma)
li[pos].push_back(i);
li[pos].push_back(n+1);
for(int i=1,p=0;i<=n;++i)
{
mr[pos][i]=mr[pos][i-1];
if(i==li[pos][p+1])
p++,mr[pos][i]=li[pos][p+1]-1;
}
mr[pos][n+1]=n;
ml[pos][n+1]=n+1;
for(int i=n,p=li[pos].size()-1;i;--i)
{
ml[pos][i]=ml[pos][i+1];
if(i==li[pos][p]-1)
p--,ml[pos][i]=li[pos][p];
}
}
int pre[1000100],suf[1000100];
int ans[22];
void out(int ma)
{
for(int i=1;i<=ma;++i)
for(int j=li[0][i];j<li[0][i+1];++j)
puts(ans[i]?"Possible":"Impossible");
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)scanf("%d",&po[i]);
for(int tm=m;tm;mlg++,tm>>=1) get_line(mlg,tm);
get_line(mlg,0);mlg++;
int s=1<<mlg,nxt;
memset(suf,0x3f,sizeof(suf));
suf[0]=n+1;
for(int i=0;i<s;++i)
{
for(int j=0;j<mlg;++j)
{
if((i>>j)&1)continue;
nxt=(i|(1<<j));
pre[nxt]=max(pre[nxt],mr[j][pre[i]+1]);
suf[nxt]=min(suf[nxt],ml[j][suf[i]-1]);
}
}
int ma=li[0].size()-2;
if(ma>mlg)
{
for(int i=1;i<=n;++i)puts("Impossible");
return 0;
}
s--;
int ls=(s^1);
for(int i=1,L,R;i<=ma;++i)
{
L=li[0][i];R=li[0][i+1]-1;
for(int j=0;j<=s;++j)
{
if(j&1)continue;
if(pre[j]>=L-1&&suf[(s^j)&ls]<=R+1)
{
ans[i]=1;
break;
}
}
}
out(ma);
return 0;
}
|
#include<bits/stdc++.h>
const int MN=300000+5;
using namespace std;
typedef long long ll;
template<typename T>inline T&IN(T&in){
in=0;char c=getchar();int f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))in=in*10+c-'0',c=getchar();
return in*=f;
}
int n,V;
int l[20][MN],r[20][MN];
int fr[MN],fl[MN],s[MN];ll x[MN];
void input(){
IN(n),IN(V);
for(int i=1;i<=n;++i)IN(x[i]);
int k;x[0]=LLONG_MIN/10,x[n+1]=LLONG_MAX/10;
for(k=0;V;++k,V>>=1){
for(int i=1;i<=n;++i)l[k][i]=x[i]-x[i-1]>V?i:l[k][i-1];
for(int i=n;i>=1;--i)r[k][i]=x[i+1]-x[i]>V?i:r[k][i+1];
}
for(int i=1;i<=n;++i)l[k][i]=x[i]-x[i-1]>V?i:l[k][i-1];
for(int i=n;i>=1;--i)r[k][i]=x[i+1]-x[i]>V?i:r[k][i+1];
for(int st=0;st<(1<<k);++st){
fr[st]=n+1;
for(int i=0;i<k;++i)if(st>>i&1){
fl[st]=max(fl[st],r[i+1][fl[st^(1<<i)]+1]);
fr[st]=min(fr[st],l[i+1][fr[st^(1<<i)]-1]);
}
}
for(int st=0;st<(1<<k);++st){
int L=l[0][fr[((1<<k)-1)^st]-1],R=r[0][fl[st]+1];
if(L<=R)s[L]++,s[R+1]--;
}
for(int i=1;i<=n;++i){
s[i]+=s[i-1];
puts(s[i]?"Possible":"Impossible");
}
}
int main(){
input();
return 0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
#define iter(i, n) forw(i, 1, n)
#define iter0(i, n) for (int i = 0; i < n; ++i)
#define iter_r(i, n) for (int i = n; i >= 1; --i)
#define forw(i, a, b) for (int i = a; i <= b; ++i)
#define NR 201000
bool mark[NR];
int n, V, x[NR], v[20], pre[NR][20], suc[NR][20], l, f[601000], g[601000];
int main() {
scanf("%d%d", &n, &V);
for (; V > 0; V = V / 2) v[l++] = V; v[l++] = 0;
iter(i, n) scanf("%d", &x[i]);
iter0(i, l) suc[n][i] = n, pre[1][i] = 1;
forw(i, 2, n) iter0(k, l) pre[i][k] = (x[i] - x[i - 1] <= v[k] ? pre[i - 1][k] : i);
iter_r(i, n - 1) iter0(k, l) suc[i][k] = (x[i + 1] - x[i] <= v[k] ? suc[i + 1][k] : i);
int M = 1 << l;
iter0(s, M) g[s] = n + 1;
iter0(s, M) {
//printf(": %d %d %d\n", s, f[s], g[s]);
iter0(i, l) if (!(s >> i & 1)) {
f[s ^ (1 << i)] = max(f[s ^ (1 << i)], f[s] == n ? n : suc[f[s] + 1][i]);
g[s ^ (1 << i)] = min(g[s ^ (1 << i)], g[s] == 1 ? 1 : pre[g[s] - 1][i]);
}
}
bool all = false;
iter0(s, M) if (!(s & 1)) {
int t = M - 1 - s - 1;
int l = f[s], r = g[t];
//printf("!%d %d %d\n", l, r, suc[l+1][0]);
if (l + 1 >= r) all = true;
else if (suc[l + 1][0] >= r - 1) mark[l + 1] = true;
}
if (all) iter(i, n) mark[i] = true;
int r = 0;
iter(i, n) {
if (mark[i]) r = suc[i][0];
puts(i <= r ? "Possible" : "Impossible");
}
return 0;
} |
#include <bits/stdc++.h>
#define debug(x) cout << #x" = " << x;
#define st first
#define nd second
using namespace std;
using namespace placeholders;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MAXN = 2E5 + 10, MAXD = 19;
int n, V;
int a[MAXN];
int pre[MAXD][MAXN], nex[MAXD][MAXN];
int prem[1 << MAXD], sufm[1 << MAXD];
int cnt[MAXN];
int main(){
scanf("%d%d", &n, &V);
for (int i = 1; i <= n; ++i)
scanf("%d", a + i);
int D = 32 - __builtin_clz(V);
for (int k = 0; k <= D; ++k){
int len = V >> D - k;
pre[k][0] = 1;
for (int j, i = 1; i <= n; i = j){
pre[k][i] = i;
for (j = i + 1; j <= n && a[j] - a[j - 1] <= len; ++j)
pre[k][j] = i;
}
nex[k][n + 1] = n;
for (int j, i = n; i >= 1; i = j){
nex[k][i] = i;
for (j = i - 1; j >= 1 && a[j + 1] - a[j] <= len; --j)
nex[k][j] = i;
}
}
int n0 = 1 << D;
prem[0] = 0, sufm[0] = n + 1;
for (int i = 1; i < n0; ++i){
prem[i] = 0;
for (int j = 0; j < D; ++j)
if (i >> j & 1)
prem[i] = max(prem[i], nex[j][prem[i ^ 1 << j] + 1]);
}
for (int i = 1; i < n0; ++i){
sufm[i] = n + 1;
for (int j = 0; j < D; ++j)
if (i >> j & 1)
sufm[i] = min(sufm[i], pre[j][sufm[i ^ 1 << j] - 1]);
}
for (int i = 0; i < n0; ++i){
int l = prem[i] + 1, r = sufm[n0 - 1 ^ i] - 1;
if (l > r){
++cnt[1], --cnt[n + 1];
break;
}
else{
if (nex[D][l] >= r)
++cnt[l], --cnt[nex[D][l] + 1];
if (pre[D][r] <= l)
++cnt[pre[D][r]], --cnt[r + 1];
}
}
partial_sum(cnt + 1, cnt + n + 1, cnt + 1);
for (int i = 1; i <= n; ++i)
puts(cnt[i] ? "Possible" : "Impossible");
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <cstring>
#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i != -1; i = edge[i].next)
#define mp(a, b) make_pair(a, b)
using namespace std;
const int N = 524288;
int x[N], ll[20][N], rr[20][N], f[N], g[N], sg[N];
bool vv[N];
int main()
{
//freopen("snake7.in", "r", stdin);
//freopen("s.out", "w", stdout);
int n, v;
scanf("%d%d", &n, &v);
Rep(i, n) scanf("%d", &x[i]);
int k = 0;
while (true) {
rr[k][n + 1] = rr[k][n] = n;
for (int i = n - 1; i; i --) {
if (x[i] + v >= x[i + 1]) rr[k][i] = rr[k][i + 1];
else rr[k][i] = i;
}
ll[k][0] = ll[k][1] = 1;
for (int i = 2; i <= n; i ++) {
if (x[i - 1] + v >= x[i]) ll[k][i] = ll[k][i - 1];
else ll[k][i] = i;
}
k ++;
if (!v) break;
v /= 2;
}
Rep0(s, (1 << k) - 1) f[s] = 0;
Rep0(s, (1 << k) - 1) g[s] = n + 1;
Rep0(s, (1 << k) - 1){
//printf("%d %d %d\n", s, f[s], g[s]);
Rep0(i, k - 1) if (!(s & (1 << i))) {
f[s ^ (1 << i)] = max(f[s ^ (1 << i)], rr[i][f[s] + 1]);
g[s ^ (1 << i)] = min(g[s ^ (1 << i)], ll[i][g[s] - 1]);
}
}
Rep0(s, (1 << k) - 1) {
sg[s] = g[s];
Rep0(i, k - 1) if (s & (1 << i)) sg[s] = min(sg[s], sg[s ^ (1 << i)]);
}
bool flag = false;
Rep0(s, (1 << k) - 1) if (!(s & 1)) {
int ss = (((1 << k) - 1) ^ 1) ^ s;
//printf("%d %d %d %d\n", s, ss, f[s], sg[ss]);
if (sg[ss] <= f[s] + 1){ flag = true; break;}
else if (ll[0][f[s] + 1] == ll[0][sg[ss] - 1]){ vv[ll[0][f[s] + 1]] = true; }
}
if (flag) Rep(i, n) printf("Possible\n");
else Rep(i, n){
if (vv[ll[0][i]]) printf("Possible\n");
else printf("Impossible\n");
}
return 0;
}
|
//Camel and Oases
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long lint;
int const N=2e5+10;
int const S=1<<19;
int n,V;
lint d[N];
int logV,a[25][N];
int U,f1[S],f2[S];
int upFind(int a[],int x)
{
int L=1,R=a[0];
while(L<R-1)
{
int mid=(L+R)>>1;
if(a[mid]<=x) L=mid+1;
if(a[mid]>x) R=mid;
}
if(a[L]>x) return a[L];
else return a[R];
}
int lowFind(int a[],int x)
{
int L=1,R=a[0];
while(L<R-1)
{
int mid=(L+R)>>1;
if(a[mid]<x) L=mid;
if(a[mid]>=x) R=mid-1;
}
if(a[R]<x) return a[R]+1;
else return a[L]+1;
}
int main()
{
scanf("%d%d",&n,&V);
logV=0;
while((1<<logV)<=V) logV++;
logV++;
for(int i=1;i<=n;i++) scanf("%lld",&d[i]),d[i-1]=d[i]-d[i-1];
d[n]=0;
for(int i=1;i<=logV;i++)
{
a[i][0]=1;
for(int j=1;j<=n;j++)
{
a[i][a[i][0]]=j;
if(d[j]>(V>>(i-1))) a[i][0]++;
}
}
if(a[1][0]>logV)
{
for(int i=1;i<=n;i++) printf("Impossible\n");
return 0;
}
U=(1<<logV)-1;
for(int s=0;s<=U;s++) f1[s]=0,f2[s]=n+1;
for(int s=0;s<=U;s+=2)
for(int i=2;i<=logV;i++)
{
int s0=1<<(i-1);
if(s&s0) continue;
f1[s|s0]=max(f1[s|s0],upFind(a[i],f1[s]));
f2[s|s0]=min(f2[s|s0],lowFind(a[i],f2[s]-1));
}
for(int i=1;i<=a[1][0];i++)
{
bool f=false;
int fr=a[1][i-1]+1,to=a[1][i];
if(i==1) fr=1;
for(int s=0;s<=U&&!f;s+=2)
if(fr<=f1[s]+1 && f2[U-s-1]-1<=to) f=true;
if(f) for(int j=fr;j<=to;j++) printf("Possible\n");
else for(int j=fr;j<=to;j++) printf("Impossible\n");
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dep(i,a,b) for(int i=a;i>=b;i--)
#define ll long long
#define mem(x,num) memset(x,num,sizeof x)
#define reg(x) for(int i=last[x];i;i=e[i].next)
using namespace std;
inline ll read(){
ll f=1,x=0;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//**********head by yjjr**********
const int maxn=2e5+6;
int n,v,tot=-1,bin[26],R[26][maxn],num[26],f1[maxn<<2],f2[maxn<<2],a[maxn];
int main()
{
n=read(),v=read();bin[0]=1;
rep(i,1,20)bin[i]=bin[i-1]<<1;
rep(i,1,n)a[i]=read();int x=v*2;
while(x){
x>>=1,tot++;
rep(i,1,n-1){
if(a[i+1]-a[i]<=x)continue;
R[tot][++num[tot]]=i;
}
R[tot][++num[tot]]=n;
}
if(num[0]>tot+1){
rep(i,1,n)puts("Impossible");
return 0;
}
rep(s,0,bin[tot]-1)f2[s]=n+1;
rep(s,0,bin[tot]-1)
rep(i,1,tot){
if(s&bin[i-1])continue;
f1[s|bin[i-1]]=max(f1[s|bin[i-1]],*upper_bound(R[i]+1,R[i]+num[i]+1,f1[s]));
f2[s|bin[i-1]]=min(f2[s|bin[i-1]],R[i][lower_bound(R[i]+1,R[i]+num[i]+1,f2[s]-1)-R[i]-1]+1);
}
rep(i,1,num[0]){
bool flag=0;
rep(s,0,bin[tot]-1)
if(f1[s]>=R[0][i-1]&&f2[bin[tot]-1-s]<=R[0][i]+1){flag=1;break;}
rep(j,R[0][i-1]+1,R[0][i]){
if(flag)puts("Possible");else puts("Impossible");
}
}
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 200010
#define MAXS 1000010
using namespace std;
int read(){
char c;
while(((c=getchar())<'0' || c>'9') && c!='-');
int flag=1;
int res=c-'0';
if(c=='-'){
flag=-1;
res=0;
}
while((c=getchar())>='0' && c<='9') res=res*10+c-'0';
return res*flag;
}
int n,m,v0,maxs;
int a[MAXN];
int lim[MAXN];
int f1[MAXS],f2[MAXS];
int p[20][MAXN][2];
void calcP(int l){
int last=1;
for(int i=1;i<=n;i++){
if(i==n || a[i+1]-a[i]>lim[l]){
for(int j=last;j<=i;j++){
p[l][j][0]=last;
p[l][j][1]=i;
}
last=i+1;
}
}
p[l][0][0]=1;
p[l][n+1][1]=n;
}
void dp(){
f1[0]=0; f2[0]=n+1;
for(int s=1;s<maxs;s++){
f2[s]=n+1;
for(int i=1,l=1;i<=m;i++,l<<=1)
if(s&l){
f1[s]=max(f1[s],p[i][f1[s^l]+1][1]);
f2[s]=min(f2[s],p[i][f2[s^l]-1][0]);
}
}
}
namespace Fenwick{
int c[MAXN];
void init(){ memset(c,-1,sizeof c); }
void insert(int x,int y){
x++;
while(x<=n+2){
c[x]=max(c[x],y);
x+=x&(-x);
}
}
int getmax(int x){
x++;
int res=-1;
while(x){
res=max(res,c[x]);
x-=x&(-x);
}
return res;
}
}
int main(){
#ifdef DEBUG
freopen("g012e.in","r",stdin);
#endif
n=read(); v0=read();
for(int i=1;i<=n;i++) a[i]=read();
lim[0]=v0;
while(v0) lim[++m]=(v0/=2);
maxs=1<<m;
for(int i=0;i<=m;i++) calcP(i);
dp();
Fenwick::init();
for(int i=0;i<maxs;i++)
Fenwick::insert(f2[i],f1[(maxs-1)^i]);
for(int i=1;i<=n;i++)
if(p[0][i][0]==i){
int res=Fenwick::getmax(p[0][i][1]+1);
if(res>=i-1)
for(int j=p[0][i][0];j<=p[0][i][1];j++)
puts("Possible");
else
for(int j=p[0][i][0];j<=p[0][i][1];j++)
puts("Impossible");
}
return 0;
}
|
//waz
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;
#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))
int F()
{
char ch;
int x, a;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-');
if (ch == '-') ch = getchar(), a = -1;
else a = 1;
x = ch - '0';
while (ch = getchar(), ch >= '0' && ch <= '9')
x = (x << 1) + (x << 3) + ch - '0';
return a * x;
}
const int N = 1 << 20;
int n, v, x[200010];
int l[22][200010], r[22][200010];
int val[22], cnt, f[N], g[N];
vector<PII> t;
int main()
{
gii(n, v);
for (int i = 1; i <= n; ++i) gi(x[i]);
for (int i = v; ; i = i >> 1)
{
val[++cnt] = i;
for (int j = 1; j <= n; ++j)
{
int k = j;
while (k < n && x[k + 1] - x[k] <= i) ++k;
for (int p = j; p <= k; ++p) l[cnt][p] = j, r[cnt][p] = k;
if (cnt == 1) t.pb(mp(j, k));
j = k;
}
if (!i) break;
}
int all = cnt - 1;
for (int i = 0; i < (1 << all); ++i) g[i] = n + 1;
for (int i = 1; i < (1 << all); ++i)
{
for (int j = 0; j < all; ++j)
if (i & (1 << j))
{
int t = f[i ^ (1 << j)];
f[i] = max(f[i], r[j + 2][t + 1]);
t = g[i ^ (1 << j)];
g[i] = min(g[i], l[j + 2][t - 1]);
}
}
for (auto v : t)
{
bool flag = 0;
int s = (1 << all) - 1;
for (int i = 0; i < (1 << all); ++i)
{
if (f[i] >= v.fi - 1 && v.se + 1 >= g[s ^ i])
flag = 1;
}
for (int i = v.fi; i <= v.se; ++i)
puts(flag ? "Possible" : "Impossible");
}
} |
#include<bits/stdc++.h>
#define FR first
#define SE second
using namespace std;
const int S=(1<<20)+5;
char buf[S],*H,*T;
inline char Get()
{
if(H==T) T=(H=buf)+fread(buf,1,S,stdin);
if(H==T) return -1;return *H++;
}
inline int read()
{
int x=0,fg=1;char c=Get();
while(!isdigit(c)&&c!='-') c=Get();
if(c=='-') fg=-1,c=Get();
while(isdigit(c)) x=x*10+c-'0',c=Get();
return x*fg;
}
typedef pair<int,int> pii;
const int INF=0x3f3f3f3f;
const int N=200010;
int n,V,X[N],dep=0;
int L[20][N],R[20][N];
int exL[N<<4],exR[N<<4];
pii seg[N];
bool ans[N];
int main()
{
n=read();V=read();
for(int i=1;i<=n;i++) X[i]=read();
X[0]=-INF-V-1;X[n+1]=INF+V+1;
for(int v=V;v>=0;v>>=1,dep++)
{
R[dep][n+1]=n+1;
for(int i=1;i<=n;i++) L[dep][i]=(X[i]-X[i-1]<=v)?L[dep][i-1]:i;
for(int i=n;i>=1;i--) R[dep][i]=(X[i+1]-X[i]<=v)?R[dep][i+1]:i;
if(v==0){dep++;break;}
}
for(int i=1;i<=n;i++) seg[i]=pii(L[0][i],R[0][i]);
int cnt=unique(seg+1,seg+1+n)-(seg+1);
for(int i=0;i<(1<<dep);i++) exR[i]=n+1;
for(int s=0;s<(1<<dep);s+=2)
for(int i=0;i<dep;i++)
{
if(!(s&(1<<i))) continue;
exL[s]=max(exL[s],R[i][exL[s^(1<<i)]+1]);
exR[s]=min(exR[s],L[i][exR[s^(1<<i)]-1]);
}
if(cnt>dep) goto output;
for(int i=1;i<=cnt;i++)
for(int s=0;s<(1<<dep);s+=2)
if(exL[s]>=seg[i].FR-1&&exR[(1<<dep)-1-s-1]<=seg[i].SE+1)
{
for(int j=seg[i].FR;j<=seg[i].SE;j++) ans[j]=1;
break;
}
output: for(int i=1;i<=n;i++) puts(ans[i]?"Possible":"Impossible");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, V;
int x[maxn], v[maxn];
int dp_pre[1<<19], dp_suf[1<<19], ok[maxn];
int rig[maxn][20];
void cal_dp(int *dp) {
for (int i = n; i >= 1; i--) {
for (int j = 0; j < 20; j++) {
if (j && !v[j-1]) {
rig[i][j] = i-1;
continue;
}
rig[i][j] = i;
if (i + 1 <= n && x[i + 1] - x[i] <= v[j]) {
rig[i][j] = rig[i+1][j];
}
}
}
for (int j = 0; j < 20; j++) rig[n + 1][j] = n;
for (int i = 1; i < (1 << 18); i++) {
for (int j = 0; j < 18; j++) {
if (i & (1 << j)) {
dp[i] = max(dp[i], rig[dp[i ^ (1 << j)] + 1][j]);
}
}
}
}
int main() {
scanf("%d%d", &n, &V);
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
v[0] = V / 2;
for (int i = 1; i <= 20; i++) v[i] = v[i-1] / 2;
cal_dp(dp_pre);
reverse(x + 1, x + n + 1);
for (int i = 1; i <= n; i++) x[i] = - x[i];
cal_dp(dp_suf);
reverse(x + 1, x + n + 1);
for (int i = 1; i <= n; i++) x[i] = - x[i];
for (int i = 1; i <= n; i++) {
int l = i, r = i;
while (r + 1 <= n && x[r + 1] - x[r] <= V) ++ r;
int _ok = 0;
for (int j = 0; j < (1 << 18); j++) {
if (dp_pre[j] >= l-1 && dp_suf[(~j)&((1<<18)-1)] >= n-r) {
_ok = 1;
}
}
if (_ok) for (int j = l; j <= r; j++) ok[j] = 1;
i = r;
}
for (int i = 1; i <= n; i++) {
if (ok[i]) puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 200010
#define LG 25
int R[LG][MAXN],L[LG][MAXN],fl[4194304],fr[4194304];
int V[LG],cnt,X[MAXN],lg,tot,n,x[MAXN];
void Min(int &x,int y)
{
if(x>y) x=y;
}
void Max(int &x,int y)
{
if(x<y) x=y;
}
int main()
{
scanf("%d%d",&n,&V[0]);
for(int i=1;i<=n;i++)
scanf("%d",&x[i]);
while(V[lg])
V[++lg]=V[lg-1]/2;
for(int i=0;i<=lg;i++)
{
int ls=0;
for(int j=2;j<=n+1;j++)
if(x[j]-x[j-1]>V[i]||j==n+1)
{
for(int k=ls;k<j-1;k++)
L[i][k]=j-1;
for(int k=ls+2;k<=j;k++)
R[i][k]=ls+1;
ls=j-1;
if(i==0) X[++cnt]=j-1;
}
}
if(cnt>lg+1)
{
for(int i=1;i<=n;i++)
printf("Impossible\n");
return 0;
}
tot=1<<(lg+1);
for(int i=0;i<tot;i+=2)
fr[i]=n+1;
for(int i=0;i<tot;i+=2)
for(int j=1;j<=lg;j++)
if((i&(1<<j))==0)
{
Max(fl[i|(1<<j)],L[j][fl[i]]);
Min(fr[i|(1<<j)],R[j][fr[i]]);
}
for(int i=1;i<=cnt;i++)
{
bool flag=0;
for(int j=0;j<tot;j+=2)
if(fl[j]>=X[i-1]&&fr[tot-j-2]<=X[i]+1)
{
flag=1;
break;
}
for(int j=X[i-1]+1;j<=X[i];j++)
if(flag) printf("Possible\n");
else printf("Impossible\n");
}
} |
#include<bits/stdc++.h>
const int N=533333;
int n,V,vs[20],vp=0,mx,xs[N],f1[N],f2[N],ls[20][N],rs[20][N],ml[N];
void maxs(int&a,int b){if(a<b)a=b;}
void mins(int&a,int b){if(a>b)a=b;}
int main(){
scanf("%d%d",&n,&V);
for(int i=1;i<=n;++i)scanf("%d",xs+i);
for(int a=V>>1;vs[vp++]=a;a>>=1);
mx=1<<vp,vs[vp]=V;
for(int z=0;z<=vp;++z){
rs[z][n+1]=n,ls[z][0]=1;
for(int i=1,j=1,x=vs[z];i<=n;i=j){
for(++j;j<=n&&xs[j]-xs[j-1]<=x;++j);
for(int k=i;k<j;++k)ls[z][k]=i,rs[z][k]=j-1;
}
}
for(int i=0;i<mx;++i)f2[i]=n+1;
for(int i=1;i<mx;++i){
for(int j=0;j<vp;++j)if(i>>j&1){
maxs(f1[i],rs[j][f1[i-(1<<j)]+1]);
mins(f2[i],ls[j][f2[i-(1<<j)]-1]);
}
}
for(int i=0;i<mx;++i)maxs(ml[f2[mx-1-i]-1],f1[i]+1);
for(int i=0;i<=n;++i)maxs(ml[i+1],ml[i]);
for(int i=1;i<=n;++i)puts(ml[rs[vp][i]]>=ls[vp][i]?"Possible":"Impossible");
return 0;
} |
#include <algorithm>
#include <cstdio>
int pre[200005][25], nxt[200005][25], dp_l[800005], dp_r[800005], arr[200005];
int main()
{
// freopen("AGC012-F.in", "r", stdin);
int n, v, len = 0;
scanf("%d%d", &n, &v);
for (int i = 1; i <= n; i++)
scanf("%d", arr + i);
while (true)
{
pre[0][len] = pre[1][len] = 0;
for (int i = 2; i <= n; i++)
pre[i][len] = arr[i] - arr[i - 1] <= v ? pre[i - 1][len] : i - 1;
nxt[n + 1][len] = nxt[n][len] = n + 1;
for (int i = n - 1; i >= 1; i--)
nxt[i][len] = arr[i + 1] - arr[i] <= v ? nxt[i + 1][len] : i + 1;
len++;
if (!v)
break;
v >>= 1;
}
for (int i = 0; i < 1 << len; i++)
{
dp_l[i] = 1;
dp_r[i] = n;
}
for (int i = 0; i < 1 << len; i++)
{
for (int j = 0; j < len; j++)
{
if (i & (1 << j))
continue;
dp_l[i | (1 << j)] = std::max(dp_l[i | (1 << j)], nxt[dp_l[i]][j]);
dp_r[i | (1 << j)] = std::min(dp_r[i | (1 << j)], pre[dp_r[i]][j]);
}
}
if (dp_l[(1 << len) - 1] <= n)
{
for (int i = 0; i < n; i++)
puts("Impossible");
return 0;
}
for (int l = 1; l <= n; l = nxt[l][0])
{
bool flg = false;
for (int i = 0; i < 1 << len && !flg; i++)
{
if (i & 1)
continue;
if (l <= dp_l[i] && dp_r[(1 << len) - 1 ^ i ^ 1] < nxt[l][0])
flg = true;
}
for (int i = l; i < nxt[l][0]; i++)
puts(flg ? "Possible" : "Impossible");
}
return 0;
}
|
#include <bits/stdc++.h>
#define ctz __builtin_ctz
typedef std::pair <int, int> pr;
const int N = 200054, LN = 20, LN2 = 262154;
int n, V, ALL, cnt = 0;
int x[N];
int L[LN][N], R[LN][N];
int f[LN2], g[LN2];
pr seg[LN2], qry[LN2];
inline void up(int &x, const int y) {x < y ? x = y : 0;}
inline void down(int &x, const int y) {x > y ? x = y : 0;}
int main() {
int i, j, S, layer;
scanf("%d%d", &n, &V);
for (i = 0; i < n; ++i) scanf("%d", x + i);
for (layer = 0; ; V >>= 1, ++layer) {
int *l = L[layer], *r = R[layer];
for (*l = 0, i = 1; i < n; ++i) l[i] = (x[i] <= x[i - 1] + V ? l[i - 1] : i);
for (--i, r[i] = i; --i >= 0; ) r[i] = (x[i] >= x[i + 1] - V ? r[i + 1] : i);
if (!V) break;
}
ALL = ~(-1 << layer);
std::fill(g, g + (ALL + 1), n - 1);
for (i = 0; i <= ALL; ++i)
for (S = ALL ^ i; S; S &= S - 1)
j = ctz(S),
up(f[i | 1 << j], f[i] == n ? n : R[j + 1][f[i]] + 1),
down(g[i | 1 << j], (~g[i] ? L[j + 1][g[i]] : 0) - 1);
for (i = 0; i <= ALL; ++i) seg[i] = pr(g[i], -f[ALL ^ i]);
std::sort(seg, seg + (ALL + 1));
qry[cnt++] = pr(seg->first, -seg->second);
for (i = 1; i <= ALL; ++i)
if (seg[i].second < seg[i - 1].second) qry[cnt++] = pr(seg[i].first, -seg[i].second);
for (i = 0; i < n; ) {
j = R[0][i], S = std::lower_bound(qry, qry + cnt, pr(j, INT_MAX)) - qry - 1;
if (S >= 0 && i <= qry[S].second)
for (; i <= j; ++i) puts("Possible");
else
for (; i <= j; ++i) puts("Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 400005
#define MAXLOG 20
int n, k, v[MAXLOG], x[MAXN];
int l[MAXLOG][MAXN], r[MAXLOG][MAXN];
int lft[MAXN], rit[MAXN], opt[MAXN];
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
x *= f;
}
int main() {
read(n), read(v[0]);
for (int i = 1; i <= n; i++)
read(x[i]);
for (k = 1; v[k - 1] != 0; k++)
v[k] = v[k - 1] / 2;
k -= 1; int goal = (1 << k) - 1;
for (int j = 0; j <= k; j++) {
l[j][1] = 1;
for (int i = 2; i <= n; i++)
if (x[i] - x[i - 1] <= v[j]) l[j][i] = l[j][i - 1];
else l[j][i] = i;
}
for (int j = 0; j <= k; j++) {
r[j][n] = n;
for (int i = n - 1; i >= 1; i--)
if (x[i + 1] - x[i] <= v[j]) r[j][i] = r[j][i + 1];
else r[j][i] = i;
}
for (int curr = 0; curr <= goal; curr++) {
lft[curr] = 0;
rit[curr] = n + 1;
}
for (int curr = 0; curr < goal; curr++)
for (int i = 1, j = 1; i <= k; i++, j <<= 1) {
if (curr & j) continue;
int dest = curr | j;
lft[dest] = max(lft[dest], min(r[i][lft[curr] + 1], n));
rit[dest] = min(rit[dest], max(l[i][rit[curr] - 1], 1));
}
for (int i = 0; i <= n; i++)
opt[i] = n + 2;
for (int curr = 0; curr <= goal; curr++)
opt[lft[curr]] = min(rit[goal ^ curr], opt[lft[curr]]);
for (int i = n - 1; i >= 0; i--)
opt[i] = min(opt[i], opt[i + 1]);
for (int i = 1; i <= n; i++) {
int lft = l[0][i];
int rit = r[0][i];
if (opt[lft - 1] <= rit + 1) printf("Possible\n");
else printf("Impossible\n");
}
return 0;
} |
#include<bits/stdc++.h>
const int MN=300000+5;
using namespace std;
typedef long long ll;
template<typename T>inline T&IN(T&in){
in=0;char c=getchar();int f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))in=in*10+c-'0',c=getchar();
return in*=f;
}
int n,V;
int l[20][MN],r[20][MN];
int fr[MN],fl[MN],s[MN];ll x[MN];
void input(){
IN(n),IN(V);
for(int i=1;i<=n;++i)IN(x[i]);
int k;x[0]=LLONG_MIN/10,x[n+1]=LLONG_MAX/10;
for(k=0;V;++k,V>>=1){
for(int i=1;i<=n;++i)l[k][i]=x[i]-x[i-1]>V?i:l[k][i-1];
for(int i=n;i>=1;--i)r[k][i]=x[i+1]-x[i]>V?i:r[k][i+1];
l[k][0]=1,r[k][n+1]=n;
}
for(int i=1;i<=n;++i)l[k][i]=x[i]-x[i-1]>V?i:l[k][i-1];
for(int i=n;i>=1;--i)r[k][i]=x[i+1]-x[i]>V?i:r[k][i+1];
l[k][0]=1,r[k][n+1]=n;
fr[0]=n+1;
for(int st=1;st<(1<<k);++st){
fr[st]=n;
for(int i=0;i<k;++i)if(st>>i&1){
fl[st]=max(fl[st],r[i+1][fl[st^(1<<i)]+1]);
fr[st]=min(fr[st],l[i+1][fr[st^(1<<i)]-1]);
}
}
for(int st=0;st<(1<<k);++st){
int L=l[0][fr[((1<<k)-1)^st]-1],R=r[0][fl[st]+1];
if(L<=R)s[L]++,s[R+1]--;
}
for(int i=1;i<=n;++i){
s[i]+=s[i-1];
puts(s[i]?"Possible":"Impossible");
}
}
int main(){
input();
return 0;
} |
#include <cstdio>
#include <algorithm>
#define mp(x,y) make_pair(x,y)
#define ft first
#define sd second
#define rep(i,l,r) for (int i=l;i<=r;++i)
#define P pair<int ,int >
using namespace std;
const int N =2e5+10;
void read(int &x)
{
x=0;
char ch=getchar();int f=1;
while (ch<'0'||ch>'9') ch=='-'?f=-1:0,ch=getchar();
while ('0'<=ch&&ch<='9') x=x*10+ch-'0',ch=getchar();
x*=f;
}
int n,bo[N],tot,m,a[N],top,v[233],l[N][20],r[N][20],f[1<<20],g[1<<20],cnt,tmp;
P b[N<<1];
void _mx(int &x,int y)
{
x=max(x,y);
}
void _mn(int &x,int y)
{
x=min(x,y);
}
int main()
{
read(n);read(m);
rep(i,1,n) read(a[i]);
for (;v[top++]=m;m>>=1);
rep(i,0,top)
{
int lst=1;
rep(j,2,n) if (a[j]-a[j-1]>v[i])
{
rep(k,lst,j-1) l[k][i]=lst,r[k][i]=j-1;
lst=j;
}
rep(k,lst,n) l[k][i]=lst,r[k][i]=n;
}
tot=1<<top;--tot;rep(i,0,tot) g[i]=n+1;
rep(i,0,tot) rep(j,0,top)
if (!(i&1<<j)) _mx(f[i|1<<j] ,r[f[i]+1][j]),_mn(g[i|1<<j] ,l[g[i]-1][j]);
rep(i,0,tot) if (!(i&1)) b[++cnt]=mp(g[i],i);
rep(i,1,n) b[++cnt]=mp(r[i][0]+1,(1<<top)+i);
sort(b+1,b+1+cnt);tmp=-1;
rep(i,1,cnt) if (b[i].sd>(1<<top))
{
b[i].sd-=(1<<top);
if (tmp>=l[b[i].sd][0]-1) bo[b[i].sd]=1;
}else _mx(tmp,f[((1<<top)-2)^b[i].sd]);
rep(i,1,n) printf("%s\n",bo[i]?"Possible":"Impossible");
return 0;
} |
#include<bits/stdc++.h>
using namespace std ;
#define rep( i, s, t ) for( register int i = s; i <= t; ++ i )
#define re register
int gi() {
char cc = getchar() ; int cn = 0, flus = 1 ;
while( cc < '0' || cc > '9' ) { if( cc == '-' ) flus = - flus ; cc = getchar() ; }
while( cc >= '0' && cc <= '9' ) cn = cn * 10 + cc - '0', cc = getchar() ;
return cn * flus ;
}
const int N = 2e5 + 5 ;
const int M = 15 + 5 ;
int n, m, w[M], cnt, a[N], st[N], top, Go[M][N], dp[1 << M][M], W[N] ;
signed main()
{
n = gi(), m = gi() ;
rep( i, 1, n ) a[i] = gi() ;
while( m ) w[++ cnt] = m, m = m / 2 ;
w[++ cnt] = 0 ;
int r = 1 ;
for( re int k = 1; k <= cnt; ++ k ) {
r = 1 ; int befr = 0 ;
for( re int i = 1; i <= n; ++ i ) {
r = max( r, i ) ;
while( r < n && a[r + 1] - a[max( i, r )] <= w[k] ) ++ r ;
Go[k][i] = r ;
if( ( k == 1 ) && ( r != befr ) ) st[++ top] = r, W[r] = top, befr = r ;
}
}
if( top > cnt ) {
rep( i, 1, n ) puts("Impossible") ;
exit(0) ;
}
int maxn = ( 1 << cnt ) - 1 ; dp[0][0] = 0 ;
rep( i, 1, cnt ) Go[i][n + 1] = n ;
for( re int i = 0; i < maxn; ++ i ) {
rep( t, 0, top ) {
for( re int j = 1; j <= cnt; ++ j ) {
int k = ( 1 << ( j - 1 ) ) ;
if( ( i & k ) ) continue ;
if( j == 1 && t == 0 ) {
dp[i ^ k][W[Go[j][dp[i][t] + 1]]] = max( dp[i ^ k][W[Go[j][dp[i][t] + 1]]], Go[j][dp[i][t] + 1] ) ;
}
else if( j != 1 ) dp[i ^ k][t] = max( dp[i ^ k][t], Go[j][dp[i][t] + 1] ) ;
}
}
}
rep( i, 1, n ) {
if( dp[maxn][W[Go[1][i]]] >= n ) puts("Possible") ;
else puts("Impossible") ;
}
return 0 ;
}
|
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const int MAXS = (1 << 18) + 5;
const int INF = 0x3f3f3f3f;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') flag = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
AKNOI = flag * x;
}
template <typename T> inline void cmax(T &x, T y) {
if (x < y) x = y;
}
int n, V, x[MAXN], ok[MAXN];
int v[20], m, S;
struct Work {
int lbd[MAXN], rbd[20][MAXN], cnt[20];
int dp[MAXS];
void work() {
for (int i = 0; i <= m; ++i) {
for(int j = 1, lst = 0; j <= n; ++j){
if (j < n && abs(x[j + 1] - x[j]) <= v[i]) continue;
for (int k = lst + 1; k <= j; ++k) {
rbd[i][k] = j;
if (i == m) lbd[k] = lst + 1;
}
lst = j;
}
}
for (int s = 0; s < S; ++s) {
for (int i = 0; i < m; ++i) {
if ((s >> i) & 1) continue;
cmax(dp[s | (1 << i)], rbd[i][dp[s] + 1]);
}
}
}
} L, R;
void init() {
read(n); read(V);
for (int i = n; i >= 1; --i) {
read(x[i]);
}
for (; V; V /= 2) {
v[m++] = V;
}
v[m] = 0;
reverse(v, v + m + 1);
S = (1 << m);
}
void solve() {
R.work();
reverse(x + 1, x + n + 1);
L.work();
for (int s = 0; s < S; ++s) {
int l = min(n, L.dp[s] + 1), r = max(1, n - R.dp[(S - 1) ^ s]);
if (l > r) {
mset(ok, -1); break;
} else if (L.rbd[m][l] == L.rbd[m][r]) {
ok[L.rbd[m][r]] = 1;
}
}
for (int i = 1; i <= n; ++i) {
puts(ok[L.rbd[m][i]]? "Possible" :"Impossible");
}
}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define IN inline
#define RE register
#define F first
#define S second
#define N 400005
#define mod 998244353
#define INF 0x3f3f3f3f
int n,v,x[N],vl[22],k=0,pf[22][N],pb[22][N],dpf[N],dpb[N],lf[N];
int main(){
scanf("%d%d",&n,&v);
for(int i=v;i;i>>=1) vl[k++]=i;
vl[k]=0;
reverse(vl,vl+k+1);
for(int i=1;i<=n;++i) scanf("%d",x+i);
for(int i=0;i<=k;++i){
pf[i][1]=1;
for(int j=2;j<=n;++j){
if(x[j]-x[j-1]<=vl[i]) pf[i][j]=pf[i][j-1];
else pf[i][j]=j;
}
pf[i][n+1]=n;
pb[i][n]=n;
for(int j=n-1;j;--j){
if(x[j+1]-x[j]<=vl[i]) pb[i][j]=pb[i][j+1];
else pb[i][j]=j;
}
pb[i][0]=1;
}
dpf[0]=0;
memset(dpb,63,sizeof(dpb));
dpb[0]=n+1;
for(int msk=0;msk<(1<<k);++msk){
for(int i=0;i<k;++i) if(!(msk&1<<i)){
dpf[msk|1<<i]=max(dpf[msk|1<<i],pb[i][dpf[msk]+1]);
dpb[msk|1<<i]=min(dpb[msk|1<<i],pf[i][dpb[msk]-1]);
}
}
for(int msk=0,dmsk=(1<<k)-1;dmsk>=0;++msk,--dmsk)
lf[dpb[dmsk]-1]=max(lf[dpb[dmsk]-1],dpf[msk]+1);
for(int i=1;i<=n;++i) lf[i]=max(lf[i],lf[i-1]);
for(int i=1;i<=n;++i){
if(lf[pb[k][i]]>=pf[k][i]) puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<queue>
#define LL long long
#define NJ !((i>>(j-1))&1)
#define SJ i^(1<<(j-1))
using namespace std;
inline int read( )
{
int sum=0;char c=getchar( );bool f=0;
while(c<'0'||c>'9') {if(c=='-') f=1;c=getchar( );}
while(c>='0'&&c<='9') {sum=sum*10+c-'0';c=getchar( );}
if(f) return -sum;
return sum;
}
const int K=200005;
const int N=25;
const int M=(1<<19)+5;
int n,V,X[K],s[N],f[M],g[M];
int tot,L[K][N],R[K][N],FM[K];
inline void MX(int &x,int y) {if(y>x) x=y;}
inline void MN(int &x,int y) {if(y<x) x=y;}
int main( )
{
int i,j,x,y,t;
n=read( );V=read( );
for(i=1;i<=n;i++) X[i]=read( );
for(j=V;;j>>=1)
{
s[++tot]=j;
for(i=1,t=1;i<=n;i++)
{
t=max(t,i);
while(t<n&&X[t+1]-X[t]<=j) t++;
L[i][tot]=t;
}
L[n+1][tot]=n;
for(i=n,t=n;i>=1;i--)
{
t=min(t,i);
while(t>1&&X[t]-X[t-1]<=j) t--;
R[i][tot]=t;
}
R[0][tot]=1;
if(!j) break;
}
int S=1<<tot;
for(i=0;i<S;i++) g[i]=n+1;
for(i=0;i<S;i++)
for(x=f[i],y=g[i],j=1;j<=tot;j++)
if(NJ) MX(f[SJ],L[x+1][j]),MN(g[SJ],R[y-1][j]);
int ALL=S-2,MF=-n;
for(i=0;i<=n+1;i++) FM[i]=-n;
for(j=1,i=0;i<=ALL;i++)
if(NJ) x=(!g[i])?0:((g[i]==n+1)?n+1:g[i]),MX(FM[x],f[ALL-i]);
for(t=0,i=1;i<=n;i++)
{
while(t<=n+1&&L[i][1]+1>=t) MX(MF,FM[t]),t++;
puts(R[i][1]<=MF+1?"Possible":"Impossible");
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
static const int NMAX = 200000;
static const int MMAX = 18;
static int N, M, X[NMAX];
static int A[1 << (1 + MMAX)];
static int B[1 << (1 + MMAX)];
static int Y[NMAX + 1][1 + MMAX];
static void solve(int *C) {
for(int m = 0; m <= M; m++) Y[N][m] = N;
for(int i = N; --i > 0; ) {
for(int m = 0; m <= M; m++) Y[i][m] = (m < X[i] ? i : Y[i + 1][m]);
}
for(int mask = 1; mask < (1 << (1 + M)); mask++) {
int ret = 0;
for(int i = 0; i <= M; i++) {
if((mask & (1 << i)) == 0) continue;
auto tmp = C[mask ^ (1 << i)];
if(tmp == N) {
ret = N;
break;
}
tmp = Y[tmp + 1][i];
if(tmp > ret) {
ret = tmp;
if(ret == N) break;
}
}
C[mask] = ret;
}
}
int main() {
scanf("%d%d", &N, &M);
for(int i = 0; i < N; i++) scanf("%d", X + i);
{
vector<int> v;
for(; ; M >>= 1) {
v.push_back(M);
if(M == 0) break;
}
M = v.size() - 1;
reverse(begin(v), end(v));
for(int i = N; --i > 0; ) {
X[i] = lower_bound(begin(v), end(v), X[i] - X[i - 1]) - begin(v);
}
}
solve(A);
if(A[(1 << (1 + M)) - 1] != N) {
for(int i = 0; i < N; i++) puts("Impossible");
} else {
vector<int> v;
for(int i = 0; i < N; ) {
auto j = Y[i + 1][M];
v.push_back(j - i);
i = j;
}
reverse(X + 1, X + N);
solve(B);
int l = 0;
for(auto s : v) {
auto z = false;
for(int i = 0; i < (1 << M); i++) {
if(A[i] < l) continue;
auto j = ((1 << M) - 1) ^ i;
if(B[j] >= N - (l + s)) {
z = true;
break;
}
}
for(int i = 0; i < s; i++) puts(z ? "Possible" : "Impossible");
l += s;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=200005,M=20;
int cnt,ans[N],n,m,x[N],a[M],tot,le[M][N],ri[M][N],dp1[1<<M],dp2[1<<M];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)scanf("%d",&x[i]);
while (m){
a[++tot]=m;
m/=2;
}
reverse(a+1,a+tot+1);
for (int i=0;i<=tot;i++)
for (int j=1;j<=n;j++)
if (j==1||x[j]-x[j-1]>a[i])le[i][j]=j;
else le[i][j]=le[i][j-1];
for (int i=0;i<=tot;i++)
for (int j=n;j;j--)
if (j==n||x[j+1]-x[j]>a[i])ri[i][j]=j;
else ri[i][j]=ri[i][j+1];
for (int i=1;i<1<<tot;i++)
for (int j=0;j<tot;j++)
if (i&(1<<j)){
int t=dp1[i^(1<<j)];
if (t==n)dp1[i]=n;
else dp1[i]=max(dp1[i],ri[j][t+1]);
}
for (int i=0;i<1<<tot;i++)dp2[i]=n+1;
for (int i=1;i<1<<tot;i++)
for (int j=0;j<tot;j++)
if (i&(1<<j)){
int t=dp2[i^(1<<j)];
if (t==1)dp2[i]=1;
else dp2[i]=min(dp2[i],le[j][t-1]);
}
for (int i=1;i<=n;i++)
if (ans[le[tot][i]]){
if (ans[le[tot][i]]==1)puts("Possible");
else puts("Impossible");
}
else {
cnt++;
if (cnt>20){
puts("Impossible");
continue;
}
ans[le[tot][i]]=2;
for (int j=0;j<1<<tot;j++)
if (dp1[j]>=le[tot][i]-1&&dp2[((1<<tot)-1)^j]<=ri[tot][i]+1)ans[le[tot][i]]=1;
if (ans[le[tot][i]]==1)puts("Possible");
else puts("Impossible");
}
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
#define N 220000
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
#define S 1<<19
inline int read(){
int x=0,f=1;char ch=gc();
while (ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();}
while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
return x*f;
}
int f1[S],f2[S],n,num,bin[20],st[N],a[N],right[N][20],left[N][20],v;
int main(){
n=read();v=read();int Log=0;
for (int i=1;i<=n;++i) a[i]=read();
while ((1<<Log)<=v) Log++;Log++;
for (int i=0;i<=Log+1;++i) bin[i]=1<<i;
num=1;for (int i=2;i<=n;++i) if (a[i]-a[i-1]>v) num++;
for (int j=0;j<Log;++j){
left[1][j]=1;right[n][j]=n;
for (int i=2;i<=n;++i) if (a[i]-a[i-1]>(v>>j)) left[i][j]=i;else left[i][j]=left[i-1][j];
for (int i=n-1;i>=1;--i) if (a[i+1]-a[i]>(v>>j)) right[i][j]=i;else right[i][j]=right[i+1][j];
}
if (num>Log){
for (int i=1;i<=n;++i) printf("Impossible\n");return 0;
}
for (int s=0;s<=bin[Log]-1;++s) {f1[s]=0,f2[s]=n+1;}
for (int s=0;s<=bin[Log]-1;++s){
for (int i=0;i<Log;++i){
if (s&bin[i])continue;
if (f1[s]==n) f1[s|bin[i]]=n;else f1[s|bin[i]]=max(f1[s|bin[i]],right[f1[s]+1][Log-i-1]);
if (f2[s]==1) f2[s|bin[i]]=1;else f2[s|bin[i]]=min(f2[s|bin[i]],left[f2[s]-1][Log-i-1]);
}
}for (int i=0;i<=n;++i) st[i]=n+2;
for (int s=0;s<=bin[Log-1]-1;++s){
int s1=(bin[Log-1]-1)^s;
st[f1[s]]=min(st[f1[s]],f2[s1]);
} for (int i=n-1;i>=0;--i) st[i]=min(st[i],st[i+1]);
for (int i=1;i<=n;++i){
int l=left[i][0],r=right[i][0];
if (st[l-1]<=r+1) printf("Possible\n");else printf("Impossible\n");
}
return 0;
} |
#include <bits/stdc++.h>
#define maxn 801000
using namespace std;
int mark[maxn];
int lb[maxn][21], rb[maxn][21];
int L[maxn], R[maxn], fa[maxn], p[maxn];
int x[maxn];
int v[21];
int fl[maxn], fr[maxn];
int tp;
int n, m;
int find(int a) {
return (fa[a] == a ? a : (fa[a] = find(fa[a])));
}
bool cmp(int a, int b) {
return (x[a + 1] - x[a] < x[b + 1] - x[b]);
}
int main() {
scanf("%d %d",&n,&m);
for (int i = 1; i <= n; i++) scanf("%d",&x[i]);
tp = 0;
for (; m; m >>= 1) v[tp++] = m;
v[tp++] = 0;
for (int i = 1; i <= n; i++) L[i] = R[i] = fa[i] = i;
for (int i = 1; i < n; i++) p[i] = i;
int q = 1;
sort(p + 1, p + n, cmp);
for (int t = tp - 1; t >= 0; t--) {
while (q < n && x[p[q] + 1] - x[p[q]] <= v[t]) {
int a = p[q], b = p[q] + 1;
a = find(a); b = find(b);
R[fa[a]] = R[fa[b]];
fa[fa[b]] = fa[a];
q++;
}
for (int i = 1; i <= n; i++) {
lb[i][t] = L[find(i)];
rb[i][t] = R[find(i)];
}
}
for (int u = 0; u < tp; u++) {
lb[n + 1][u] = n;
rb[0][u] = 1;
}
for (int st = 0; st < (1 << tp); st++) {
fr[st] = n + 1;
for (int u = 0; u < tp; u++) {
if (!(st >> u & 1)) continue;
fl[st] = max(fl[st], rb[fl[st ^ (1 << u)] + 1][u]);
fr[st] = min(fr[st], lb[fr[st ^ (1 << u)] - 1][u]);
}
}
for (int st = 0; st < (1 << tp); st++) {
if (st & 1) continue;
int l = fl[st];
int r = fr[((1 << tp) - 1) ^ 1 ^ st];
if (l >= r - 1) { mark[1]++; continue; }
if (rb[l + 1][0] >= r - 1) {
mark[lb[l + 1][0]]++;
mark[rb[l + 1][0] + 1]--;
}
}
for (int i = 1; i <= n; i++) {
mark[i] += mark[i - 1];
if (mark[i] > 0) printf("Possible\n");
else printf("Impossible\n");
}
return 0;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <algorithm>
#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 400010;
int n, p, V, X[N];
int tor[N][20], tol[N][20];
int dpl[N], dpr[N], cnt[N];
int main(){
scanf("%d%d", &n, &V);
For(i, 1, n) scanf("%d", &X[i]);
X[0] = -2e9, X[n + 1] = 2e9;
For(i, 0, 19){
int l = 1;
For(j, 1, n)
if(1ll * X[j + 1] - X[j] > V){
For(k, l, j) tol[k][i] = l, tor[k][i] = j;
l = j + 1;
}
tor[n + 1][i] = tor[0][i] = n + 1;
tol[0][i] = tor[n + 1][i] = 0;
if(!V){
p = i;
break;
}
V >>= 1;
}
int S = (1 << p) - 1;
dpl[0] = 0;
For(i, 1, S){
dpl[i] = 0;
For(j, 1, p) if(i & (1 << (j - 1))) dpl[i] = max(dpl[i], tor[dpl[i ^ (1 << (j - 1))] + 1][j]);
}
dpr[0] = n + 1;
For(i, 1, S){
dpr[i] = n + 1;
For(j, 1, p) if(i & (1 << (j - 1))) dpr[i] = min(dpr[i], tol[dpr[i ^ (1 << (j - 1))] - 1][j]);
}
For(i, 0, S){
int L = dpl[i] + 1, R = dpr[S ^ i] - 1;
if(tor[L][0] >= R) cnt[tol[L][0]]++, cnt[tor[R][0] + 1]--;
}
For(i, 1, n){
cnt[i] += cnt[i - 1];
if(cnt[i]) puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define ll long long
ll n,v,a[2000005],sta[2000005],l[20][400005],r[20][400005],L[2000005],R[2000005],ans[2000005],top;
int main(){
scanf("%lld%lld",&n,&v);
for(ll i=1;i<=n;i++) scanf("%lld",&a[i]);
ll m=v;
while(m) m>>=1,sta[top++]=m;
sta[top]=v;
for(ll i=0;i<=top;i++){
l[i][1]=1;r[i][n]=n;
for(ll t=2;t<=n;t++) l[i][t]=(a[t]-a[t-1]<=sta[i])?l[i][t-1]:t;
for(ll t=n-1;t>=1;t--) r[i][t]=(a[t+1]-a[t]<=sta[i])?r[i][t+1]:t;
}
for(ll i=0;i<1<<top;i++) R[i]=n+1;
for(ll i=0;i<1<<top;i++){
for(ll t=0;t<=top;t++){
if((i>>t)&1)continue;
L[(1<<t)|i]=max(L[(1<<t)|i],r[t][L[i]+1]);
R[(1<<t)|i]=min(R[(1<<t)|i],l[t][R[i]-1]);
}
}
for(ll i=1;i<=n;i++){
ll fg=0;
for(ll t=0;t<1<<top;t++){
ll ano=((1<<top)-1)^t;
if(L[t]>=i-1&&R[ano]<=r[top][i]+1){fg=1;break;}
}
for(ll t=i;t<=r[top][i];t++) ans[t]=fg;
i=r[top][i];
}
for(ll i=1;i<=n;i++){
if(ans[i]) printf("Possible\n");
else printf("Impossible\n");
}
} |
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
const int NMAX = 300000;
const int LOGN = 20;
int V[LOGN];
int Lmost[NMAX][LOGN], Rmost[NMAX][LOGN];
int dpL[1<<LOGN], dpR[1<<LOGN];
int arr[NMAX+1];
int dp[NMAX+2];
int main(){
int N; scanf("%d%d",&N,&V[0]);
for(int i=1;i<=N;i++) scanf("%d",arr+i);
int M = 1;
while(V[M-1]){
V[M] = V[M-1]/2;
M++;
}
for(int i=0;i<M;i++){
int v = V[i];
int j = 1;
while(j<=N){
int k = j+1;
while(k<=N && arr[k]-arr[k-1] <= v) k++;
for(int x=j;x<k;x++) Rmost[x][i] = k-1;
j = k;
}
j = N;
while(j>=1){
int k = j-1;
while(k>=1 && arr[k+1]-arr[k] <= v) k--;
for(int x=j;x>k;x--) Lmost[x][i] = k+1;
j = k;
}
}
for(int i=0;i<(1<<M);i++) dpR[i] = N+1;
for(int i=1;i<(1<<M);i++){
for(int j=0;j<M;j++) if(i&(1<<j)){
// use V[j]
int L = dpL[i^(1<<j)];
dpL[i] = max(dpL[i], Rmost[L+1][j]);
int R = dpR[i^(1<<j)];
dpR[i] = min(dpR[i], Lmost[R-1][j]);
}
}
for(int i=0;i<=N+1;i++) dp[i] = -0x3fFFffFF;
for(int i=0;i<(1<<M);i+=2){
int j = ((1<<M)-1)^i^1;
dp[dpR[j]] = max(dp[dpR[j]], dpL[i]);
}
for(int i=1;i<=N+1;i++)
dp[i] = max(dp[i], dp[i-1]);
for(int i=1;i<=N;i++){
int L = Lmost[i][0], R = Rmost[i][0];
int det = dp[R+1];
if(det>=L-1) printf("Possible\n");
else printf("Impossible\n");
}
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MN 200005
#define MM (1<<18)
#define ML 19
using namespace std;
inline int in(){
int x=0;bool f=0; char c;
for (;(c=getchar())<'0'||c>'9';f=c=='-');
for (x=c-'0';(c=getchar())>='0'&&c<='9';x=(x<<3)+(x<<1)+c-'0');
return f?-x:x;
}
int L[ML][MN],R[ML][MN],f[MM],g[MM],x[MN];
bool vis[MM];
int n,v,j,val;
int main()
{
n=in();v=in();
for (int i=1;i<=n;++i) x[i]=in();
for (j=0,val=v;;val>>=1,++j){
L[j][0]=L[j][1]=1;
R[j][n]=R[j][n+1]=n;
for (int i=2;i<=n;++i)
if (x[i]-x[i-1]>val) L[j][i]=i;else L[j][i]=L[j][i-1];
for (int i=n-1;i;--i)
if (x[i+1]-x[i]>val) R[j][i]=i;else R[j][i]=R[j][i+1];
if (!val) break;
}for (int i=0;i<(1<<j);++i) f[i]=0,g[i]=n+1;
for (int i=0;i<(1<<j);++i){
for (int k=0;k<j;++k) if (!(i&(1<<k))){
f[(i|(1<<k))]=max(f[i|(1<<k)],R[k+1][f[i]+1]);
g[(i|(1<<k))]=min(g[i|(1<<k)],L[k+1][g[i]-1]);
}
}
for (int i=0;i<(1<<j);++i)
if (R[0][f[i]+1]>=g[((1<<j)-1)^i]-1) vis[R[0][f[i]+1]]=1;
for (int i=1;i<=n;++i) puts(vis[R[0][i]]?"Possible":"Impossible");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int gi() {
int res = 0, w = 1;
char ch = getchar();
while (ch != '-' && !isdigit(ch)) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (isdigit(ch)) res = res * 10 + ch - '0', ch = getchar();
return res * w;
}
const int MAX_N = 2e5 + 5;
int N, V[20], t;
int x[MAX_N], L[20][MAX_N], R[20][MAX_N];
int sl[1 << 19], sr[1 << 19], cr[MAX_N];
void chkmax(int &x, int y) { if (x < y) x = y; }
void chkmin(int &x, int y) { if (x > y) x = y; }
int main () {
#ifndef ONLINE_JUDGE
freopen("cpp.in", "r", stdin);
#endif
N = gi(), V[0] = gi();
for (int i = 1; i <= N; i++) x[i] = gi();
while (V[t]) V[t + 1] = V[t] >> 1, ++t;
for (int i = 0; i <= t; i++) {
L[i][1] = 1, R[i][N] = N;
for (int j = 2; j <= N; j++)
if (x[j] - x[j - 1] <= V[i]) L[i][j] = L[i][j - 1];
else L[i][j] = j;
for (int j = N - 1; ~j; j--)
if (x[j + 1] - x[j] <= V[i]) R[i][j] = R[i][j + 1];
else R[i][j] = j;
}
for (int i = 1; i < 1 << t; i++) sl[i] = 1, sr[i] = N;
sl[0] = 0, sr[0] = N + 1;
for (int s = 0; s < 1 << t; s++) {
for (int i = 1; i <= t; i++)
if (!(s >> (i - 1) & 1)) {
chkmax(sl[s | 1 << (i - 1)], R[i][sl[s] + 1]);
chkmin(sr[s | 1 << (i - 1)], L[i][sr[s] - 1]);
}
}
for (int i = 0; i <= N; i++) cr[i] = 1e9;
int S = (1 << t) - 1;
for (int i = 0; i < 1 << t; i++) chkmin(cr[sl[i]], sr[S ^ i]);
for (int i = N - 1; ~i; i--) chkmin(cr[i], cr[i + 1]);
for (int i = 1; i <= N; i++) puts(cr[L[0][i] - 1] <= R[0][i] + 1 ? "Possible" : "Impossible");
return 0;
} |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=200005;
int n,V,x[N],lt[N][21],rt[N][21],f[1100000],g[1100000],num,i,j,k,w[N];
int main()
{
scanf("%d%d",&n,&V);
for(i=1;i<=n;++i)
scanf("%d",x+i);
for(i=0;;++i)
{
lt[0][i]=lt[1][i]=1;
for(j=2;j<=n;++j)
if(x[j]-x[j-1]<=(V>>i))
lt[j][i]=lt[j-1][i];
else
lt[j][i]=j;
rt[n+1][i]=rt[n][i]=n;
for(j=n-1;j>=1;--j)
if(x[j+1]-x[j]<=(V>>i))
rt[j][i]=rt[j+1][i];
else
rt[j][i]=j;
num=i;
if(!(V>>i))
break;
}
f[0]=0;
for(i=1;i<(1<<num);++i)
for(j=1;j<=num;++j)
if(i>>(j-1)&1)
f[i]=max(f[i],rt[f[i^(1<<(j-1))]+1][j]);
g[0]=n+1;
for(i=1;i<(1<<num);++i)
{
g[i]=n+1;
for(j=1;j<=num;++j)
if(i>>(j-1)&1)
g[i]=min(g[i],lt[g[i^(1<<(j-1))]-1][j]);
}
for(i=0;i<=n+1;++i)
w[i]=-1;
for(i=0;i<(1<<num);++i)
w[g[i]]=max(w[g[i]],f[((1<<num)-1)^i]);
for(i=1;i<=n+1;++i)
w[i]=max(w[i],w[i-1]);
for(i=1;i<=n;++i)
if(w[rt[i][0]+1]>=lt[i][0]-1)
puts("Possible");
else
puts("Impossible");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
const int MN = 200010;
const int ML = 19;
int N, V;
int v[ML];
int x[MN];
int tor[2][ML][MN];
int dp[2][1 << ML];
int imos[MN];
int main() {
cin >> N >> V;
int L = 0;
v[L++] = V;
while (V > 0) {
V /= 2;
v[L++] = V;
}
rep(i, N) cin >> x[i];
rep(tt, 2) {
rep(j, L) {
tor[tt][j][N] = N;
tor[tt][j][N-1] = N-1;
}
for (int i = N-2; i >= 0; --i) {
rep(j, L) {
if (x[i+1] - x[i] <= v[j]) {
tor[tt][j][i] = tor[tt][j][i+1];
} else {
tor[tt][j][i] = i;
}
}
}
dp[tt][0] = 0;
rep(i, 1 << L) {
rep(j, L) {
if (!((i >> j) & 1)) {
dp[tt][i | (1 << j)] = max(dp[tt][i | (1 << j)], tor[tt][j][dp[tt][i]] + 1);
}
}
}
reverse(x, x + N);
rep(i, N) x[i] *= -1;
}
int B = (1 << L) - 2;
rep(i, 1 << L) {
if (i & 1) continue;
int j = B ^ i;
int l = dp[0][i], r = N - dp[1][j];
if (l >= r) {
imos[0]++;
imos[N]--;
} else {
if (tor[0][0][l] + 1 >= r) {
int p = tor[0][0][l];
int u = N-1-tor[1][0][N-1-p];
imos[u]++;
imos[p+1]--;
}
}
}
rep(i, MN-1) {
imos[i+1] += imos[i];
}
rep(i, N) {
puts(imos[i] > 0 ? "Possible" : "Impossible");
}
return 0;
} |
#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define fill( x, y ) memset( x, y, sizeof x )
#define copy( x, y ) memset( x, y, sizeof x )
using namespace std;
typedef long long LL;
typedef pair < int, int > pa;
const int MAXN = 200020;
const int INF = 0x3f3f3f3f;
int n, m, v[22], tot, a[MAXN], d[MAXN];
int f[MAXN][22], g[MAXN][22];
int dpl[MAXN << 2], dpr[MAXN << 2], ans[MAXN];
int main()
{
#ifdef wxh010910
freopen( "data.in", "r", stdin );
#endif
scanf( "%d%d", &n, &m );
for( int i = 1 ; i <= n ; i++ ) scanf( "%d", &a[ i ] );
while( m ) v[ tot++ ] = m, m >>= 1;
v[ tot++ ] = 0;
d[ 1 ] = d[ n + 1 ] = INF;
for( int i = 2 ; i <= n ; i++ ) d[ i ] = a[ i ] - a[ i - 1 ];
for( int j = 0 ; j < tot ; j++ )
{
for( int i = 1 ; i <= n ; i++ )
if( d[ i ] > v[ j ] ) f[ i ][ j ] = i;
else f[ i ][ j ] = f[ i - 1 ][ j ];
for( int i = n ; i ; i-- )
if( d[ i + 1 ] > v[ j ] ) g[ i ][ j ] = i;
else g[ i ][ j ] = g[ i + 1 ][ j ];
}
fill( dpr, 0x3f );
dpr[ 0 ] = n + 1;
for( int i = 0 ; i < ( 1 << tot ) ; i++ )
for( int j = 0 ; j < tot ; j++ ) if( !( i >> j & 1 ) )
{
if( dpl[ i ] >= n ) dpl[ i | ( 1 << j ) ] = n;
else dpl[ i | ( 1 << j ) ] = max( dpl[ i | ( 1 << j ) ], g[ dpl[ i ] + 1 ][ j ] );
if( dpr[ i ] <= 1 ) dpr[ i | ( 1 << j ) ] = 1;
else dpr[ i | ( 1 << j ) ] = min( dpr[ i | ( 1 << j ) ], f[ dpr[ i ] - 1 ][ j ] );
}
for( int i = 0 ; i < ( 1 << tot ) ; i++ )
{
if( i & 1 ) continue;
int l = dpl[ i ], r = dpr[ ( 1 << tot ) - 1 - i - 1 ];
if( l + 1 >= r ) ans[ 1 ]++;
else
{
int L = f[ l + 1 ][ 0 ], R = g[ l + 1 ][ 0 ];
if( R + 1 >= r && L <= R ) ans[ L ]++, ans[ R + 1 ]--;
}
}
for( int i = 1, cur = 0 ; i <= n ; i++ )
{
cur += ans[ i ];
if( cur ) puts( "Possible" );
else puts( "Impossible" );
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int MaxN=2e5+5;
int N,M=1;
int V[20],X[MaxN],Mn[MaxN];
int L[MaxN][20],R[MaxN][20],F[1<<18],G[1<<18];
int main(){
int i,j,l,r;
scanf("%d%d",&N,&V[0]);
for(i=V[0]>>1;i;i>>=1)
V[M++]=i;
M++;
reverse(V,V+M);
for(i=1;i<=N;i++)
scanf("%d",&X[i]);
for(i=0;i<M;i++)
L[1][i]=1,R[N][i]=N;
for(i=2;i<=N;i++)
for(j=0;j<M;j++)
if(X[i]-X[i-1]<=V[j])
L[i][j]=L[i-1][j];
else L[i][j]=i;
for(i=N-1;i;i--)
for(j=0;j<M;j++)
if(X[i+1]-X[i]<=V[j])
R[i][j]=R[i+1][j];
else R[i][j]=i;
F[0]=0;
for(i=0;i<1<<M-1;i++)
for(j=0;j<M-1;j++)
if(~i>>j&1)
F[i|1<<j]=max(F[i|1<<j],F[i]<N?R[F[i]+1][j]:N);
memset(G,0x3f,sizeof(G));
G[0]=N+1;
for(i=0;i<1<<M-1;i++)
for(j=0;j<M-1;j++)
if(~i>>j&1)
G[i|1<<j]=min(G[i|1<<j],G[i]>1?L[G[i]-1][j]:1);
memset(Mn,0x3f,sizeof(Mn));
for(i=0;i<1<<M-1;i++)
Mn[F[i]]=min(Mn[F[i]],G[(1<<M-1)-1-i]);
for(i=N-1;~i;i--)
Mn[i]=min(Mn[i],Mn[i+1]);
for(i=1;i<=N;i++)
puts(Mn[L[i][M-1]-1]<=R[i][M-1]+1?"Possible":"Impossible");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
int n, v, l[N][20], r[N][20], x[N], p, f[1 << 20], g[1 << 20], dp[N];
void Max (int &x, int y) { if (x < y) x = y; }
void Min (int &x, int y) { if (x > y) x = y; }
bool Judge (int x) {
return dp[l[x][0] - 1] <= r[x][0] + 1;
}
int main () {
scanf("%d%d", &n, &v);
for (int i = 1; i <= n; ++i) scanf("%d", &x[i]);
for (p = 0; v; v >>= 1, ++p) {
l[0][p] = l[1][p] = 1; for (int j = 2; j <= n; ++j) l[j][p] = x[j] - x[j - 1] <= v ? l[j - 1][p] : j;
r[n + 1][p] = r[n][p] = n; for (int j = n - 1; j; --j) r[j][p] = x[j + 1] - x[j] <= v ? r[j + 1][p] : j;
}
for (int i = 1; i <= n; ++i) l[i][p] = r[i][p] = i;
g[0] = n + 1;
for (int i = 1; i < (1 << p); ++i) {
g[i] = 0x3f3f3f3f;
for (int j = 0; j < p; ++j) if (i >> j & 1) {
Max(f[i], r[f[i ^ (1 << j)] + 1][j + 1]);
Min(g[i], l[g[i ^ (1 << j)] - 1][j + 1]);
}
}
for (int i = 0; i <= n; ++i) dp[i] = 0x3f3f3f3f;
for (int i = 0; i < (1 << p); ++i) Min(dp[f[i]], g[((1 << p) - 1) ^ i]);
for (int i = n - 1; i; --i) Min(dp[i], dp[i + 1]);
for (int i = 1; i <= n; ++i) puts(Judge(i) ? "Possible" : "Impossible");
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=800005;
int n,v,tot,cnt;
int x[N],R[22][N],L[22][N],b[22],id[N],p1[N],p2[N],f[N],g[N],ans[N];
void init(){
int i,j,k,l;
memset(L,0x3f,sizeof(L));
for (i=0;i<tot;i++){
for (j=1;j<=n;j=k+1){
k=j;
while (k<n&&x[k+1]-x[k]<=b[i]) k++;
for (l=j;l<=k;l++){
L[i][l]=j; R[i][l]=k;
}
}
}
for (i=1;i<=n;i=k+1){
k=i; cnt++;
while (k<n&&x[k+1]-x[k]<=b[tot]) k++;
for (l=i;l<=k;l++){
id[l]=cnt;
p1[cnt]=i; p2[cnt]=k;
}
}
}
void work(){
int i,j,sz,s,ss,l,r;
sz=(1<<tot)-1;
for (i=0;i<=sz;i++) f[i]=n+1;
for (s=0;s<=sz;s++){
for (j=0;j<tot;j++)
if (!((s>>j)&1)){
ss=s|(1<<j);
f[ss]=min(f[ss],L[j][f[s]-1]);
g[ss]=max(g[ss],R[j][g[s]+1]);
}
}
for (s=0;s<=sz;s++){
l=g[s]; r=f[sz^s];
if (l+1>=r){
for (i=1;i<=n;i++) ans[i]=1;
return;
}
if (p1[id[l+1]]<=l+1&&p2[id[l+1]]>=r-1) ans[id[l+1]]=1;
}
}
int main(){
int i;
scanf("%d%d",&n,&v);
for (i=1;i<=n;i++) scanf("%d",&x[i]);
b[0]=0;
while (v){
b[++tot]=v;
v/=2;
}
sort(b,b+tot+1);
init();
work();
for (i=1;i<=n;i++)
if (ans[id[i]]) printf("Possible\n");
else printf("Impossible\n");
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
#define MAX 200200
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x:x;
}
void cmax(int &x,int y){if(x<y)x=y;}
void cmin(int &x,int y){if(x>y)x=y;}
int n,V[25],x[MAX],t;
int L[20][MAX],R[20][MAX],mr[MAX];
int sl[1<<19],sr[1<<19];
int main()
{
n=read();V[0]=read();
for(int i=1;i<=n;++i)x[i]=read();
while(V[t])V[t+1]=V[t]>>1,++t;int S=1<<t;
for(int i=0;i<=t;++i)
{
L[i][1]=1;R[i][n]=n;
for(int j=2;j<=n;++j)
if(x[j]-x[j-1]<=V[i])L[i][j]=L[i][j-1];
else L[i][j]=j;
for(int j=n-1;~j;--j)
if(x[j+1]-x[j]<=V[i])R[i][j]=R[i][j+1];
else R[i][j]=j;
}
for(int i=1;i<S;++i)sl[i]=1,sr[i]=n;
sl[0]=0;sr[0]=n+1;
for(int i=0;i<S;++i)
for(int j=1;j<=t;++j)
if(!(i&(1<<(j-1))))
{
cmax(sl[i|(1<<(j-1))],R[j][sl[i]+1]);
cmin(sr[i|(1<<(j-1))],L[j][sr[i]-1]);
}
memset(mr,63,sizeof(mr));
for(int j=0;j<S;++j)cmin(mr[sl[j]],sr[(S-1)^j]);
for(int i=n;~i;--i)mr[i]=min(mr[i],mr[i+1]);
for(int i=1;i<=n;++i)puts(mr[L[0][i]-1]<=R[0][i]+1?"Possible":"Impossible");
return 0;
}
|
//Heaplax
//别让自己后悔
#include<bits/stdc++.h>
#define N 200001
#define LL long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(ch=='-')fs=1,x=0;else fs=0,x=ch-48;
while(ch=getchar(),ch>33)x=x*10+ch-48;
if(fs)x=-x;
}
using namespace std;
int n,cnt,v[N],x[N],tl[N][19],tr[N][19];
int fl[1<<19],fr[1<<19];
int main()
{
re(n),re(v[0]);
while(v[cnt])
{
++cnt;
v[cnt]=v[cnt-1]>>1;
}
for(int i=1;i<=n;++i)re(x[i]);
for(int i=0;i<=cnt;++i)
{
int last=1;
for(int j=1;j<=n;++j)
if(j==n || x[j+1]-x[j]>v[i])
{
for(int k=last;k<=j;++k)
tl[k][i]=last,tr[k][i]=j;
last=j+1;
}
}
for(int i=0;i<(1<<cnt+1);++i)
{
fl[i]=0;
fr[i]=n+1;
for(int j=0;j<=cnt;++j)
if(i>>j&1)
{
fl[i]=max(fl[i],tr[min(fl[i^(1<<j)]+1,n)][j]);
fr[i]=min(fr[i],tl[max(fr[i^(1<<j)]-1,1)][j]);
}
}
int gg=0,l=1;
while(l<=n)
{
int r=tr[l][0];
if(gg>cnt)
{
for(int i=l;i<=r;++i)
puts("Impossible");
}
else
{
bool ok=0;
for(int i=0;i<(1<<cnt+1);++i)
{
int gl=i,gr=((1<<cnt+1)-1)^i;
if(gl&1)gl^=1;
if(gr&1)gr^=1;
if(fl[gl]>=l-1 && fr[gr]<=r+1)
{
ok=1;
break;
}
}
for(int i=l;i<=r;++i)
puts(ok?"Possible":"Impossible");
}
l=r+1;
++gg;
}
}
|
#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l), i##end = (r);i <= i##end;++i)
using std::cin; using std::cout;
const int maxn = 200200;
typedef long long ll;
const int mod = 998244353;
inline ll pow(ll a,int b,int ans = 1) {
for(;b;b >>= 1,a = a * a % mod) if(b & 1)
ans = ans * a % mod;
return ans;
}
inline ll inverse(int x){ return pow(x, mod - 2); }
int n, v, lg;
typedef std::pair<int, int> pr;
int g0[1 << 19], g1[1 << 19];
int x[maxn], ans[maxn];
std::vector<pr> vec[233];
inline void init(std::vector<pr> & v,int d) {
int l = 1;
for(int i = 2;i <= n;++i) if(x[i] - x[i - 1] > d)
v.emplace_back(l, i - 1), l = i;
v.emplace_back(l, n);
}
inline void up(int & x,int y) { if(x < y) x = y; }
inline void down(int & x,int y) { if(x > y) x = y; }
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> v;
rep(i, 1, n) cin >> x[i];
for(;v >> lg;++lg) if(v >> lg) init(vec[lg], v >> lg);
init(vec[lg++], 0);
if(vec[0].size() < 20) {
std::fill(g1, g1 + (1 << lg), n + 1);
rep(i, 0, (1 << lg) - 1) {
rep(j, 1, lg - 1) if((i >> j & 1) == 0){
int l = 0, r = vec[j].size();
for(;l + 1 != r;) (vec[j][l + r >> 1].first <= g0[i] + 1 ? l : r) = l + r >> 1;
up(g0[i | 1 << j], vec[j][l].second), l = -1, r = vec[j].size() - 1;
for(;l + 1 != r;) (vec[j][l + r >> 1].second >= g1[i] - 1 ? r : l) = l + r >> 1;
down(g1[i | 1 << j], vec[j][r].first);
}
}
for(pr i : *vec) {
for(int j = 0;j < 1 << lg;j += 2) {
if(g0[j] >= i.first - 1 && i.second + 1 >= g1[~j & (1 << lg) - 1 & -2]){
std::fill(ans + i.first, ans + i.second + 1, 1);
break;
}
}
}
}
rep(i, 1, n) {
cout << (ans[i] ? "Possible" : "Impossible") << '\n';
}
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
#define MN 200005
using namespace std;
int n,v,len,tt,a[MN],l[25][MN],r[25][MN],f[1<<18],g[1<<18];
int main(){
scanf("%d%d",&n,&v);
while(v>>len)len++;
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=0;i<=len;i++){
l[i][1]=1;r[i][n]=n;
for(int j=2;j<=n;j++)if(a[j]-a[j-1]<=(v>>i))l[i][j]=l[i][j-1];else l[i][j]=j;
for(int j=n-1;j>=1;j--)if(a[j+1]-a[j]<=(v>>i))r[i][j]=r[i][j+1];else r[i][j]=j;
}g[0]=n+1;
for(int i=0;i<(1<<len);i++){
g[i]=n+1;
for(int j=0;j<len;j++)if(i&(1<<j)){
f[i]=max(f[i],r[len-j][min(f[i-(1<<j)]+1,n)]);
g[i]=min(g[i],l[len-j][max(g[i-(1<<j)]-1,1)]);
}
}bool pd=false;
for(int i=1;i<=n;i++)if(l[0][i]!=l[0][i-1])tt++;
if(tt>20){for(int i=1;i<=n;i++)puts("Impossible");return 0;}
for(int i=1,j;i<=n;i++){
if(l[0][i]!=l[0][i-1]){
for(j=0;j<(1<<len);j++)if(f[j]>=l[0][i]-1&&g[(1<<len)-j-1]<=r[0][i]+1){pd=true;break;}
if(j==(1<<len))pd=false;
}printf("%s\n",pd?"Possible":"Impossible");
}
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define MAX(x,y) x=max(x,y)
#define MIN(x,y) x=min(x,y)
#define inf 0x3f3f3f3f
using namespace std;
const int N=400005;
int n,v,g[N*2],f[N*2],bin[25],tot,len[25],lef[25][N],rig[25][N],a[N],bel[N],p1[N],p2[N];
bool ans[N];
int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void dp()
{
bin[0]=1;
for (int i=1;i<=tot;i++) bin[i]=bin[i-1]*2;
for (int i=0;i<bin[tot];i++) g[i]=n+1;
for (int i=0;i<bin[tot];i++)
for (int j=0;j<=tot;j++)
if (!(i&bin[j])) MAX(f[i+bin[j]],rig[j][f[i]+1]),MIN(g[i+bin[j]],lef[j][g[i]-1]);
for (int i=0;i<bin[tot];i++)
{
int l=f[i],r=g[i^(bin[tot]-1)];
if (l+1>=r)
{
for (int j=1;j<=n;j++) ans[j]=1;
return;
}
if (p1[bel[l+1]]<=l+1&&p2[bel[l+1]]>=r-1) ans[bel[l+1]]=1;
}
}
int main()
{
n=read();v=read();
for (int i=1;i<=n;i++) a[i]=read();
tot=0;len[0]=0;
while (v) len[++tot]=v,v>>=1;
sort(len,len+tot+1);
memset(lef,inf,sizeof(lef));
for (int i=0;i<tot;i++)
for (int j=1;j<=n;j++)
{
int l=j;
while (l<n&&a[l+1]-a[l]<=len[i]) l++;
rig[i][j]=l;lef[i][l]=j;j=l;
}
int id=0;
for (int j=1;j<=n;j++)
{
int l=j;bel[j]=++id;
while (l<n&&a[l+1]-a[l]<=len[tot]) l++,bel[l]=id;
p1[id]=j;p2[id]=l;j=l;
}
dp();
for (int i=1;i<=n;i++) puts(ans[bel[i]]?"Possible":"Impossible");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
//INSERT ABOVE HERE
signed main(){
Int n,v;
cin>>n>>v;
vector<Int> x(n);
for(Int i=0;i<n;i++) cin>>x[i];
vector<vector<Int> > dpl,dpr;
while(1){
{
vector<Int> dp(n);
dp.back()=n;
for(Int i=n-2;i>=0;i--){
if(x[i+1]-x[i]<=v) dp[i]=dp[i+1];
else dp[i]=i+1;
}
dpl.emplace_back(dp);
}
{
vector<Int> dp(n);
dp.front()=-1;
for(Int i=1;i<n;i++){
if(x[i]-x[i-1]<=v) dp[i]=dp[i-1];
else dp[i]=i-1;
}
dpr.emplace_back(dp);
}
if(!v) break;
v>>=1;
}
Int k=dpl.size();
vector<Int> dp(1<<k,0);
vector<Int> pd(1<<k,n-1);
for(Int b=0;b<(1<<k);b++){
for(Int i=0;i<k;i++){
if((b>>i)&1) continue;
chmax(dp[b|(1<<i)],(dp[b]<n?dpl[i][dp[b]]:n));
chmin(pd[b|(1<<i)],(~pd[b]?dpr[i][pd[b]]:-1));
}
}
vector<Int> ans(n+1);
for(Int b=0;b<(1<<k);b+=2){
Int a=((1<<k)-2)^b;
Int c=dp[a]<n?dpl[0][dp[a]]:n;
if(pd[b]>=c) continue;
ans[dp[a]]++;
ans[c]--;
continue;
cout<<a<<" "<<b<<endl;
cout<<dp[a]<<" "<<pd[b]<<" "<<c<<endl;
cout<<endl;
}
for(Int i=0;i<n;i++){
cout<<(ans[i]?"Possible":"Impossible")<<endl;
ans[i+1]+=ans[i];
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n, v;
const int N = 600000;
int ai[N];
int L[20][N], R[20][N], cnt[N];
int Ld[N], Rd[N];
int main()
{
scanf("%d%d", &n, &v);
for (int i = 1; i <= n; ++ i) scanf("%d", &ai[i]);
int c = 0;
for (int i = 0, vv = v; vv != -1; ++ i, vv == 0? vv = -1: vv /= 2)
{
c ++;
R[i][n] = n;
for (int j = n - 1; j >= 1; -- j)
if (ai[j + 1] - ai[j] <= vv)
R[i][j] = R[i][j + 1];
else
R[i][j] = j;
L[i][1] = 1;
for (int j = 2; j <= n; ++ j)
if (ai[j] - ai[j - 1] <= vv)
L[i][j] = L[i][j - 1];
else
L[i][j] = j;
}
for (int i = 0; i < (1 << c); ++ i)
Ld[i] = n + 1;
for (int i = 0; i < (1 << c); ++ i)
for (int j = 0; j <= c; ++ j)
if (!(i & (1 << j)))
Rd[i | (1 << j)] = max(Rd[i | (1 << j)], R[j][Rd[i] + 1]),
Ld[i | (1 << j)] = min(Ld[i | (1 << j)], L[j][Ld[i] - 1]);
for (int i = 0; i < (1 << c); ++ i) if (!(i & 1))
if (R[0][Rd[i] + 1] + 1 >= Ld[((1 << c) - 2) ^ i])
{
cnt[L[0][Rd[i] + 1]] ++;
cnt[R[0][Rd[i] + 1] + 1] --;
}
for (int i = 1; i <= n; ++ i) cnt[i] += cnt[i - 1];
for (int i = 1; i <= n; ++ i) if (cnt[i]) puts("Possible"); else puts("Impossible");
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
const int MAXN = 200010;
const int LG = 22;
int x[MAXN], p[MAXN][LG], f[MAXN * 3], v[MAXN], vs = 0;
int f2[MAXN * 3], p2[MAXN][LG];
int main()
{
int n;
scanf("%d%d", &n, v);
vs = 0;
while (v[vs] > 0)
{
v[vs + 1] = v[vs] / 2;
vs++;
}
vs++;
for (int i = 0; i < n; i++)
scanf("%d", x + i);
for (int i = 0; i < vs; i++)
{
p[n][i] = p[n - 1][i] = n;
for (int j = n - 2; j >= 0; j--)
{
if (x[j + 1] - x[j] > v[i]) p[j][i] = j + 1;
else p[j][i] = p[j + 1][i];
}
}
for (int i = 0; i < vs; i++)
{
p2[0][i] = p2[1][i] = 0;
for (int j = 2; j <= n; j++)
{
if (x[j - 1] - x[j - 2] > v[i]) p2[j][i] = j - 1;
else p2[j][i] = p2[j - 1][i];
}
}
memset(f, 0, sizeof(f));
for (int i = 0; i < (1 << vs); i++)
for (int j = 0; j < vs; j++)
{
if (i & (1 << j)) continue;
int nv = i + (1 << j);
f[nv] = max(f[nv], p[f[i]][j]);
}
for (int i = 0; i < (1 << vs); i++) f2[i] = n;
for (int i = 0; i < (1 << vs); i++)
for (int j = 0; j < vs; j++)
{
if (i & (1 << j)) continue;
int nv = i + (1 << j);
f2[nv] = min(f2[nv], p2[f2[i]][j]);
}
int msk = (1 << vs) - 1;
if (f[msk] < n)
{
for (int i = 0; i < n; i++) printf("Impossible\n");
return 0;
}
int l, r;
for (l = 0; l != n; l = r)
{
r = p[l][0];
bool ok = false;
for (int i = 0; i < (1 << vs); i++)
{
if (i & 1) continue;
if ((f[i] >= l) && (f2[msk - 1 - i] <= r))
ok = true;
}
for (int i = l; i < r; i++)
if (!ok) printf("Impossible\n");
else printf("Possible\n");
}
return 0;
}
|
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
using namespace std;
int n,m,k,a[200100],l[200100][20],r[200100][20],f[270000],g[270000],ans[200100];
int getint()
{
char ch;
while (!isdigit(ch=getchar()) && ch!='-');
bool flag=ch=='-';
if (flag)
ch=getchar();
int x=ch-'0';
for (; isdigit(ch=getchar()); x=x*10+ch-'0');
return flag?-x:x;
}
int main()
{
scanf("%d%d",&n,&m);
repu(i,1,n)
a[i]=getint();
for (k=0; m>>k; ++k);
a[0]=a[1]-m-1,a[n+1]=a[n]+m+1;
repu(i,0,k)
r[n+1][i]=n;
repu(i,1,n)
repu(j,0,k)
{
l[i][j]=a[i]-a[i-1]>m>>j?i:l[i-1][j];
for (r[i][j]=max(r[i-1][j],i); a[r[i][j]+1]-a[r[i][j]]<=m>>j; ++r[i][j]);
}
repu(i,0,(1<<k)-1)
g[i]=n+1;
repu(i,0,(1<<k)-1)
repu(j,1,k)
if (!(i&(1<<(j-1))))
{
int t=i|(1<<(j-1));
f[t]=max(f[t],r[f[i]+1][j]);
g[t]=min(g[t],l[g[i]-1][j]);
}
repu(i,0,(1<<k)-1)
{
int x=f[i],y=g[(1<<k)-1-i];
if (x+1>=y)
++ans[1];
else
if (r[x+1][0]+1>=y)
++ans[l[x+1][0]],--ans[r[x+1][0]+1];
}
repu(i,1,n)
puts((ans[i]+=ans[i-1])?"Possible":"Impossible");
return 0;
} |
#include <cstdio>
#include <algorithm>
int N, V, LOG, a[200001], LE[19][200001], RE[19][200001], F[262144], G[262144], OK[200001];
int main()
{
scanf("%d%d", &N, &V);
while (1 << LOG <= V)
LOG++;
for (int i = 1; i <= N; i++)
scanf("%d", a + i);
for (int i = 0; i <= LOG; i++)
{
int *le = LE[i], *re = RE[i];
le[1] = 1;
for (int j = 2; j <= N; j++)
le[j] = a[j] - a[j - 1] <= V >> i ? le[j - 1] : j;
re[N] = N;
for (int j = N - 1; j; j--)
re[j] = a[j + 1] - a[j] <= V >> i ? re[j + 1] : j;
}
for (int i = 0; i < 1 << LOG; i++)
{
F[i] = 0;
G[i] = N + 1;
for (int j = 1; j <= LOG; j++)
if (i >> j - 1 & 1)
{
F[i] = std::max(F[i], F[i - (1 << j - 1)] == N ? N : RE[j][F[i - (1 << j - 1)] + 1]);
G[i] = std::min(G[i], G[i - (1 << j - 1)] == 1 ? 1 : LE[j][G[i - (1 << j - 1)] - 1]);
}
}
for (int i = 0; i < 1 << LOG; i++)
if (F[i] + 1 >= G[(1 << LOG) - 1 - i])
{
for (int j = N; j--; )
puts("Possible");
return 0;
}
for (int i = 0; i < 1 << LOG; i++)
if (RE[0][F[i] + 1] + 1 >= G[(1 << LOG) - 1 - i])
{
int R = RE[0][F[i] + 1], L = LE[0][R];
if (!OK[L])
std::fill(OK + L, OK + R + 1, 1);
}
for (int i = 1; i <= N; i++)
puts(OK[i] ? "Possible" : "Impossible");
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#define N 300010
using namespace std;
int num[N],val[64];
int l[32][N],r[32][N];
int f[1<<22],g[1<<22];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&num[i]);
int tot=0,res=m;
while(res)
{
val[tot++]=res>>1;
res>>=1;
}
val[tot]=m;
for(int i=0;i<=tot;i++)
{
l[i][1]=1;
for(int j=2;j<=n;j++)
{
if(num[j]-num[j-1]<=val[i]) l[i][j]=l[i][j-1];
else l[i][j]=j;
}
}
int sum=0;
for(int i=0;i<=tot;i++)
{
r[i][n]=n;
for(int j=n-1;j>=1;j--)
{
if(num[j+1]-num[j]<=val[i]) r[i][j]=r[i][j+1];
else
{
r[i][j]=j;
if(i==tot) sum++;
}
}
}
if(sum>tot){for(int i=1;i<=n;i++)puts("Impossible");return 0;}
int p=1<<tot;
for(int s=0;s<p;s++) g[s]=n+1;
for(int s=0;s<p;s++)
for(int i=0;i<=tot;i++)
if(!((s>>i)&1))
{
f[s|(1<<i)]=max(f[s|(1<<i)],r[i][f[s]+1]);
g[s|(1<<i)]=min(g[s|(1<<i)],l[i][g[s]-1]);
}
for(int i=1;i<=n;i=r[tot][i]+1)
{
bool ok=false;
for(int s=0;s<p && !ok;s++) if(f[s]>=i-1 && g[(p-1)-s]<=r[tot][i]+1) ok=true;
for (int j=i;j<=r[tot][i];j++)
{
if(ok) puts("Possible");
else puts("Impossible");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int read(){
int x=0,f=1;
char ch=getchar();
while (!isdigit(ch)&&ch!='-')
ch=getchar();
if (ch=='-')
f=-1,ch=getchar();
while (isdigit(ch))
x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return x*f;
}
const int N=1050005;
int n,v;
int x[N];
int R[20][N],L[20][N],mR[N],mL[N];
int Max[N];
int main(){
n=read(),v=read();
for (int i=1;i<=n;i++)
x[i]=read();
int d;
for (d=0;d<20;d++){
int k=v>>d;
for (int i=1,j;i<=n;i=j+1){
for (j=i;j<n&&x[j+1]-x[j]<=k;j++);
for (int k=i;k<=j;k++)
L[d][k]=i,R[d][k]=j;
}
if (k==0)
break;
}
for (int i=0;i<=d;i++)
R[i][n+1]=n,L[i][0]=1;
for (int i=0;i<(1<<d);i++)
mR[i]=0,mL[i]=n+1;
for (int i=1;i<(1<<d);i++)
for (int j=0;j<d;j++)
if (i>>j&1){
mR[i]=max(mR[i],R[j+1][mR[i^(1<<j)]+1]);
mL[i]=min(mL[i],L[j+1][mL[i^(1<<j)]-1]);
}
int base=(1<<d)-1;
memset(Max,-1,sizeof Max);
for (int i=0;i<(1<<d);i++){
int x=i,y=i^base;
Max[mL[x]]=max(Max[mL[x]],mR[y]);
}
for (int i=2;i<=n+1;i++)
Max[i]=max(Max[i],Max[i-1]);
for (int i=1;i<=n;i++){
int l=L[0][i],r=R[0][i];
puts(Max[r+1]>=l-1?"Possible":"Impossible");
}
return 0;
} |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, ans[200050];
vector<int> v;
int a[200050];
int go[19][200050];
int dp[1 << 19];
bool f(int l, int r, int k)
{
vector<int> b;
for (int i = 0; i < n; i++)
if (i < l || i >= r)
b.emplace_back(a[i]);
int m = b.size();
for (int i = 0; i < k; i++)
for (int j = m - 1; j >= 0; j--) {
go[i][j] = j + 1;
if (j + 1 < m&&b[j + 1] - b[j] <= v[i])
go[i][j] = go[i][j + 1];
}
for (int i = 0; i < 1 << k; i++)dp[i] = 0;
for (int i = 0; i < 1 << k; i++) {
if (dp[i] == m) return 1;
for (int j = 0; j < k; j++)
if ((i >> j & 1) == 0)dp[i | 1 << j] = max(dp[i | 1 << j], go[j][dp[i]]);
}
return false;
}
int main()
{
int V;
cin >> n >> V;
for (; V > 0; V /= 2)
v.emplace_back(V);
v.emplace_back(0);
reverse(v.begin(), v.end());
for (int i = 0; i < n; i++)
cin >> a[i];
a[n] = 1100000000;
if (f(n, n, v.size())) {
for (int l = 0; l < n;) {
int r = l + 1;
while (a[r] - a[r - 1] <= v.back())r++;
if (f(l, r, v.size() - 1))
for (int i = l; i < r; i++)ans[i] = 1;
l = r;
}
}
for (int i = 0; i < n; i++)
cout << (ans[i] ? "Possible" : "Impossible") << endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int maxn=400010;
int n, v, m;
int a[maxn];
int f[1<<20], g[1<<20];
int Next[maxn][30], pre[maxn][30];
void chkmax(int& x,int y){ if(x<y) x=y; }
void chkmin(int& x,int y){ if(x>y) x=y; }
int Log[maxn];
void init(){
for(int i=2;i<maxn;i++) Log[i]=Log[i>>1]+1;
}
int fa[maxn];
int find(int x){ return x==fa[x] ? x : fa[x]=find(fa[x]); }
int ans[maxn], b[maxn];
int main(){
init();
scanf("%d%d", &n, &v);
int t=v; b[++m]=t;
while(t){
b[++m]=t/2;
t/=2;
}
// printf("m = %d\n", m);
// for(int i=1;i<=m;i++) printf("%d ", b[i]); puts("");
for(int i=1;i<=n;i++) scanf("%d", &a[i]);
for(int j=1;j<=m;j++){
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<n;i++) if(a[i+1]-a[i]<=b[j]) fa[find(i)]=find(i+1);
for(int i=1;i<=n;i++) Next[i][j]=find(i);
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<n;i++) if(a[i+1]-a[i]<=b[j]) fa[find(i+1)]=find(i);
for(int i=1;i<=n;i++) pre[i][j]=find(i);
// for(int i=1;i<=n;i++) printf("%d ", Next[i][j]); puts("");
}
for(int i=0;i<(1<<m);i++) for(int j=1;j<=m;j++) if(!(i & (1<<(j-1)))){
chkmax(f[i | (1<<(j-1))], Next[ f[i]+1 ][j]);
}
for(int i=0;i<(1<<m);i++) g[i]=n+1;
for(int i=0;i<(1<<m);i++) for(int j=1;j<=m;j++) if(!(i & (1<<(j-1))))
chkmin(g[i | (1<<(j-1))], pre[ g[i]-1 ][j]);
for(int i=0;i<(1<<m);i++){
if((i & 1)) continue;
int j=((1<<m)-1) ^ i ^ 1;
int l=1, r=Next[l][1];
while(l<=n){
if(f[i]>=l-1 && g[j]<=r+1) for(int k=l;k<=r;k++) ans[k]=1;
l=r+1, r=Next[l][1];
}
}
for(int i=1;i<=n;i++) printf("%s\n", ans[i] ? "Possible" : "Impossible");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define nn 1000008
#define lg 21
int n;
int pos[nn];
struct afd{
int bel[nn];
int l[nn],r[nn];
void init(int v)
{
for(int i=1;i<=n;i++)
{
if(i==1 or pos[i]-pos[i-1]>v) bel[i]=i,l[i]=r[i]=i;
else bel[i]=bel[i-1],r[bel[i]]=i;
}
}
}v2[lg];
int l=0;
int v;
void fuckoff()
{
while(n--) puts("Impossible");
exit(0);
}
int fl[nn],fr[nn];
void chkmin(int &x,int y) {x=min(x,y);}
void chkmax(int &x,int y) {x=max(x,y);}
int main()
{
scanf("%d%d",&n,&v);
for(int i=1;i<=n;i++) scanf("%d",&pos[i]);
while(v) v2[l++].init(v),v/=2;
v2[l++].init(v),v/=2;
int cnt=0;
for(int i=1;i<=n;i++)
if(v2[0].bel[i]==i)
cnt++;
if(cnt>1+l) fuckoff();
for(int ii=1;ii<=n;ii++)
{
if(v2[0].bel[ii]==ii)
{
int el=v2[0].l[ii],er=v2[0].r[ii];
memset(fl,0x3f,sizeof fl);
memset(fr,0,sizeof fr);
fl[1]=el;fr[1]=er;
for(int mask=1;mask<(1<<l);mask++)
{
if(!(mask&1) or fl[mask]>n) continue;
for(int i=1;i<l;i++)
{
if(mask&(1<<i)) continue;
int x=v2[i].bel[fl[mask]-1];
if(!x) chkmin(fl[mask|(1<<i)],fl[mask]);
else chkmin(fl[mask|(1<<i)],v2[i].l[x]);
}
}
for(int mask=1;mask<(1<<l);mask++)
{
if(!(mask&1) or !fr[mask]) continue;
for(int i=1;i<l;i++)
{
if(mask&(1<<i)) continue;
int x=v2[i].bel[fr[mask]+1];
if(!x) chkmax(fr[mask|(1<<i)],fr[mask]);
else chkmax(fr[mask|(1<<i)],v2[i].r[x]);
}
}
int flag=0;
for(int mask=0;mask<(1<<l);mask++)
if(mask&1)
if(fl[mask]<=1 and fr[(((1<<l)-1)^mask)|1]>=n)
flag=1;
if(flag)
for(int i=el;i<=er;i++) puts("Possible");
else
for(int i=el;i<=er;i++) puts("Impossible");
}
}
return 0;
} |
#include <bits/stdc++.h>
#define mset(a,b) memset(a,b,sizeof a)
#define mcpy(a,b) memcpy(a,b,sizeof b)
#define lb(x) ((x)&(-(x)))
#define xx first
#define yy second
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define pii pair<int,int>
#define inf 0x3f3f3f3f
#define N 262145
#define M 20
using namespace std;
typedef long long ll;
int n,m,V,a[N],l[N][M],r[N][M],f[N],g[N];
bool ans[N];
int main(){
cin>>n>>V;
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int x=V;;x>>=1){
for(int i=1;i<=n;i++)
if(i==1||a[i]-a[i-1]>x)l[i][m]=i;
else l[i][m]=l[i-1][m];
for(int i=n;i;i--)
if(i==n||a[i+1]-a[i]>x)r[i][m]=i;
else r[i][m]=r[i+1][m];
if(x)m++;
else break;
}
for(int i=0;i<(1<<m);i++)for(int j=0;j<m;j++)if(!(i>>j&1))
f[i|(1<<j)]=max(f[i|(1<<j)],f[i]==n?n:r[f[i]+1][j+1]);
for(int i=0;i<(1<<m);i++)g[i]=inf;
g[0]=n+1;
for(int i=0;i<(1<<m);i++)for(int j=0;j<m;j++)if(!(i>>j&1))
g[i|(1<<j)]=min(g[i|(1<<j)],g[i]==1?1:l[g[i]-1][j+1]);
// cout<<g[1]<<endl;
for(int i=0;i<(1<<m);i++){
int L=f[i],R=g[i^(1<<m)-1];
// cout<<L<<" "<<R<<endl;
if(L+1>=R){
for(int j=1;j<=n;j++)ans[j]=1;
break;
}
// cout<<L+1<<" "<<r[L+1][0]+1<<" "<<R<<endl;
if(r[L+1][0]+1>=R&&!ans[L+1]){
// cout<<l[0][L]<<" "<<r[0][L]<<endl;
for(int j=l[L+1][0];j<=r[L+1][0];j++)ans[j]=1;
}
}
for(int i=1;i<=n;i++)puts(ans[i]?"Possible":"Impossible");
return 0;
} |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a ; i <= b; ++ i)
const int M = 18, N = 3e5 + 5 ;
using namespace std ;
int n, v[M + 5], x[N], L[M + 1][N], R[M + 1][N], dpl[N], dpr[N], bit[N], m ;
int main() {
scanf("%d%d", &n, &v[0]) ;
rep(i, 1, n) scanf("%d", &x[i]) ;
for (m = 1; ; m ++) {
v[m] = v[m - 1] / 2 ;
if (!v[m]) break ;
}
rep(j, 0, m) {
L[j][1] = L[j][0] = 1 ;
rep(i, 2, n) L[j][i] = (x[i] - x[i - 1] <= v[j] ? L[j][i - 1] : i) ;
R[j][n] = R[j][n + 1] = n ;
for (int i = n - 1; i; -- i) R[j][i] = (x[i + 1] - x[i] <= v[j] ? R[j][i + 1] : i) ;
}
int st = (1 << m) - 1 ;
dpl[0] = 0, dpr[0] = n + 1 ;
rep(i, 1, st) {
dpl[i] = 0, dpr[i] = n + 1 ;
rep(j, 1, m) if ((i >> (j - 1)) & 1) {
dpl[i] = max(dpl[i], R[j][dpl[i ^ (1 << (j - 1))] + 1]) ;
dpr[i] = min(dpr[i], L[j][dpr[i ^ (1 << (j - 1))] - 1]) ;
}
}
rep(i, 0, n + 1) bit[i] = - n ;
rep(i, 0, st) bit[dpr[i]] = max(bit[dpr[i]], dpl[st ^ i]) ;
rep(i, 1, n + 1) bit[i] = max(bit[i], bit[i - 1]) ;
rep(i, 1, n) puts((bit[R[0][i] + 1] >= L[0][i] - 1) ? "Possible" : "Impossible") ;
return 0 ;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.