text stringlengths 49 983k |
|---|
#include <iostream>
using namespace std;
int p[100005];
int main(void){
int N; cin>>N;
for(int i=0;i<N;i++)cin>>p[i];
int ans=0;
for(int i=0;i<N;i++)if(p[i]==i+1){ans++;i++;}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main(){
int n;
cin >> n;
vector<int> p(n);
rep(i,n) cin >> p[i];
int cnt=0;
rep(i,n){
if(p[i]==i+1){
cnt++;
i++;
}
}
cout << cnt << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int ans=0;
int flag=0;
for (int i=1;i<=N;i++)
{
int p;
cin >> p;
if (p==i)
{
ans++;
flag++;
if (flag==2)
{
ans--;
flag=0;
}
}
else
flag=0;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, p, ans = 0;
cin >> n;
bool read = true;
for (int i = 1; i <= n; i++) {
cin >> p;
if (!read) { read = true; continue; }
if (read && i == p) { ans++; read = false; }
}
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<int> p(N+1);
for(int i=1; i<=N; i++) cin >> p[i];
int ans=0;
for (int i = 1; i <= N; i++) {
if (p[i] == i) {
swap(p[i],p[i+1]);
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> p(n);
for(int i=0; i<n; i++)cin>>p.at(i);
int ans=0;
for(int i=0; i<n-1; i++){
if(p.at(i)==i+1){
swap(p.at(i), p.at(i+1));
ans++;
}
}
if(p.at(n-1)==n)ans++;
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,a,r;
int main() {
while(cin>>a) {
if(n++ == a) {
r++;
n++;
cin>>a;
}
}
cout<<r;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i,ans=0;
cin>>n;
vector<int> a(n);
for(i=0;i<n;i++) cin>>a.at(i);
for(i=0;i<n;i++){
if(a.at(i)==i+1){
ans++;
i++;
}
}
cout<<ans<<endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int N,p[1<<17];
int main()
{
cin>>N;
int cnt=0;
for(int i=0;i<N;i++)cin>>p[i];
for(int i=0;i<N;i++)
{
if(p[i]==i+1)
{
cnt++;
swap(p[i],p[i+1]);
}
}
cout<<cnt<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int c = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == i) {
c++;
i++;
}
}
cout << c << endl;
}
|
#include<iostream>
using namespace std;
int main(){
int N,ans=0;
cin>>N;
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
for(int i=0;i<N;i++){
if(a[i]==i+1){
swap(a[i],a[i+1]);
ans+=1;
}
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#define MAX 100001
using namespace std;
int main(){
int N;
cin >>N;
int count[MAX]={};
for(int i=1;i<=N;i++){
int k; cin>>k;
if(i==k) count[i]++;
}
int swap=0;
for(int i=1;i<=N;i++){
if(count[i]>0){
swap++;
count[i+1]--;
}
}
cout<<swap<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,p,i,x[1<<17],a;
int main(){
for(cin>>n;i++<n;){
cin>>p;
if(p==i){
x[i]++;
a++;
if(x[i-1])a--,x[i]--;
}
}
cout<<a<<endl;
}
|
#include <iostream>
#include <math.h>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAX_N=100000;
int n,a[MAX_N]={},c=0;
int main(){
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
if(a[i]==i+1){
c++;
i++;
}
}
cout << c << endl;
return 0;
}
|
// D - Derangement
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
int ans = 0;
for(int i=1; i<=N; ++i){
int L; cin>>L;
if(L == i){ ans++; cin>>L; i++; }
}
cout<< ans <<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; ++i) cin >> v[i];
int ans = 0;
for(int i = 0; i < n; ++i){
if(v[i] == i + 1){
ans++;
if(i + 1 == n) swap(v[i], v[i - 1]);
else swap(v[i], v[i+1]);
}
}
cout << ans << endl;
} |
#include <iostream>
using namespace std;
long long int N, p[100001] = {}, num = 0;
bool flag[100001] = {};
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> p[i];
if (p[i] == i) {
num++;
flag[i] = true;
if (flag[i - 1]) {
num--;
flag[i] = false;
}
}
}
cout << num << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<long> data(N);
long ans = 0;
for(int i = 0; i < N; i++)cin >> data.at(i);
for(int i = 0; i < N; i++){
if(data.at(i) == i + 1){
ans++;
i++;
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N, a[100101] = {};
cin >> N;
int cnt = 0;
for(int i = 0; i < N; ++i){
int in;
cin >> in; in--;
if(i == in){
cnt++, i++;
cin >> in;
}
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int p[N];
for(int i = 0; i < N; ++i){
cin >> p[i];
}
int cnt = 0;
for(int i = 0; i < N; ++i){
if(p[i] == i+1){
cnt++;
i++;
}
}
cout << cnt<< endl;
} |
#include <bits/stdc++.h>
#include <assert.h>
#include <numeric>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> p(n + 1);
for (int i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (int i = 0; i < n; i++)
if (p[i] == i + 1)
{
swap(p[i], p[i + 1]);
ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define MAX 100005
using namespace std;
int main(){
int n, a, ans = 0, cnt = 1;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", &a);
if(a != i){
ans += cnt/2;
cnt = 1;
}else cnt++;
}
ans += cnt/2;
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main()
{
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
if (a[i] == i) {
ans++;
i++;
}
}
printf("%d\n", ans);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<bool> m(n);
for(int i=0;i<n;i++){
int p;
cin>>p;
m.at(i)=(p-1==i);
}
int c=0;
for(int i=0;i<n;i++){
if(m.at(i)){
c++;
m.at(i)=0;
if(i+1<n)
m.at(i+1)=0;
}
}
cout<<c<<endl;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int num[1000005];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>num[i];
int be;
be = 0;
int ans = 0;
for(int i=1;i<n;i++)
{
if(num[i] == i)
{
ans++;
swap(num[i],num[i+1]);
}
}
if(num[n] == n) ans++;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,p[100000];
cin>>n;
for(int i=0;i<n;i++){
cin>>p[i];
}
int ans=0;
for(int i=0;i<n;i++){
if(p[i]==i+1){
swap(p[i],p[i+1]);
ans++;
i=-1;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
int main(){
int n;
cin >> n;
int p[n];
rep(i, n) cin >> p[i];
int ans = 0;
rep(i, n-1){
if(p[i] == i+1) {
swap(p[i], p[i+1]);
ans++;
}
}
if(p[n-1] == n) ans++;
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
int main()
{
int n;
std::cin >> n;
std::vector<int> a(n);
for(int i = 0; i < n; i++)std::cin >> a[i];
int cnt = 0;
for(int i = 0; i < n; i++){
if(a[i] == (i + 1)){cnt++;i++;}
}
std::cout << cnt << std::endl;
} |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n,bef=0,c=0,a;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
if (a == i&&bef == 0) {
c++;
bef = 1;
}
else bef = 0;
}
cout <<c<< endl;
} |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int i,N,ans;
cin >> N;
vector <int> p(N);
for(i=0;i<N;i++){
cin >> p[i];
}
ans = 0;
for(i=0;i<N-1;i++){
if(p[i]==i+1){
p[i+1]=p[i];
ans +=1;
}
}
if(p[N-1]==N){
ans += 1;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int p[100010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=0;i<n;i++){cin>>p[i];p[i]--;}
int ans=0;
for(int i=0;i<n;i++)
{
if(p[i]==i){ans++;i++;}
}
cout<<ans<<"\n";
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int N;
int a[100000];
int x=0;
int ans=0;
int i,j,k;
cin>>N;
for(i=0;i<N;i++){
cin>>a[i];
}
for(i=0;i<N-1;i++){
if(a[i]==i+1){
x=a[i];
a[i]=a[i+1];
a[i+1]=x;
ans=ans+1;
}
}
if(a[N-1]==N){ ans++;}
cout<<ans;
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,ans,a[100001];
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
for (int i=1;i<=n;i++)
if (a[i]==i)
{
swap(a[i+1],a[i]);
ans++;
}
printf("%d",ans);
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,arr[100005],cnt = 0;
cin>>n;
for(int i = 1;i<=n;i++)
{
cin>>arr[i];
}
for(int i = 1;i<n;i++)
{
if(arr[i]==i){
swap(arr[i],arr[i+1]);
cnt++;
}
}
if(arr[n]==n)
cnt++;
cout<<cnt;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin>>n;
int a[n];
for(int i=1;i<=n;i++){
cin>>a[i];
}
int ans=0;
for(int i=1;i<=n;i++){
if(a[i]==i){
swap(a[i+1],a[i]);
ans++;
}
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
rep(i, n) cin >> p[i];
int ans = 0;
rep(i, n) {
if (p[i] == i + 1) swap(p[i], p[i + 1]), ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int>p(n);
int cnt = 0;
for(int i = 0; i < n; i++)
cin >> p.at(i);
for(int i = 0; i < n - 1; i++){
if(p.at(i) == i + 1){
swap(p.at(i),p.at(i+1));
cnt++;
}
}
if(p.at(n-1) == n) cnt++;
cout << cnt;
} |
#include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
#define repd(i,n) for ((i)=(n);(i)>=1;(i)--)
using namespace std;
int n,m;
int i,j;
int a[200005],d[200005],lim[25];
int tor[200005][25],tol[200005][25];
int dppre[1<<19],dpsuf[1<<19];
void calc(int x){
int i;
rep(i,n){
tor[i][x]=tor[i-1][x];
if(tor[i][x]<i){
tor[i][x]=i;
while(tor[i][x]<n&&d[tor[i][x]]<=lim[x]){
tor[i][x]++;
}
}
}
tol[n+1][x]=n+1;
repd(i,n){
tol[i][x]=tol[i+1][x];
if(tol[i][x]>i){
tol[i][x]=i;
while(tol[i][x]>1&&d[tol[i][x]-1]<=lim[x]){
tol[i][x]--;
}
}
}
}
int main(){
cin>>n>>lim[m=1];
rep(i,n) cin>>a[i];
rep(i,n-1) d[i]=a[i+1]-a[i];
while(lim[m]>0){
m++;
lim[m]=lim[m-1]/2;
}
rep(i,m){
calc(i);
}
int c=0;
for(i=1;i<=n;i=tor[i][1]+1)c++;
if(c>m+1){
rep(i,n){
puts("Impossible");
return 0;
}
}
for(i=0;i<(1<<(m-1));i++){
dppre[i]=0;dpsuf[i]=n+1;
for(j=0;j<(m-1);j++)if((i>>j)&1){
dppre[i]=max(dppre[i],tor[dppre[i^(1<<j)]+1][j+2]);
dpsuf[i]=min(dpsuf[i],tol[dpsuf[i^(1<<j)]-1][j+2]);
}
}
for(i=1;i<=n;i=tor[i][1]+1){
int f=0;
for(j=0;j<(1<<(m-1));j++){
f|=(dppre[j]>=i-1&&dpsuf[((1<<m-1)-1)^j]<=tor[i][1]+1);
}
if(f){
rep(j,tor[i][1]-i+1) puts("Possible");
}
else{
rep(j,tor[i][1]-i+1) puts("Impossible");
}
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 262150
#define inf 2147483647
using namespace std;
struct pos1{int l, r;}pos[N][19];
int n, m, k, w[N], now, dp_l[N], dp_r[N], bin[19], x, ff, sum;
int main(){
scanf("%d%d", &n, &m);
bin[0]=1; for(int i=1; i<=18; i++)bin[i]=bin[i-1]<<1;
for(int i=1; i<=n; i++)scanf("%d", &w[i]); w[0]=w[1]-m-1; w[n+1]=w[n]+m+1;
k=-1; x=m<<1;
while(x){
k++; x>>=1; now=0;
for(int i=1; i<=n; i++){
if(w[i]-w[i-1]>x)now=i;
pos[i][k].l=now;
}
pos[n+1][k].r=n;
now=n+1;
for(int i=n; i; i--){
if(w[i+1]-w[i]>x)now=i;
pos[i][k].r=now;
}
pos[0][k].l=1;
}
dp_l[0]=0; dp_r[0]=n+1;
for(int i=1; i<=bin[k]-1; i++){
dp_l[i]=0; dp_r[i]=n+1;
for(int j=1; j<=k; j++)if(i&bin[j-1]){
dp_l[i]=max(dp_l[i], pos[dp_l[i-bin[j-1]]+1][j].r);
dp_r[i]=min(dp_r[i], pos[dp_r[i-bin[j-1]]-1][j].l);
}
}
sum=0; for(int i=1; i<=n; i++)if(pos[i][0].l==i)sum++;
if(sum>=k+2){for(int i=1; i<=n; i++)printf("Impossible\n"); return 0;}
for(int i=1; i<=n; i++)if(pos[i][0].l==i){
ff=0;
for(int j=0; j<=bin[k]-1; j++)if(dp_l[j]>=pos[i][0].l-1&&dp_r[bin[k]-1-j]<=pos[i][0].r+1){ff=1; break;}
for(int j=pos[i][0].l; j<=pos[i][0].r; j++)if(ff)printf("Possible\n"); else printf("Impossible\n");
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<unordered_map>
//#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define chmax(a,b) a=max(a,b);
#define N (1<<18)
#define M 19
ll n,v;
class Alpha{
public:
ll f[N];
P g[N][M];
void setg(ll a[]){
for(int k=0;k<M;k++){
for(int i=0;i<n;i++)g[i][k]=make_pair(i,i);
ll bef=-1e18,pnt=0; a[n]=1e18;
for(int i=0;i<=n;i++){
if(abs(a[i]-bef)>(v>>k)){
for(int j=pnt;j<i;j++)g[j][k]=make_pair(pnt,i-1);
pnt=i;
}
bef=a[i];
}
if((v>>k)==0)break;
}
}
void main(ll a[]){
setg(a);
for(int i=0;i<N;i++)f[i]=-1;
for(int i=0;i<N;i++){
for(int j=0;j<M-1;j++){
if(i&(1<<j))continue;
chmax(f[i+(1<<j)],g[f[i]+1][j+1].second);
}
}
//for(int i=0;i<16;i++)cout<<f[i]<<" ";cout<<endl;
}
};Alpha L,R;
class Solve{
public:
unordered_map<ll,bool> mas;
bool main(ll l,ll r){
if(mas.size()>30)return 0;
if(mas.find(l)!=mas.end()){
return mas[l];
}
bool res=0;
int cnt=0;
for(int x=v;x;x>>=1)cnt++;
int who=1;
for(int i=0;i<cnt;i++)who*=2;//cout<<who<<endl;
for(int i=0;i<who;i++){
int ls=i,rs=who-1-i;
if(l-1<=L.f[ls]&&n-1-R.f[rs]<=r+1)res=1;
}
mas[l]=res;
return res;
}
};Solve sv;
ll a[N];
int main(){
cin>>n>>v;
for(int i=0;i<n;i++)cin>>a[i];
L.main(a);
for(int i=0;i<n/2;i++)swap(a[i],a[n-i-1]);
R.main(a);
for(int i=0;i<n;i++){
bool ans=sv.main(L.g[i][0].first,L.g[i][0].second);
cout<<(ans?"Possible":"Impossible")<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=300100,M=20;
int a[N],dp[N],dq[N],b[M],V,n,le[M][N],ri[M][N],c[N];
int m;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>V;
for(int i=1;i<=n;++i)cin>>a[i];
for(;V>>m;++m)b[m]=V>>m;
for(int i=0;i<=m;++i){
ri[i][n]=n;ri[i][n+1]=n+1;
for(int j=n-1;j;--j)
ri[i][j]=(a[j+1]-a[j]<=b[i]?ri[i][j+1]:j);
le[i][0]=0;le[i][1]=1;
for(int j=2;j<=n;++j)
le[i][j]=(a[j]-a[j-1]<=b[i]?le[i][j-1]:j);
}
fill(dq,dq+N,n+1);
for(int i=1;i<(1<<m);++i)
for(int j=0;j<m;++j)
if(i>>j&1){
dp[i]=max(dp[i],ri[j+1][dp[i-(1<<j)]+1]);
dq[i]=min(dq[i],le[j+1][dq[i-(1<<j)]-1]);
dp[i]=min(dp[i],n);
dq[i]=max(dq[i],1);
}
for(int i=0;i<(1<<m);++i){
int l=dp[i]+1,r=dq[(1<<m)-1-i]-1;
if(r<=ri[0][l]){
if(l>r)++c[1];
else ++c[l],--c[r+1];
}
}
for(int i=1;i<=n;++i){
c[i]+=c[i-1];
cout<<(c[i]?"Possible\n":"Impossible\n");
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2e5+5;
int n,m,a[N],l[25][N],r[25][N],v[25],cnt=0,L[1<<25],R[1<<25],ans[N];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int V=m;
while(V){V>>=1;v[cnt++]=V;}v[cnt]=m;
// for(int i=1;i<=cnt;i++) printf("%d ",v[i]);
for(int i=0;i<=cnt;i++)
{
l[i][1]=1;
r[i][n]=n;
for(int j=2;j<=n;j++) l[i][j]=(a[j]-a[j-1]<=v[i])?l[i][j-1]:j;
for(int j=n-1;j>=1;j--) r[i][j]=(a[j+1]-a[j]<=v[i])?r[i][j+1]:j;
}
/*for(int i=0;i<=cnt;i++)
{
for(int j=1;j<=n;j++) printf("%d ",l[i][j]);
printf("\n");
}*/
// L[0]=1,R[0]=n;
for(int i=0;i<(1<<cnt);i++) R[i]=n+1;
for(int i=0;i<(1<<cnt);i++)
for(int j=0;j<=cnt;j++)
if(((1<<j)&i)==0)
L[(1<<j)|i]=max(L[(1<<j)|i],r[j][L[i]+1]),
R[(1<<j)|i]=min(R[(1<<j)|i],l[j][R[i]-1]);
// for(int i=0;i<(1<<cnt);i++) printf("%d %d\n",L[i],R[i]);
/*for(int i=0;i<(1<<cnt);i++)
{
printf("!! %d %d\n",i,((1<<cnt)-1)^i);
if(L[i]>=R[((1<<cnt)-1)^i]) s[R[((1<<cnt)-1)^i]]++,s[L[i]+1]--,printf("%d %d\n",R[((1<<cnt)-1)^i],L[i]);
}
int sum=0;
for(int i=1;i<=n;i++)
{
sum+=s[i];
if(sum>0) puts("Possible");
else puts("Impossible");
}*/
for(int i=1;i<=n;i++)
{
bool flag=0;
for(int j=0;j<(1<<cnt);j++)
{
int ss=((1<<cnt)-1)^j;
if(L[j]>=i-1&&R[ss]<=r[cnt][i]+1){flag=1;break;}
}
for(int j=i;j<=r[cnt][i];j++)
{
if(flag) ans[j]=1;
else ans[j]=0;
}
i=r[cnt][i];
}
for(int i=1;i<=n;i++) puts(ans[i]==0?"Impossible":"Possible");
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++) puts("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++) puts("Possible\n");
else for(int j=fr;j<=to;j++) puts("Impossible\n");
}
return 0;
} |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
template <class T>
inline void relax(T &a, const T &b)
{
if (b > a)
a = b;
}
template <class T>
inline void tense(T &a, const T &b)
{
if (b < a)
a = b;
}
const int MaxN = 200000;
const int MaxM = 200000;
const int MaxNF = 18;
int n, m;
int a[MaxN + 1];
int nF = 0;
int d[MaxNF + 1];
int f[1 << MaxNF], vl[MaxN + 1][MaxNF + 1];
int g[1 << MaxNF], vr[MaxN + 1][MaxNF + 1];
int h[MaxN + 1];
int main()
{
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; ++i)
cin >> a[i];
while (1 << nF <= m)
++nF;
for (int i = nF; i >= 0; --i)
d[i] = m, m >>= 1;
for (int i = 0; i <= nF; ++i)
vl[0][i] = 0, vr[n + 1][i] = n + 1;
for (int i = 1; i <= n; ++i)
for (int j = 0; j <= nF; ++j)
vl[i][j] = a[i] - a[i - 1] <= d[j] ? vl[i - 1][j] : i - 1;
for (int i = n; i; --i)
for (int j = 0; j <= nF; ++j)
vr[i][j] = a[i + 1] - a[i] <= d[j] ? vr[i + 1][j] : i + 1;
for (int s = 0; s < 1 << nF; ++s)
{
f[s] = 1, g[s] = n;
for (int i = 0; i < nF; ++i)
{
if (~s >> i & 1)
continue;
relax(f[s], vr[f[s ^ 1 << i]][i]);
tense(g[s], vl[g[s ^ 1 << i]][i]);
}
}
for (int s = 0; s < 1 << nF; ++s)
relax(h[g[s]], f[s ^ ((1 << nF) - 1)]);
for (int i = 1; i <= n; ++i)
relax(h[i], h[i - 1]);
for (int i = 1; i <= n; ++i)
puts(h[vr[i][nF] - 1] > vl[i][nF] ? "Possible" : "Impossible");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,v;
int x[200010];
vector<pair<int,int> >tot;
int nl[20][200010],nr[20][200010];
int fl[1<<20],fr[1<<20];
int main()
{
scanf("%d%d",&n,&v);
for(int i=1;i<=n;i++)scanf("%d",x+i);
for(int i=1;i<=n;i++)
{
int j=i;
while(j+1<=n && x[j+1]-x[j]<=v)j++;
tot.push_back(make_pair(i,j));
i=j;
}
if((int)tot.size()>20)
{
for(int i=1;i<=n;i++)puts("Impossible");
return 0;
}
v/=2;
int k;
for(k=0;;k++,v/=2)
{
for(int i=1;i<=n;i++)
{
int j=i;
while(j+1<=n && x[j+1]-x[j]<=v)j++;
for(int t=i;t<=j;t++)nl[k][t]=j,nr[k][t]=i;
i=j;
}
if(!v)break;
}
k++;
for(int i=0;i<(1<<k);i++)fr[i]=n+1;
for(int i=0;i<(1<<k);i++)
{
for(int j=0;j<k;j++)
{
if(i>>j&1)continue;
fl[i|(1<<j)]=min(n,max(fl[i|(1<<j)],nl[j][fl[i]+1]));
fr[i|(1<<j)]=max(1,min(fr[i|(1<<j)],nr[j][fr[i]-1]));
}
}
for(int i=0;i<(int)tot.size();i++)
{
bool ok=false;
for(int j=0;j<(1<<k);j++)
{
int a=fl[j],b=fr[((1<<k)-1)^j];
if((a>=tot[i].first-1 && b<=tot[i].second+1) || a+1>=b)
{
ok=true;
break;
}
}
for(int j=tot[i].first;j<=tot[i].second;j++)puts(ok?"Possible":"Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a); i<=(b); ++i)
#define per(i,a,b) for (int i=(a); i>=(b); --i)
using namespace std;
const int maxn = 400005;
int f[maxn][20], g[maxn][20], pre[1<<19], suf[1<<19];
int x[maxn], ans[maxn], d[20], n, m, v;
int main() {
scanf("%d%d", &n, &v); d[0] = v;
while (v) d[++m] = v/2, v /= 2;
rep (i, 1, n) scanf("%d", &x[i]);
rep (i, 1, n) rep (j, 0, m)
if (i >= 2 && x[i] - x[i-1] <= d[j]) f[i][j] = f[i-1][j];
else f[i][j] = i;
per (i, n, 1) rep (j, 0, m)
if (i <= n-1 && x[i+1] - x[i] <= d[j]) g[i][j] = g[i+1][j];
else g[i][j] = i;
memset(pre, 0xc0, sizeof pre);
memset(suf, 0x3f, sizeof suf);
pre[0] = 0; suf[0] = n+1;
int ALL = (1<<m)-1;
rep (i, 0, ALL) rep (j, 0, m-1) if (!(i>>j&1)) {
if (pre[i] == n) pre[i|1<<j] = n;
else pre[i|1<<j] = max(pre[i|1<<j], g[pre[i]+1][j+1]);
if (suf[i] == 1) suf[i|1<<j] = 1;
else suf[i|1<<j] = min(suf[i|1<<j], f[suf[i]-1][j+1]);
}
int l = 1, r, tot = 0, flag;
while (l <= n) {
r = l; if (tot++ > m) break;
while (r + 1 <= n && x[r+1] - x[r] <= d[0]) r++;
flag = 0;
rep (i, 0, ALL)
if (pre[i] >= l-1 && suf[(~i)&ALL] <= r+1) {
flag = 1; break;
}
rep (i, l, r) ans[i] = flag;
l = r + 1;
}
rep (i, 1, n) puts(ans[i] ? "Possible" : "Impossible");
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 262150
#define inf 2147483647
using namespace std;
struct pos1{int l, r;}pos[N][19];
int n, m, k, w[N], now, dp_l[N], dp_r[N], bin[19], x, ff, sum;
int main(){
scanf("%d%d", &n, &m);
bin[0]=1; for(int i=1; i<=18; i++)bin[i]=bin[i-1]<<1;
for(int i=1; i<=n; i++)scanf("%d", &w[i]); w[0]=w[1]-m-1; w[n+1]=w[n]+m+1;
k=-1; x=m<<1;
while(x){
k++; x>>=1; now=0;
for(int i=1; i<=n; i++){
if(w[i]-w[i-1]>x)now=i;
pos[i][k].l=now;
}
now=n+1;
for(int i=n; i; i--){
if(w[i+1]-w[i]>x)now=i;
pos[i][k].r=now;
}
}
dp_l[0]=0; dp_r[0]=n+1;
for(int i=1; i<=bin[k]-1; i++){
dp_l[i]=0; dp_r[i]=n+1;
for(int j=1; j<=k; j++)if(i&bin[j-1]){
dp_l[i]=max(dp_l[i], pos[dp_l[i-bin[j-1]]+1][j].r);
dp_r[i]=min(dp_r[i], pos[dp_r[i-bin[j-1]]-1][j].l);
}
}
sum=0; for(int i=1; i<=n; i++)if(pos[i][0].l==i)sum++;
if(sum>=k+2){for(int i=1; i<=n; i++)printf("Impossible\n"); return 0;}
for(int i=1; i<=n; i++)if(pos[i][0].l==i){
ff=0;
for(int j=0; j<=bin[k]-1; j++)if(dp_l[j]>=pos[i][0].l-1&&dp_r[bin[k]-1-j]<=pos[i][0].r+1){ff=1; break;}
for(int j=pos[i][0].l; j<=pos[i][0].r; j++)if(ff)printf("Possible\n"); else printf("Impossible\n");
}
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);
// cout<<endl;
// cout<<"pos: "<<pos<<" ma: "<<ma<<endl;
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];
}
// cout<<"mr: ";for(int i=1;i<=n;++i)cout<<mr[pos][i]<<" ";cout<<endl;
// cout<<"ml: ";for(int i=1;i<=n;++i)cout<<ml[pos][i]<<" ";cout<<endl;
}
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;
// cout<<"s: "<<s<<endl;
for(int i=0;i<s;++i)
{
// cout<<"i: "<<i<<" pre: "<<pre[i]<<" suf: "<<suf[i]<<endl;
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;
// cout<<"j: "<<j<<" invj: "<<((s^j)&ls)<<endl;
if(pre[j]>=L-1&&suf[(s^j)&ls]<=R+1)
{
ans[i]=1;
break;
}
}
}
out(ma);
return 0;
}
|
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <cstdlib>
using std::pair;
typedef pair<int,int> pii;
const int N = 200010;
const int M = 19;
int _w;
int max( int a, int b ) {
return a > b ? a : b;
}
int n, v, x[N], m;
int ans[N];
void answer() {
for( int i = 1; i <= n; ++i )
puts( ans[i] ? "Possible" : "Impossible" );
exit(0);
}
int R[M][N];
void prelude() {
int t = v;
for( m = 0; ; ++m, t >>= 1 ) {
R[m][n] = R[m][n+1] = n;
for( int j = n-1; j >= 1; --j )
if( x[j+1] - x[j] > t )
R[m][j] = j;
else R[m][j] = R[m][j+1];
if( !t ) break;
}
++m;
}
int f[1<<M];
bool check( int l, int r ) {
memset(f, 0, sizeof f);
if( l == 1 ) f[0] = r;
for( int i = 0; i < (1<<m); ++i )
for( int j = 1; j < m; ++j )
if( (i&(1<<j)) == 0 ) {
int k = i|(1<<j);
f[k] = max( f[k], R[j][f[i]+1] );
if( f[k] >= l-1 && f[k] <= r )
f[k] = r;
}
return f[(1<<m)-2] == n;
}
void solve() {
static pii tmp[N];
static int tn;
for( int i = 1; i <= n; i = R[0][i]+1 )
tmp[tn++] = pii(i, R[0][i]);
if( tn > m ) answer();
for( int i = 0; i < tn; ++i )
if( check(tmp[i].first, tmp[i].second) ) {
for( int j = tmp[i].first; j <= tmp[i].second; ++j )
ans[j] = 1;
}
answer();
}
int main() {
_w = scanf( "%d%d", &n, &v );
for( int i = 1; i <= n; ++i )
_w = scanf( "%d", x+i );
prelude(), solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define nn 65536*16
int xi[nn];int n,v;
vector<int> all;
int tol[nn][20],tor[nn][20];
int dpr[nn],dpl[nn],pre[nn];
void _min(int&x,int y){
x=min(x,y);
}
void _max(int&x,int y){
x=max(x,y);
}
void build(){
int u=v/2;while(u) all.push_back(u),u=u/2;all.push_back(0);
for(int i=0;i<all.size();i++){
tol[0][i]=tol[1][i]=1;for(int j=2;j<=n;j++)
if(all[i]>=xi[j]-xi[j-1]) tol[j][i]=tol[j-1][i];
else tol[j][i]=j;
tor[n+1][i]=tor[n][i]=n;for(int j=n-1;j>=1;j--)
if(all[i]>=xi[j+1]-xi[j]) tor[j][i]=tor[j+1][i];
else tor[j][i]=j;
}
memset(pre,0x3f,sizeof pre);memset(dpl,0x3f,sizeof dpl);
dpl[0]=n+1,dpr[0]=0;
for(int i=0;i<(1<<all.size());i++){
for(int j=0;j<all.size();j++) if((1<<j)&i);else{
_min(dpl[i|(1<<j)],tol[dpl[i]-1][j]);
_max(dpr[i|(1<<j)],tor[dpr[i]+1][j]);
}
}
for(int i=0;i<(1<<all.size());i++)
_min(pre[dpr[i]],dpl[((1<<all.size())-1)^i]);
for(int i=n-1;i>=0;i--) _min(pre[i],pre[i+1]);
}
int lb[nn],rb[nn];int pa[nn];
int find(int x){
if(pa[x]==x) return x;
return pa[x]=find(pa[x]);
}
void link(int x,int y){
x=find(x),y=find(y);
pa[x]=y;_min(lb[y],lb[x]);
_max(rb[y],rb[x]);
}
signed main(){
scanf("%d%d",&n,&v);for(int i=1;i<=n;i++) scanf("%d",&xi[i]);sort(xi+1,xi+n+1);
build();
for(int i=1;i<=n;i++) pa[i]=i,lb[i]=rb[i]=i;
for(int i=1;i<n;i++) if(xi[i+1]-xi[i]<=v) link(i,i+1);
for(int i=1;i<=n;i++){
int l=lb[find(i)],r=rb[find(i)];
if(pre[l-1]<=r+1) puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int,int>
#define mk make_pair
#define pb push_back
#define eb emplace_back
#define ins insert
#define fi first
#define se second
#define Rep(x,y,z) for(int x=y;x<=z;x++)
#define Red(x,y,z) for(int x=y;x>=z;x--)
using namespace std;
const int MAXN=2e5+5;
char buf[1<<12],*pp1=buf,*pp2=buf,nc;int ny;
inline char gc() {return pp1==pp2&&(pp2=(pp1=buf)+fread(buf,1,1<<12,stdin),pp1==pp2)?EOF:*pp1++;}
//inline char gc(){return getchar();}
inline int read(){
int x=0;for(ny=1;nc=gc(),(nc<48||nc>57)&&nc!=EOF;)if(nc==45)ny=-1;if(nc<0)return nc;
for(x=nc-48;nc=gc(),47<nc&&nc<58&&nc!=EOF;x=(x<<3)+(x<<1)+(nc^48));return x*ny;
}
int n,t,v,len[20],p[MAXN],Fl[1<<18],Fr[1<<18],S,a[MAXN];
vector<int>L[20],R[20];
int main(){
// freopen("std.in","r",stdin);
// freopen("std.out","w",stdout);
n=read(),v=read(),t=log2(v)+1,S=(1<<t)-1;
Rep(i,1,n)p[i]=read();
Rep(i,0,t){
len[i]=i?len[i-1]/2:v;
for(int l=1,r;l<=n;l=r+1){
for(r=l;r<n&&p[r+1]-p[r]<=len[i];r++);
L[i].pb(l),R[i].pb(r);
}
}
Rep(sta,0,S)Fr[sta]=n+1,Fl[sta]=0;
Rep(i,1,t)Fl[1<<i-1]=(*R[i].begin()),Fr[1<<i-1]=(*--L[i].end());
Rep(sta,1,S)Rep(j,1,t)if(~sta>>(j-1)&1){
int t=sta|(1<<j-1),pos;
pos=upper_bound(L[j].begin(),L[j].end(),Fl[sta]+1)-L[j].begin()-1;
assert(pos>=0&&pos<R[j].size()),Fl[t]=max(Fl[t],R[j][pos]);
pos=lower_bound(R[j].begin(),R[j].end(),Fr[sta]-1)-R[j].begin();
assert(pos>=0&&pos<L[j].size()),Fr[t]=min(Fr[t],L[j][pos]);
}
Rep(s,0,S){
int ed=upper_bound(L[0].begin(),L[0].end(),Fl[s]+1)-L[0].begin()-1,st=lower_bound(R[0].begin(),R[0].end(),Fr[S^s]-1)-R[0].begin();
if(st<=ed)a[st]++,a[ed+1]--;
}
for(int i=0;i<L[0].size();i++){
a[i]+=a[i-1];
Rep(j,L[0][i],R[0][i])puts(a[i]?"Possible":"Impossible");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 200010
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,tot=-1,bin[22],R[22][N],num[22],f1[N<<3],f2[N<<3],a[N];//R[i][k],第i层的第k条线段的右端点
//num[i],第i层的线段条数 f1[s],选择s状态的层数,左边从1开始最远能覆盖到哪里
int main(){
// freopen("a.in","r",stdin);
n=read();v=read();bin[0]=1;
for(int i=1;i<=20;++i) bin[i]=bin[i-1]<<1;
for(int i=1;i<=n;++i) a[i]=read();int x=v*2;
while(x){
x/=2;tot++;
for(int i=1;i<=n-1;++i){
if(a[i+1]-a[i]<=x) continue;
R[tot][++num[tot]]=i;
}R[tot][++num[tot]]=n;
}if(num[0]>tot+1){
for(int i=1;i<=n;++i) puts("Impossible");return 0;
}
for(int s=0;s<=bin[tot]-1;++s) f2[s]=n+1;
for(int s=0;s<=bin[tot]-1;++s)
for(int i=1;i<=tot;++i){
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);
}
for(int i=1;i<=num[0];++i){
bool flag=0;
for(int s=0;s<=bin[tot]-1;++s)
if(f1[s]>=R[0][i-1]&&f2[bin[tot]-1-s]<=R[0][i]+1){flag=1;break;}
for(int j=R[0][i-1]+1;j<=R[0][i];++j) puts(flag?"Possible":"Impossible");
}return 0;
} |
#include<cstdio>
#include<algorithm>
#define N_ 201000
using namespace std;
int n, V, w[N_], m;
int C[20][N_], L[20], PP[30];
int BE[20][N_], ED[20][N_];
int D1[1048576], D2[1048576];
int main(){
int i, j;
scanf("%d%d",&n,&V);
for(i=1;i<=n;i++)scanf("%d",&w[i]);
L[0] = V;
for(i=1;;i++){
L[i]=L[i-1]/2;
if(!L[i])break;
}
m = i+1;
for(i=0;i<m;i++){
int c = 0;
for(j=1;j<=n;j++){
if(j==1 || w[j]-w[j-1] > L[i])c++;
C[i][j] = c;
}
for(j=1;j<=c;j++)BE[i][j]=1e9,ED[i][j]=0;
for(j=1;j<=n;j++){
BE[i][C[i][j]] = min(BE[i][C[i][j]],j);
ED[i][C[i][j]] = max(ED[i][C[i][j]],j);
}
}
if(C[0][n] > m){
for(i=1;i<=n;i++)puts("Impossible");
return 0;
}
for(i=0;i<(1<<m);i++)D2[i] = n+1;
for(i=0;i<(1<<m);i++){
for(j=0;j<m;j++){
if(i&(1<<j))continue;
if(D1[i]!=n)D1[i|(1<<j)] = max(D1[i|(1<<j)], ED[j][C[j][D1[i]+1]]);
else D1[i|(1<<j)] = n;
if(D2[i]!=1)D2[i|(1<<j)] = min(D2[i|(1<<j)], BE[j][C[j][D2[i]-1]]);
else D2[i] = 1;
}
}
for(i=1;i<=C[0][n];i++){
int b = BE[0][i], e = ED[0][i];
for(j=0;j<(1<<m);j++){
if(j&1)continue;
int t = (1<<m) - 2 - j;
if(D1[j] + 1 >= b && D2[t] - 1 <= e)PP[i] = 1;
}
}
for(i=1;i<=n;i++){
if(PP[C[0][i]])puts("Possible");
else puts("Impossible");
}
} |
#include <bits/stdc++.h>
#define pb push_back
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=es[i].nxt,d=es[i].d)
using namespace std;
void read(int &x){ scanf("%d",&x); }
const int N=5e5+50,K=20,oo=1e9;
int suc[N],n,m,v,a[K],x[N],frw[1<<K],bkw[1<<K],R[K][N],L[K][N];
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
freopen("dat.in","r",stdin);
//freopen("my.out","w",stdout);
#endif
read(n),read(v);
rep(i,1,n){
read(x[i]);
}
//Range a[0,m]
for(;v;v>>=1)a[m++]=v;
rep(k,0,m){
L[k][0]=1,L[k][1]=1;
rep(i,2,n)L[k][i]=x[i]-x[i-1]<=a[k]?L[k][i-1]:i;
R[k][n+1]=n,R[k][n]=n;
dec(i,n-1,1)R[k][i]=x[i+1]-x[i]<=a[k]?R[k][i+1]:i;
}
fill(frw,frw+(1<<m),0);
fill(bkw,bkw+(1<<m),n+1);
lop(s,0,(1<<m)){
lop(i,0,m)if((s>>i&1)^1){
cmax(frw[s+(1<<i)],R[i+1][frw[s]+1]);
cmin(bkw[s+(1<<i)],L[i+1][bkw[s]-1]);
}
}
lop(s,0,(1<<m)){
int p=((1<<m)-1)^s;
int i=frw[s],j=bkw[p];
if(R[0][i+1]>=j-1)suc[R[0][i+1]]=true;
}
rep(i,1,n)puts(suc[R[0][i]]?"Possible":"Impossible");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define N 1111116
#define K 20
int n,m,v,a[N],l[N][K],r[N][K],f[N],g[N],h[N];
int read(){
int x=0,f=1;char ch=getchar();
for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int main(){
n=read();v=read();
for (int i=1;i<=n;i++) a[i]=read();
while (true){
l[1][m]=1;r[n][m]=n;
l[0][m]=1;r[n+1][m]=n;
for (int i=2;i<=n;i++)
l[i][m]=(a[i]-a[i-1]<=v)?l[i-1][m]:i;
for (int i=n-1;i>=1;i--)
r[i][m]=(a[i+1]-a[i]<=v)?r[i+1][m]:i;
m++;if (!v) break;v/=2;
}
fill(g,g+(1<<m),n+1);
for (int i=2;i<(1<<m);i+=2)
for (int j=1;j<m;j++)
if (i&(1<<j))
f[i]=max(f[i],r[f[i-(1<<j)]+1][j]),
g[i]=min(g[i],l[g[i-(1<<j)]-1][j]);
fill(h,h+n+1,0x3fffffff);
for (int i=0;i<(1<<m);i+=2)
h[f[i]]=min(h[f[i]],g[(1<<m)-2-i]);
for (int i=n-1;i>=0;i--)
h[i]=min(h[i],h[i+1]);
for (int i=1;i<=n;i++)
printf((h[l[i][0]-1]<=r[i][0]+1)?"Possible\n":"Impossible\n");
return 0;
} |
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int nxt[21][202020];
int bef[21][202020];
int dp1[1102020], dp2[1102020];
int d[202020];
int ans[202020];
int main()
{
int num, gen;
scanf("%d%d", &num, &gen);
d[0] = -1010101010, d[num + 1] = 1010101010;
for (int i = 1; i <= num; i++)scanf("%d", &d[i]);
int pt = 0;
for (;;)
{
int now = 0;
for (int i = 1; i <= num + 1; i++)
{
if (d[i] - d[i - 1] > gen)now = i - 1;
bef[pt][i] = now;
}
bef[pt][0] = 0;
now = num + 1;
for (int i = num; i >= 0; i--)
{
if (d[i + 1] - d[i] > gen)now = i + 1;
nxt[pt][i] = now;
}
nxt[pt][num + 1] = num + 1;
pt++;
if (gen == 0)break;
gen /= 2;
}
//for (int i = 0; i <= num + 1; i++)printf("%d %d\n", nxt[0][i], bef[0][i]);
fill(dp1, dp1 + (1 << pt), 1);
for (int p = 0; p < (1 << pt); p++)
{
for (int i = 0; i < pt; i++)
{
if (p&(1 << i))continue;
dp1[p + (1 << i)] = max(dp1[p + (1 << i)], nxt[i][dp1[p]]);
}
}
fill(dp2, dp2 + (1 << pt), num);
for (int p = 0; p < (1 << pt); p++)
{
for (int i = 0; i < pt; i++)
{
if (p&(1 << i))continue;
dp2[p + (1 << i)] = min(dp2[p + (1 << i)], bef[i][dp2[p]]);
}
}
//for (int i = 0; i < (1 << pt); i++)printf("%d %d\n", dp1[i], dp2[i]);
for (int p = 0; p < (1 << pt); p+=2)
{
int q = (1 << pt) - 2 - p;
if (nxt[0][dp1[p]]>dp2[q])ans[dp1[p]] = 1;
}
int t = 0;
for (;;)
{
if (ans[t])
{
for (int j = t; j < nxt[0][t]; j++)ans[j] = 1;
t = nxt[0][t];
}
else t++;
if (t == num + 1)break;
}
for (int i = 1; i <= num; i++)printf(ans[i] ? "Possible\n" : "Impossible\n");
} |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N=200200,D=20;
int i,j,k,n,m,nm,mm,ch,ff;
int x[N],pre[1<<D],suf[1<<D],ans[N];
vector<int> X[D];
void R(int &x) {
ff=x=0;ch=getchar();
while (ch<'0' || '9'<ch) { if (ch=='-') ff=1;ch=getchar();}
while ('0'<=ch && ch<='9') x=x*10+ch-'0',ch=getchar();
if (ff) x=-x;
}
int find1(int i,int x) {
int l=0,r=X[i].size()-1,mid;
while (l<r) {
mid=(l+r+1)>>1;
if (X[i][mid]>x) r=mid-1;
else l=mid;
}
return l;
}
int find2(int i,int x) {
int l=0,r=X[i].size()-1,mid;
while (l<r) {
mid=(l+r-1)>>1;
if (X[i][mid]<x) l=mid+1;
else r=mid;
}
return l;
}
void Max(int &x,int y) {
if (y>x) x=y;
}
void Min(int &x,int y) {
if (y<x) x=y;
}
int main() {
R(n);R(m);
for (i=1;i<=n;i++) R(x[i]);
k=m;
while (1) {
X[nm].push_back(1);
for (i=1;i<n;i++) if (x[i]+k<x[i+1]) X[nm].push_back(i+1);
X[nm].push_back(n+1);
nm++;
if (!k) break;
k>>=1;
}
mm=1<<nm;
for (i=0;i<mm;i++) suf[i]=n+1;
for (i=0;i<mm;i+=2)
for (j=1;j<nm;j++) if (!(i&1<<j)) {
Max(pre[i|1<<j],X[j][find1(j,pre[i]+1)+1]-1);
Min(suf[i|1<<j],X[j][find2(j,suf[i])-1]);
}
if (X[0].size()>mm+1) {
for (i=0;i<n;i++) puts("Impossible");
return 0;
}
for (i=1;i<X[0].size();i++) {
int l=X[0][i-1],r=X[0][i]-1,fg=0;
for (j=0;j<mm;j+=2) if (pre[j]+1>=l && suf[(mm-2)^j]-1<=r) {
fg=1;
break;
}
for (j=l;j<=r;j++) ans[j]=fg;
}
for (i=1;i<=n;i++) {
if (ans[i]) puts("Possible");
else puts("Impossible");
}
} |
#include<bits/stdc++.h>
#define N 600009
using namespace std;
int n,m,cnt,a[N],b[109],p[20][N],q[20][N],f[N],g[N];
struct node{ int x,y; }c[N];
bool cmp(node u,node v){ return u.y<v.y; }
int main(){
scanf("%d%d",&n,&m);
int i,j,k;
for (i=1; i<=n; i++) scanf("%d",&a[i]);
for (; m; m>>=1) b[++cnt]=m; cnt++;
for (i=1; i<=(cnt>>1); i++) swap(b[i],b[cnt-i+1]);
for (i=1; i<=cnt; i++){
p[i][n]=n; q[i][1]=1;
for (j=n-1; j; j--) p[i][j]=(a[j+1]-a[j]<=b[i]?p[i][j+1]:j);
for (j=2; j<=n; j++) q[i][j]=(a[j]-a[j-1]<=b[i]?q[i][j-1]:j);
}
m=1<<cnt-1;
for (i=0; i<m; i++) g[i]=n+1;
for (i=1; i<m; i++)
for (j=1; j<cnt; j++) if (i>>j-1&1){
k=i^1<<j-1;
f[i]=max(f[i],f[k]<n?p[j][f[k]+1]:n);
g[i]=min(g[i],g[k]>1?q[j][g[k]-1]:1);
}
for (i=0; i<m; i++)
if (f[i]+1<g[m-1^i]) c[i+1]=(node){f[i]+1,g[m-1^i]-1};
else{
for (i=1; i<=n; i++) puts("Possible"); return 0;
}
sort(c+1,c+m+1,cmp);
for (i=j=1,k=0; i<=n; i++){
for (; j<=m && c[j].y<=p[cnt][i]; j++)
k=max(k,c[j].x);
puts(k<q[cnt][i]?"Impossible":"Possible");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int a[N],cnt,n,v,b[N],f[1<<18];
int c[19][N];
bool ans[N];
inline void Max(int &x,int y){if(y>x)x=y;}
int main(){
scanf("%d%d",&n,&v);
for(int i =1;i<=n;i++)scanf("%d",a+i);
sort(a+1,a+n+1);
int last = 1,tot = 0;
for(int i = 2;i<=n;i++){
if(a[i]>a[i-1]+v) {
for(int j = last;j<i;j++) c[0][j] =i-1;
last = i;
tot++;
}
}
tot++;
for(int j=last;j<=n;j++) c[0][j]= n;
if(tot>18){
for(int i =1;i<=n;i++) puts("Impossible");
return 0;
}
for(int st=1,fi;st<=n;st=fi+1){
fi = c[0][st];
int tmp = v;
cnt = 0;
int m = 0;
bool pd = false;
for(int i =1;i<st;i++) b[++m] = a[i];
for(int i =fi+1;i<=n;i++) b[++m] = a[i];
do{
cnt++;
tmp>>=1;
int last = 1;
for(int i = 2;i<=m;i++){
if(b[i]>b[i-1]+tmp) {
for(int j = last;j<i;j++) c[cnt][j] =i-1;
last = i;
}
}
for(int j=last;j<=m;j++) c[cnt][j]= m;
} while(tmp>0);
//cout<<start<<' '<<*it<<endl;
memset(f,0,sizeof(f));
for(int k = 0;k<1<<cnt;k++){
if(f[k] == m) {
pd =true;
continue;
}
for(int j = 1;j<=cnt;j++) if(!(k>>j-1&1)){
Max(f[k+(1<<j-1)],c[j][f[k]+1]);
}
}
for(int i =st;i<=fi;i++) ans[i] = pd;
}
for(int i=1;i<=n;i++)
if(ans[i]) puts("Possible");
else puts("Impossible");
return 0;
} |
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=200005,INF=0x3F3F3F3F,MAXLG=25;
int N,V,lgV,X[MAXN];
int f1[MAXN*4],f2[MAXN*4];
vector<int> seg[MAXLG];
bool ans[MAXN];
int main()
{
scanf("%d%d",&N,&V);
for(int i=1;i<=N;i++)
scanf("%d",&X[i]);
X[0]=-INF;
X[N+1]=INF;
for(int d=V;;d/=2)
{
lgV++;
for(int i=1;i<=N+1;i++)
if(X[i]-X[i-1]>d)
seg[lgV].push_back(i-1);
seg[lgV].push_back(N+1);
if(d==0)
break;
}
if((int)seg[1].size()-2>lgV)
{
for(int i=1;i<=N;i++)
puts("Impossible");
return 0;
}
f1[0]=0;
for(int s=1;s<(1<<lgV);s++)
for(int i=1;i<=lgV;i++)
if((s&(1<<(i-1))))
{
int ts=s^(1<<(i-1));
f1[s]=max(f1[s],f1[ts]);
if(f1[s]==N)
continue;
auto it=upper_bound(seg[i].begin(),seg[i].end(),f1[ts]);
f1[s]=max(f1[s],*it);
}
memset(f2,0x3F,sizeof f2);
f2[0]=N+1;
for(int s=1;s<(1<<lgV);s++)
for(int i=1;i<=lgV;i++)
if((s&(1<<(i-1))))
{
int ts=s^(1<<(i-1));
f2[s]=min(f2[s],f2[ts]);
if(f2[s]==1)
continue;
auto it=lower_bound(seg[i].begin(),seg[i].end(),f2[ts]-1);
if(it==seg[i].begin())
continue;
it--;
f2[s]=min(f2[s],*it+1);
}
for(int i=1;i<(int)seg[1].size()-1;i++)
{
int l=seg[1][i-1]+1,r=seg[1][i];
for(int s=0;s<(1<<lgV);s+=2)
{
int ts=((1<<lgV)-1)^s^1;
if(f1[s]>=l-1&&f2[ts]<=r+1)
{
ans[i]=true;
break;
}
}
}
for(int i=1,j=1;i<=N;i++,j=(i>seg[1][j]?j+1:j))
puts(ans[j]?"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(dp[(1<<m)-1]<n && 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<bits/stdc++.h>
#define L long long
using namespace std;
int n,m,p,x[20],a[200010],l[200010][20],r[200010][20],f[300000],g[300000],w[200010];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j,k;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
x[0]=m;
while(x[p])
x[++p]=x[p-1]/2;
for(i=0;i<=p;i++)
{
for(j=k=1;j<=n;j++)
{
if(j>1 && a[j]-a[j-1]>x[i])
k=j;
l[j][i]=k;
}
for(j=k=n;j>0;j--)
{
if(j<n && a[j+1]-a[j]>x[i])
k=j;
r[j][i]=k;
}
r[n+1][i]=n+1;
}
for(i=0;i<(1<<p);i++)
g[i]=n+1;
for(i=1;i<(1<<p);i++)
for(j=1;j<=p;j++)
if(i&(1<<j-1))
{
f[i]=max(f[i],r[f[i^(1<<j-1)]+1][j]);
g[i]=min(g[i],l[g[i^(1<<j-1)]-1][j]);
}
for(i=0;i<(1<<p);i++)
{
j=l[g[i]-1][0];
k=r[f[(1<<p)-1^i]+1][0];
if(j<=k)
w[j]++,w[k+1]--;
}
for(i=1,k=0;i<=n;i++)
{
k+=w[i];
if(k)
printf("Possible\n");
else
printf("Impossible\n");
}
return 0;
}
|
#include<bits/stdc++.h>
const int N = 400010;
const int M = 21;
int a[N], v[N], dppre[1 << M], dpsuf[1 << M], pre[M][N], suf[M][N], ans[N];
int n, V, m;
int main(){
scanf("%d%d", &n, &V);
v[0] = V;
for (int i = 1; ; ++ i){
v[i] = v[i - 1] >> 1;
if (!v[i]){
m = i + 1;
break;
}
}
for (int i = 0; i < n; ++ i){
scanf("%d", &a[i]);
}
for (int i = 0; i < m; ++ i){
pre[i][n - 1] = n - 1;
for (int j = n - 2; j >= 0; -- j){
if (a[j + 1] - a[j] <= v[i]){
pre[i][j] = pre[i][j + 1];
}
else{
pre[i][j] = j;
}
}
}
for (int i = 0; i < M; ++ i){
suf[i][0] = 0;
for (int j = 0; j < n - 1; ++ j){
if (a[j + 1] - a[j] <= v[i]){
suf[i][j + 1] = suf[i][j];
}
else{
suf[i][j + 1] = j + 1;
}
}
}
memset(dppre, -1, sizeof(dppre));
for (int i = 0; i < 1 << m; ++ i){
dpsuf[i] = n;
}
for (int i = 0; i < 1 << m - 1; ++ i){
int x = dppre[i];
for (int j = 0; j < m - 1; ++ j){
if (i >> j & 1){
continue;
}
int &y = dppre[i | 1 << j];
if (x == n - 1){
y = n - 1;
}
y = std::max(y, pre[j + 1][x + 1]);
}
x = dpsuf[i];
for (int j = 0; j < m - 1; ++ j){
if (i >> j & 1){
continue;
}
int &y = dpsuf[i | 1 << j];
if (!x){
y = 0;
}
y = std::min(y, suf[j + 1][x - 1]);
}
}
for (int i = 0; i < 1 << m - 1; ++ i){
int j = (1 << m - 1) - i - 1;
int x = dppre[i] + 1, y = dpsuf[j] - 1;
if (x >= y){
++ ans[0];
-- ans[n];
}
if (pre[0][x] >= y){
++ ans[suf[0][x]];
-- ans[pre[0][y] + 1];
}
}
for (int i = 0; i < n; ++ i){
ans[i + 1] += ans[i];
printf(ans[i] ? "Possible\n" : "Impossible\n");
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 1000000
#define INF 2000000000
using namespace std;
int n,V,x[MAXN+5];
int cnt[25];
int l[25][MAXN+5],r[25][MAXN+5];
int f1[MAXN*5+5],f2[MAXN*5+5];
bool ans[MAXN+5];
void Init()
{
for(int i=0;i<=MAXN*5+3;i++)
f1[i]=0,f2[i]=INF;
}
int UpFind(int id,int pos)
{
// if(cnt[id]==0)
// return pos;
pos++;
int p=upper_bound(l[id]+1,l[id]+cnt[id]+1,pos)-l[id];
p--;
if(p<=0)
return pos;
return max(r[id][p],pos-1);
}
int LowFind(int id,int pos)
{
// if(cnt[id]==0)
// return 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()
{
Init();
scanf("%d %d",&n,&V);
int logV=0;
for(logV=0;(1<<logV)<=V;logV++);
for(int i=1;i<=n;i++)
scanf("%d",&x[i]);
x[n+1]=INF;
x[0]=-INF;
for(int LG=0;LG<=logV;LG++)
{
int d=V/(1<<LG);
cnt[LG]=1;
l[LG][1]=1;
for(int i=1;i<=n;i++)
{
r[LG][cnt[LG]]=i;
if(x[i+1]-x[i]>d)
{
cnt[LG]++;
l[LG][cnt[LG]]=i+1;
}
}
cnt[LG]--;
}
if(cnt[0]>logV+1)
{
for(int i=1;i<=n;i++)
printf("Impossible\n");
return 0;
}
int all=(1<<(logV+1));
f1[0]=0,f2[0]=n+1;
for(int s=0;s<all;s+=2)
for(int i=0;i<=logV;i++)
{
if(!(s&(1<<i)))
continue;
f1[s]=max(f1[s],UpFind(i,f1[s-(1<<i)]));
f2[s]=min(f2[s],LowFind(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<all;s1+=2)
{
int s2=all-1-s1-1;
int lpos=f1[s1];
int rpos=f2[s2];
if(lpos>=ln-1&&rpos<=rn+1)
{
ans[i]=true;
break;
}
}
}
int pos=1;
for(int i=1;i<=n;i++)
{
if(ans[pos]==true)
printf("Possible\n");
else
printf("Impossible\n");
if(x[i+1]-x[i]>V)
pos++;
}
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 x[MN],fr[MN],fl[MN],s[MN];
void input(){
IN(n),IN(V);
for(int i=1;i<=n;++i)IN(x[i]);
int k;//x[0]=INT_MIN/10,x[n+1]=INT_MAX/10;
for(k=0;V;++k,V>>=1){
l[k][1]=1;
for(int i=2;i<=n;++i)l[k][i]=x[i]-x[i-1]>V?i:l[k][i-1];
r[k][n]=n;
for(int i=n-1;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;
}
l[k][1]=1;
for(int i=2;i<=n;++i)l[k][i]=x[i]-x[i-1]>V?i:l[k][i-1];
r[k][n]=n;
for(int i=n-1;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<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
using namespace std;
typedef long long LL;
const int N=1<<18;
int gi() {
int w=0;bool q=1;char c=getchar();
while ((c<'0'||c>'9') && c!='-') c=getchar();
if (c=='-') q=0,c=getchar();
while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
return q? w:-w;
}
int L[N],R[N],x[N];
int p[18][N],q[N];
int ans[N];
inline void umin(int &x,int y) { y<x?x=y:0; }
inline void umax(int &x,int y) { x<y?x=y:0; }
int main()
{
int n=gi()-1,v=gi(),i,j,k=v,m=0,u[20]={},s;
while (k) u[m++]=k>>=1;
for (i=0;i<=n;i++) x[i]=gi();
for (i=n;i;i--) x[i]-=x[i-1];
for (i=0;i<m;i++) {
p[i][n+1]=n+1;
for (j=n;j;j--)
p[i][j]=x[j]<=u[i]?p[i][j+1]:j;
}
for (s=0;s<1<<m;s++)
for (i=0;i<m;i++)
if (!(s>>i&1))
umax(L[s|1<<i],p[i][L[s]+1]);
for (i=0;i<m;i++)
for (j=1;j<=n;j++)
p[i][j]=x[j]<=u[i]?p[i][j-1]:j;
for (s=0;s<1<<m;s++) R[s]=n+1;
for (s=0;s<1<<m;s++)
for (i=0;i<m;i++)
if (!(s>>i&1))
umin(R[s|1<<i],R[s|1<<i]?p[i][R[s]-1]:0);
memset(ans,0x3f,sizeof(ans));
for (s=0;s<1<<m;s++)
umin(ans[L[s]],R[((1<<m)-1)^s]);
for (i=1;i<=n;i++) umin(ans[i-1],ans[i]);
for (i=n,q[n+1]=n+1;i;i--)
q[i]=x[i]>v?i:q[i+1];
for (i=0;i<=n;i++) {
if (!i||x[i]>v) k=i;
puts(ans[k]<=q[i+1]?"Possible":"Impossible");
}
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int x[200010],dv[200010],m,L[200010],R[200010],c[200010];
std::vector<int>P[200010];
int fl[262147],fr[262147];
int main(){
#ifdef XZZSB
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
int n=gi(),V=gi();
for(int i=1;i<=n;++i)x[i]=gi();
for(int i=V,j=0;~i;i>>=1,++j){
dv[j]=i;P[m=j].push_back(0);
for(int l=1,r;l<=n;l=r+1){
r=l;while(r<n&&x[r+1]-x[r]<=i)++r;
P[j].push_back(r);
if(!j)for(int o=l;o<=r;++o)L[o]=l,R[o]=r;
}
if(!i)break;
}
for(int i=0;i<1<<m;++i){
for(int j=1;j<=m;++j){
if((i>>j-1)&1)continue;
int p;
if(fl[i]==n)p=n;
else p=*std::upper_bound(P[j].begin(),P[j].end(),fl[i]);
fl[i|(1<<j-1)]=std::max(fl[i|(1<<j-1)],p);
}
}
for(int i=0;i<1<<m;++i)fr[i]=n+1;
for(int i=0;i<1<<m;++i){
for(int j=1;j<=m;++j){
if((i>>j-1)&1)continue;
int p;
if(fr[i]==1)p=1;
else p=*--std::lower_bound(P[j].begin(),P[j].end(),fr[i]-1)+1;
fr[i|(1<<j-1)]=std::min(fr[i|(1<<j-1)],p);
}
}
for(int i=0;i<1<<m;++i){
int l=fl[i]+1,r=fr[((1<<m)-1)^i]-1;
if(l>r)++c[1];
else if(*std::lower_bound(P[0].begin(),P[0].end(),l)>=r)++c[l],--c[r+1];
}
for(int i=1;i<=n;++i)c[i]+=c[i-1];
for(int i=1;i<=n;++i)puts(c[i]?"Possible":"Impossible");
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,mx,s,i,j,cnt,sz,la,a[500010],b[500010],c[500010][2],hd[21][200010],
pr[21][200010],f[500010],g[500010],d[500010];
int main(){
scanf("%d%d",&n,&m);la=m;
for(i=1;i<=n;i++)scanf("%d",&a[i]);
m/=2;
while(1){
b[cnt++]=m;
if(!m)break;m/=2;
}
mx=1<<cnt;
for(j=0;j<cnt;j++){
//printf("%d\n",b[j]);
hd[j][n]=n;hd[j][n+1]=n+1;
for(i=n-1;i;i--){
if(a[i+1]-a[i]>b[j])hd[j][i]=i;
else hd[j][i]=hd[j][i+1];
}
pr[j][1]=1;
for(i=2;i<=n;i++){
if(a[i]-a[i-1]>b[j])pr[j][i]=i;
else pr[j][i]=pr[j][i-1];
//printf("%d %d %d\n",i,pr[j][i],hd[j][i]);
}
//puts("");
}
c[sz=1][0]=1;
for(i=2;i<=n;i++){
if(a[i]-a[i-1]>la)c[sz][1]=i-1,c[++sz][0]=i;
}
c[sz][1]=n;
//printf("%d\n",sz);
if(sz>20){
for(i=1;i<=n;i++)puts("Impossible");
return 0;
}
memset(g,44,sizeof(g));
g[0]=n+1;
for(s=0;s<mx;s++){
//printf("%d %d %d\n",s,f[s],g[s]);
for(i=0;i<cnt;i++)if(!(s&(1<<i))){
f[s|(1<<i)]=min(n,max(f[s|(1<<i)],hd[i][f[s]+1]));
g[s|(1<<i)]=max(1,min(g[s|(1<<i)],pr[i][g[s]-1]));
}
}
//memset(g,44,sizeof(g));
for(i=1;i<=sz;i++)
for(s=0;s<mx;s++)if(f[s]>=c[i][0]-1&&g[(mx-1)^s]<=c[i][1]+1)d[c[i][0]]++,d[c[i][1]+1]--;
for(i=1;i<=n;i++)d[i]+=d[i-1];
for(i=1;i<=n;i++)if(d[i])puts("Possible");
else puts("Impossible");
} |
#include<cstdio>
#include<vector>
#include<map>
int N,V,x[200010],fa[3600010],tot;
std::vector<int>ch[3600010];
int addc(int x){
int y=++tot;
fa[y]=x;ch[x].push_back(y);
return y;
}
std::map<std::vector<int>,bool>M;
bool dfs(std::vector<int>v,int d){
if(v.size()>d)return 0;
if(!v.size())return 1;
if(M.count(v))return M[v];
int cs=0;
for(int i=0;i<v.size();i++)cs+=ch[v[i]].size();
for(int i=0;i<v.size();i++)if(cs-ch[v[i]].size()<d){
std::vector<int>w;
for(int j=0;j<v.size();j++)if(j!=i){
int c=v[j];
for(int k=0;k<ch[c].size();k++)w.push_back(ch[c][k]);
}
if(dfs(w,d-1))return M[v]=1;
}
return M[v]=0;
}
int get_sz(int i){
if(!ch[i].size())return 1;
int sz=0;
for(int j=0;j<ch[i].size();j++)sz+=get_sz(ch[i][j]);
return sz;
}
bool res[200010];
int main(){
scanf("%d%d",&N,&V);
int cur=0,d=0;
for(int i=0;i<N;i++){
scanf("%d",x+i);
while(d&&x[i]-x[i-1]>V>>d-1)cur=fa[cur],--d;
while(V>>d)cur=addc(cur),++d;
cur=addc(cur);++d;
}
if(ch[0].size()<=d){
int cnt=0;
for(int i=0;i<ch[0].size();i++){
std::vector<int>v;
bool r=1;
for(int j=0;j<ch[0].size()&&r;j++)if(j!=i){
int c=ch[0][j];
if(v.size()+ch[c].size()>=d)r=0;
else for(int k=0;k<ch[c].size();k++)v.push_back(ch[c][k]);
}
if(r)r=dfs(v,d-1);
for(int t=get_sz(ch[0][i]);t--;)res[cnt++]=r;
}
}
for(int i=0;i<N;i++)puts(res[i]?"Possible":"Impossible");
} |
# include <bits/stdc++.h>
using namespace std;
int N, V;
const int maxn = 200010;
int f[1<<20], g[1<<20];
int x[maxn], l[maxn][20], r[maxn][20];
int val[20];
int m, mask;
int main() {
scanf("%d%d", &N, &V);
for(int i = 0; i < N; ++i) scanf("%d", &x[i]);
for(int v = V; v; v /= 2) val[m++] = v;
val[m++] = 0;
mask = (1 << m) - 2;
for(int i = 0; i < N; ++i) {
for(int j = 0; j < m; ++j) {
l[i][j] = i;
if(i && x[i] - x[i-1] <= val[j]) l[i][j] = l[i-1][j];
}
}
for(int i = N - 1; i >= 0; --i) {
for(int j = 0; j < m; ++j) {
r[i][j] = i;
if(i + 1 < N && x[i+1] - x[i] <= val[j]) r[i][j] = r[i+1][j];
}
}
f[0] = 0;
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]][j] + 1);
memset(g, 0x3f, sizeof(g));
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]][j] - 1);
for(int i = 0; i < N; i = r[i][0] + 1) {
bool flag = false;
for(int k = 0; k < 1<<m; k += 2) {
if(f[k] >= i && g[k ^ mask] <= r[i][0]) {
flag = true; break;
}
}
if(flag) for(int j = i; j <= r[i][0]; ++j) puts("Possible");
else for(int j = i; j <= r[i][0]; ++j) puts("Impossible");
}
return 0;
}
|
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M 200020
#define INF 1000001000
using namespace std;
int read(){
int nm=0,fh=1; int cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm*fh;
}
int tot,n,m,pos[M],L[M][21],R[M][21],V[40],rt;
int RF[M<<3],LF[M<<3],G[M],D[M],MAXN;
int main(){
n=read(),m=read();
for(int i=1;i<=n;i++) pos[i]=read(),D[i]=pos[i]-pos[i-1],G[i]=-(INF<<1);
while(m) V[tot++]=m,m>>=1; tot++;
for(int k=0;k<tot;k++){
for(int i=1;i<=n;i++){
R[i][k]=max(R[i-1][k]-1,1);
while(i+R[i][k]<=n&&D[i+R[i][k]]<=V[k]) R[i][k]++;
}
for(int i=n;i;i--){
L[i][k]=max(L[i+1][k]-1,1);
while(i-L[i][k]>0&&D[i-L[i][k]+1]<=V[k]) L[i][k]++;
}
} MAXN=(1<<tot);
for(int i=2;i<MAXN;i+=2){
for(int k=1;k<tot;k++){
int w=(1<<k); if(!(i&w)) continue;
LF[i]=max(LF[i],LF[i^w]+R[LF[i^w]+1][k]);
RF[i]=max(RF[i],RF[i^w]+L[n-RF[i^w]][k]);
} LF[i]=min(LF[i],n),RF[i]=min(RF[i],n);
}
for(int k=0;k<MAXN;k+=2) G[LF[k]]=max(G[LF[k]],RF[(MAXN-2)^k]);
for(int i=n-1;i>=0;i--) G[i]=max(G[i],G[i+1]);
for(int i=1;i<=n;i++) puts(G[i-L[i][0]]+R[i][0]+i-1>=n?"Possible":"Impossible");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 300005
#define pb push_back
#define forup(i,a,b) for(int i=(a);i<=(b);i++)
#define fordown(i,a,b) for(int i=(a);i>=(b);i--)
#define INF 1000000007
int N;
int V[30],Rmost[maxn][30],Lmost[maxn][30];
int dpL[1<<20],dpR[1<<20];
int arr[maxn];
int dp[maxn];
int main()
{ cin>>N; cin>>V[0];
forup(i,1,N) 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))
{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]);
}
}
forup(i,0,N+1) dp[i]=-INF;
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]);
}
forup(i,1,N+1)
dp[i]=max(dp[i],dp[i-1]);
forup(i,1,N)
{int L=Lmost[i][0],R=Rmost[i][0];
int det=dp[R+1];
if(det>=L-1) puts("Possible");
else puts("Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
int n,v[20],x[N],dep,dpl[N],dpr[N];
int blo[20][N],L[20][N],R[20][N];
void init(int dep){
int cnt=0;
blo[dep][1]=L[dep][1]=R[dep][1]=cnt=1;
for (int i=2;i<=n;i++){
if (x[i-1]+v[dep]>=x[i]) blo[dep][i]=cnt,R[dep][cnt]++;else
blo[dep][i]=++cnt,L[dep][cnt]=R[dep][cnt]=i;
}
L[dep][0]=1;R[dep][0]=n;
}
bool ans[N];
int main()
{
scanf("%d%d",&n,&v[0]);
while (v[dep]) v[dep+1]=v[dep]>>1,dep++;
for (int i=1;i<=n;i++) scanf("%d",&x[i]);
for (int i=0;i<=dep;i++) init(i);
int U=(1<<dep)-1;
for (int S=1;S<=U;S++)
for (int i=0;i<dep;i++)
if (S>>i&1) dpl[S]=max(dpl[S],R[i+1][blo[i+1][dpl[S^(1<<i)]+1]]);
for (int S=0;S<=U;S++) dpr[S]=n+1;
for (int S=1;S<=U;S++)
for (int i=0;i<dep;i++)
if (S>>i&1) dpr[S]=min(dpr[S],L[i+1][blo[i+1][dpr[S^(1<<i)]-1]]);
if (blo[0][n]<=20){
for (int i=1;i<=blo[0][n];i++){
int l=L[0][i],r=R[0][i];bool ok=0;
for (int S=0;S<=U;S++)
if (dpl[S]>=l-1&&dpr[U^S]<=r+1) ok=1;
if (!ok) continue;
for (int j=l;j<=r;j++) ans[j]=1;
}
}
for (int i=1;i<=n;i++) puts(ans[i]?"Possible":"Impossible");
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
T i=0;char c;
while(!isdigit(c=getchar())&&c!='-');
bool flag=c=='-';
flag?c=getchar():0;
while(i=i*10-'0'+c,isdigit(c=getchar()));
return flag?-i:i;
}
template<class T1,class T2>inline void apmax(T1 &a,const T2 &b){if(a<b)a=b;}
template<class T1,class T2>inline void apmin(T1 &a,const T2 &b){if(b<a)a=b;}
const int N=200010,SH=19,SN=1<<SH,INF=0x7f7f7f7f;
int tol[N][SH],tor[N][SH];
int fl[SN],fr[SN];
int x[N],v[N];
int ext[N];
int main(){
int n=ni,vs=0;
v[0]=ni;
for(int &i=vs;v[i];i++){
v[i+1]=v[i]>>1;
}
for(int i=1;i<=n;i++){
x[i]=ni;
}
for(int j=0;j<=vs;j++){
for(int i=1;i<=n;i++){
tol[i][j]=i>1&&x[i]-x[i-1]<=v[j]?tol[i-1][j]:i;
}
for(int i=n;i>=1;i--){
tor[i][j]=i<n&&x[i+1]-x[i]<=v[j]?tor[i+1][j]:i;
}
}
for(int s=0,ts=1<<vs;s<ts;s++){
fl[s]=0;
for(int i=1;i<=vs;i++){
if((s>>(i-1))&1){
apmax(fl[s],tor[fl[s^(1<<(i-1))]+1][i]);
}
}
}
for(int s=0,ts=1<<vs;s<ts;s++){
fr[s]=n+1;
for(int i=1;i<=vs;i++){
if((s>>(i-1))&1){
apmin(fr[s],tol[fr[s^(1<<(i-1))]-1][i]);
}
}
}
memset(ext,127,sizeof(ext));
for(int s=0,ts=1<<vs;s<ts;s++){
apmin(ext[fl[s]],fr[s^(ts-1)]);
}
for(int i=n;i>=1;i--){
apmin(ext[i-1],ext[i]);
}
for(int i=1;i<=n;i++){
puts(ext[tol[i][0]-1]<=tor[i][0]+1?"Possible":"Impossible");
}
return 0;
} |
#include<stdio.h>
void fmax(int&a,int b){
if(b>a)a=b;
}
void fmin(int&a,int b){
if(b<a)a=b;
}
int x[200010],l[20][200010],r[20][200010],n;
void pre(int p,int d){
int*l=::l[p],*r=::r[p],i;
l[1]=1;
for(i=2;i<=n;i++)l[i]=x[i]-x[i-1]>d?i:l[i-1];
r[n]=n;
for(i=n-1;i>0;i--)r[i]=x[i+1]-x[i]>d?i:r[i+1];
l[0]=1;
r[n+1]=n;
}
int fl[262144],fr[262144],s[200010];
void gao(int l,int r){
if(l<=r){
s[l]++;
s[r+1]--;
}
}
int main(){
int V,M,i,j;
scanf("%d%d",&n,&V);
for(i=1;i<=n;i++)scanf("%d",x+i);
for(M=0;V;V>>=1)pre(M++,V);
pre(M,0);
fr[0]=n+1;
for(i=1;i<1<<M;i++){
fr[i]=n;
for(j=0;j<M;j++){
if(i>>j&1){
fmax(fl[i],r[j+1][fl[i^(1<<j)]+1]);
fmin(fr[i],l[j+1][fr[i^(1<<j)]-1]);
}
}
}
for(i=0;i<1<<M;i++){
gao(l[0][fr[((1<<M)-1)^i]-1],r[0][fl[i]+1]);
}
for(i=1;i<=n;i++){
s[i]+=s[i-1];
puts(s[i]?"Possible":"Impossible");
}
} |
#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],lst[20][MN+5],res[MN+5],f[1<<18],g[1<<18];
inline void R(int&x,int y){y>x?x=y:0;}
inline void L(int&x,int y){y<x?x=y:0;}
void Dp()
{
memset(f,200,sizeof(f));f[0]=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]]);
memset(g,63,sizeof(g));g[0]=n;
for(int i=0;i<1<<s;++i)
for(int j=1;j<=s;++j) if(!(i&(1<<j-1)))
L(g[i|(1<<j-1)],lst[j][g[i]]);
}
void Solve(int l,int r)
{
bool flag=0;
for(int i=0;i<1<<s;++i)
if(f[i]>=l&&g[(1<<s)-1-i]<=r) {flag=1;break;}
if(flag)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;
lst[s][0]=lst[s][1]=0;
for(int i=2;i<=n;++i) lst[s][i]=x[i]-x[i-1]>t?i-1:lst[s][i-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;Dp();
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 ll long long
#define re register
#define ull usigned ll
using namespace std;
inline int read(){
int s=0,t=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')t=-1;ch=getchar();}
while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+(ch^48),ch=getchar();
return s*t;
}
const int N=(1<<19);
int n,m,U,Num,s[19],p[N];
int L[19][N],R[19][N],dl[N],dr[N];
int Calc(int m){
int lim=0;
while(m)s[lim++]=m,m>>=1;
return ++lim;
}
int main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
n=read(),m=Calc(read()),U=(1<<m)-1;
for(int i=1;i<=n;i++)p[i]=read();
for(int k=0;k<m;k++){
for(int i=1,j=0;i<=n;){
for(j=i;j<n&&p[j+1]-p[j]<=s[k];j++);
for(;i<=j;i++)R[k][i]=j;
}
for(int i=n,j=0;i>=1;){
for(j=i;j>1&&p[j]-p[j-1]<=s[k];j--);
for(;i>=j;i--)L[k][i]=j;
}
}
for(int S=0;S<=U;S++)dl[S]=0,dr[S]=n+1;
for(int S=0;S<=U;S++){
for(int i=0;i<m;i++)
if(!(S>>i&1)){
int T=S|(1<<i);
dl[T]=max(dl[T],min(n,R[i][dl[S]+1]));
dr[T]=min(dr[T],max(1,L[i][dr[S]-1]));
}
}
for(int i=1;i<=n;i=R[0][i]+1)Num++;
if(Num>m){for(int i=1;i<=n;i++)puts("Impossible");return 0;}
for(int i=1;i<=n;i=R[0][i]+1){
int l=i,r=R[0][i],t=0;
for(int S=0;S<=U;S++)
if((S&U-1)==S){if(dl[S]>=l-1&&dr[U-1^S]<=r+1)t=1;}
for(int j=l;j<=r;j++)puts(t?"Possible":"Impossible");
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 262150
#define inf 2147483647
using namespace std;
struct pos1{int l, r;}pos[N][19];
int n, m, k, w[N], now, dp_l[N], dp_r[N], bin[19], x, ff;
int main(){
scanf("%d%d", &n, &m);
bin[0]=1; for(int i=1; i<=18; i++)bin[i]=bin[i-1]<<1;
for(int i=1; i<=n; i++)scanf("%d", &w[i]); w[0]=w[1]-m-1; w[n+1]=w[n]+m+1;
k=-1; x=m<<1;
while(x){
k++; x>>=1; now=0;
for(int i=1; i<=n; i++){
if(w[i]-w[i-1]>x)now=i;
pos[i][k].l=now;
}
now=n+1;
for(int i=n; i; i--){
if(w[i+1]-w[i]>x)now=i;
pos[i][k].r=now;
}
}
dp_l[0]=0; dp_r[0]=n+1;
for(int i=1; i<=bin[k]-1; i++){
dp_l[i]=0; dp_r[i]=n+1;
for(int j=1; j<=k; j++)if(i&bin[j-1]){
dp_l[i]=max(dp_l[i], pos[dp_l[i-bin[j-1]]+1][j].r);
dp_r[i]=min(dp_r[i], pos[dp_r[i-bin[j-1]]-1][j].l);
}
}
for(int i=1; i<=n; i++)if(pos[i][0].l==i){
ff=0;
for(int j=0; j<=bin[k]-1; j++)if(dp_l[j]>=pos[i][0].l-1&&dp_r[bin[k]-1-j]<=pos[i][0].r+1){ff=1; break;}
for(int j=pos[i][0].l; j<=pos[i][0].r; j++)if(ff)printf("Possible\n"); else printf("Impossible\n");
}
return 0;
} |
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
using namespace std;
const int maxn=200000+10,lgn=20;
int f[maxn*5],g[maxn*5],mi[maxn],left[maxn][lgn+10],right[maxn][lgn+10],v[lgn+10],x[maxn];
int i,j,k,l,r,s,t,n,m,tot,top;
int main(){
scanf("%d%d",&n,&t);
fo(i,1,n) scanf("%d",&x[i]);
v[0]=t;
t/=2;
while (t){
v[++top]=t;
t/=2;
}
v[++top]=0;
reverse(v,v+top+1);
fo(j,0,top){
left[1][j]=1;
fo(i,2,n)
if (x[i]-x[i-1]<=v[j]) left[i][j]=left[i-1][j];else left[i][j]=i;
right[n][j]=n;
fd(i,n-1,1)
if (x[i+1]-x[i]<=v[j]) right[i][j]=right[i+1][j];else right[i][j]=i;
}
f[0]=0;
g[0]=n+1;
fo(s,1,(1<<(top+1))-1){
f[s]=0;
g[s]=n+1;
fo(i,0,top)
if (s&(1<<i)){
r=s^(1<<i);
if (f[r]==n) f[s]=n;
else f[s]=max(f[s],right[f[r]+1][i]);
if (g[r]==1) g[s]=1;
else g[s]=min(g[s],left[g[r]-1][i]);
}
}
fo(i,0,n) mi[i]=n+2;
fo(i,0,(1<<top)-1){
r=((1<<top)-1)^i;
mi[f[i]]=min(mi[f[i]],g[r]);
}
fd(i,n-1,0) mi[i]=min(mi[i],mi[i+1]);
fo(i,1,n){
l=left[i][top];r=right[i][top];
if (mi[l-1]<=r+1) printf("Possible\n");else printf("Impossible\n");
}
} |
#include<bits/stdc++.h>
#define N 200005
using namespace std;
int n,v,x[N];
int dp1[(1<<19)+3],dp2[(1<<19)+3];
int tor[20][N],tol[20][N],len[20],dep;
void maxn(int &x,int y){y>x? x=y:0;}
int mxr[N];//左侧覆盖i，右侧最多覆盖多少个城市
int main(){
scanf("%d%d",&n,&v);x[0]=-2e9,x[n+1]=2e9;
for(len[0]=v;len[dep]!=0;dep++) len[dep+1]=len[dep]/2;
dep++;
for(int i=1;i<=n;i++) scanf("%d",&x[i]);
for(int d=0;d<dep;d++){
tol[d][0]=n,tor[d][n+1]=n;
for(int i=1;i<=n;i++) tol[d][i]=(x[i]-x[i-1]<=len[d])? tol[d][i-1]:n+1-i;
for(int i=n;i>=1;i--) tor[d][i]=(x[i+1]-x[i]<=len[d])? tor[d][i+1]:i;
}
for(int i=0;i<(1<<dep);i+=2)
for(int j=1;j<dep;j++)
if((i&(1<<j))==0)
maxn( dp1[i|(1<<j)], tor[j][dp1[i]+1] ),
maxn( dp2[i|(1<<j)], tol[j][n-dp2[i]] );
memset(mxr,0xc0,sizeof(mxr));
for(int i=0,j=((1<<dep)-1)^1;j>=0;i+=2,j-=2)
maxn( mxr[dp1[i]], dp2[j] );
for(int i=n;i>=1;i--) maxn( mxr[i], mxr[i+1] );
for(int i=1;i<=n;i++)
if(mxr[n-tol[0][i]] + tor[0][i] >= n) puts("Possible");
else puts("Impossible");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int l[21][530000],r[21][530000],f[530000],g[530000],mi[530000],x[530000];
int main()
{
int n,v,lim=0;scanf("%d%d",&n,&v);while (v>>(lim+1)) lim++;lim++;cerr<<(1<<(lim+1))<<endl;
for (int i=1;i<=n;i++) scanf("%d",&x[i]);
for (int p=0;p<=lim;p++)
{
l[p][0]=1;for (int i=1;i<=n;i++) l[p][i]=(x[i]-x[i-1]<=(v>>p))?l[p][i-1]:i;
r[p][n+1]=n;for (int i=n;i>=1;i--) r[p][i]=(x[i+1]-x[i]<=(v>>p))?r[p][i+1]:i;
}
for (int s=0;s<(1<<(lim+1));s++) g[s]=n+1;
for (int s=0;s<(1<<(lim+1));s++)
for (int i=0;i<=lim;i++) if (!(s&(1<<i)))
{
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=0;i<=n;i++) mi[i]=n+2;
for (int i=0;i<(1<<(lim+1));i+=2) mi[f[i]]=min(mi[f[i]],g[(1<<(lim+1))-2-i]);
for (int i=n-1;i>=0;i--) mi[i]=min(mi[i],mi[i+1]);
for (int i=1;i<=n;i++) puts((mi[l[0][i]-1]<=r[0][i]+1)?"Possible":"Impossible");
//for (int i=1;i<=n;i++) printf("%d %d %d\n",l[0][i],r[0][i],mi[i]);
} |
#include<bits/stdc++.h>
using namespace std;
int n,v;
int x[200010];
vector<pair<int,int> >tot;
vector<pair<int,int> >seg[20];
int fl[1<<20],fr[1<<20];
int main()
{
scanf("%d%d",&n,&v);
for(int i=1;i<=n;i++)scanf("%d",x+i);
for(int i=1;i<=n;i++)
{
int j=i;
while(j+1<=n && x[j+1]-x[j]<=v)j++;
tot.push_back(make_pair(i,j));
i=j;
}
if((int)tot.size()>20)
{
for(int i=1;i<=n;i++)puts("Impossible");
return 0;
}
v/=2;
int k;
for(k=0;;k++,v/=2)
{
for(int i=1;i<=n;i++)
{
int j=i;
while(j+1<=n && x[j+1]-x[j]<=v)j++;
seg[k].push_back(make_pair(i,j));
i=j;
}
sort(seg[k].begin(),seg[k].end());
if(!v)break;
}
k++;
for(int i=0;i<(1<<k);i++)fr[i]=n+1;
for(int i=0;i<(1<<k);i++)
{
for(int j=0;j<k;j++)
{
if(i>>j&1)continue;
int pl=lower_bound(seg[j].begin(),seg[j].end(),make_pair(fl[i]+2,0))-seg[j].begin();
fl[i|(1<<j)]=max(fl[i|(1<<j)],fl[i]);
if(pl)fl[i|(1<<j)]=max(fl[i|(1<<j)],seg[j][pl-1].second);
int pr=lower_bound(seg[j].begin(),seg[j].end(),make_pair(fr[i],0))-seg[j].begin();
fr[i|(1<<j)]=min(fr[i|(1<<j)],fr[i]);
if(pr)fr[i|(1<<j)]=min(fr[i|(1<<j)],seg[j][pr-1].first);
}
}
for(int i=0;i<(int)tot.size();i++)
{
bool ok=false;
for(int j=0;j<(1<<k);j++)
{
if(fl[j]>=tot[i].first-1 && fr[((1<<k)-1)^j]<=tot[i].second+1)
{
ok=true;
break;
}
}
for(int j=tot[i].first;j<=tot[i].second;j++)puts(ok?"Possible":"Impossible");
}
return 0;
} |
#include <cstdio>
#include <algorithm>
#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 ;
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int n, v[20];
int a[MAXN];
int f[20][MAXN], g[20][MAXN];
int fl[1<<20|1], fr[1<<20|1];
int main()
{
scanf("%d%d", &n, &v[0]);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int lev = 0;
for (int i = 0; ; i++) {
lev = i;
f[i][n+1] = n+1;
g[i][0] = 0;
for (int j = n; j >= 1; j--) {
f[i][j] = j;
if (j < n && a[j+1]-a[j] <= v[i])
f[i][j] = f[i][j+1];
}
for (int j = 1; j <= n; j++) {
g[i][j] = j;
if (j > 1 && a[j]-a[j-1] <= v[i])
g[i][j] = g[i][j-1];
}
if (v[i] == 0) break;
v[i+1] = v[i]>>1;
}
fl[0] = 0, fr[0] = n+1;
for (int i = 1; i < 1<<(lev+1); i++) {
fl[i] = 1, fr[i] = n;
for (int k = 0; k <= lev; k++)
if (i>>k&1) {
fl[i] = max(fl[i], f[k][fl[(i^(1<<k))]+1]);
fr[i] = min(fr[i], g[k][fr[(i^(1<<k))]-1]);
}
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (f[0][i] != f[0][i-1])
cnt++;
}
// cerr << cnt << " " << lev+1 << endl;
if (cnt > lev+1) {
for (int i = 1; i <= n; i++) puts("Impossible");
} else {
int last = 0;
for (int i = 1; i <= n; i++) {
if (f[0][i] != f[0][i-1]) {
// cerr << i << endl;
int tot = (1<<(lev+1))-1-1;
last = 0;
for (int j = tot; j >= 0; j = (j-1)&tot) {
// cerr << j << " " << (tot^j) << " " << fl[j] << " " << fr[tot^j] << endl;
if (fl[j] >= i-1 && fr[tot^j] <= f[0][i]+1) {
last = 1;
break;
}
if (j == 0) break;
}
}
if (last == 0) puts("Impossible");
else puts("Possible");
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pb2 pop_back
#define pf push_front
#define pf2 pop_front
#define line printf("\n")
#define rep(k,i,j) for(int k = (int)i;k<(int) j;k++)
#define repd(k,i,j) for(int k = i;k>=(int)j;k--)
#define ll long long
#define pq priority_queue
int dirx[8] = {0,1,0,-1,1,1,-1,-1};
int diry[8] = {1,0,-1,0,1,-1,1,-1};
const int INF = 1e9+7;
const ll INFLL = 1e16;
const double EPS = 1e-6;
using namespace std;
const int maxn = 2e5+5;
int n,v;
int loc[maxn];
int jump[maxn][20],m;
int dp[maxn*10];
int ch[maxn*10];
int in_q[maxn*10];
queue<int> q;
int solve(){
while(q.size())q.pop();
memset(dp,-1,sizeof dp);
memset(in_q,0,sizeof in_q);
q.push(1);
dp[1] = ch[0];
in_q[1] = 1;
while(q.size()){
int mask = q.front();
int a = dp[mask];
q.pop();
in_q[mask] = 0;
if(a==n)return 1;
rep(k,0,m)if(((1<<k)&mask)==0){
int b = ch[jump[a][k]];
int maskb = (mask|(1<<k));
if(dp[maskb]<b){
dp[maskb] = b;
if(!in_q[maskb])q.push(maskb),in_q[maskb] = 1;
}
}
}
return 0;
}
int main(){
scanf("%d%d",&n,&v);
rep(k,0,n)scanf("%d",&loc[k]);
for(;v>=0;v/=2){
rep(k,0,n){
int i = k;
while(i<n){
if(i<n-1 && loc[i+1]-loc[i]<=v){
i++;
}
else break;
}
while(k<=i)jump[k++][m] = i+1;
k = i;
}
//printf("%d \n",v);
m++;
if(v==0)break;
}
if(m>=20)return 0;
rep(k,0,maxn)ch[k] = k;
int hit = 0;
rep(k,0,n){
if(hit>20){
printf("Impossible\n");
continue;
}
int nxt = jump[k][0];
hit++;
ch[k] = nxt;
int ret = solve();
ch[k] = k;
while(k<nxt)printf("%s\n",ret?"Possible":"Impossible"),k++;
k = nxt-1;
}
return 0;
} |
#include <bits/stdc++.h>
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 <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, N = 2e5 + 6, S = (1 << 20) + 5;
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 a[N], L[20][N], R[20][N], l[N<<4], r[N<<4];
pair <int, int> s[N];
bool an[N];
int main() {
int n = read(), m = read(), d;
for(int i = 1; i <= n; i++) a[i] = read();
a[0] = -INF - m - 1, a[n+1] = INF + m + 1;
for(int i = m; ~i; i >>= 1, d++) {
R[d][n+1] = n+1;
for(int j = 1; j <= n; j++)
L[d][j] = a[j] - a[j-1] <= i ? L[d][j-1] : j;
for(int j = n; j; j--)
R[d][j] = a[j+1] - a[j] <= i ? R[d][j+1] : j;
if(!i) {d++; break;}
}
for(int i = 1; i <= n; i++) s[i] = make_pair(L[0][i], R[0][i]);
int cnt = unique(s + 1, s + 1 + n) - s - 1;
for(int i = 0; i < 1 << d; i++) r[i] = n + 1;
for(int i = 0; i < 1 << d; i += 2)
for(int j = 0; j < d; j++)
if(i & 1 << j)
l[i] = max(l[i], R[j][l[i^(1<<j)]+1]),
r[i] = min(r[i], L[j][r[i^(1<<j)]-1]);
if(cnt <= d) for(int i = 1; i <= cnt; i++)
for(int j = 0; j < 1 << d; j += 2)
if(l[j] >= s[i].first - 1 && r[(1<<d)-j-2] <= s[i].second + 1) {
for(int j = s[i].first; j <= s[i].second; j++) an[j] = 1;
break;
}
for(int i = 1; i <= n; i++)
puts(an[i] ? "Possible" : "Impossible");
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using std::max;
inline void umx(int &a,int b){a=max(a,b);}
using std::min;
inline void umn(int &a,int b){a=min(a,b);}
const int MAXN=2e5+5,MAXS=3e5+5;
int n,V,K,v[MAXN];int na[MAXN];
int L[MAXN][20],R[MAXN][20];
int f[MAXS],g[MAXS];
int seq[MAXN];
int main()
{
int i,k,x;scanf("%d%d",&n,&V);
for(i=1;i<=n;i++) scanf("%d",na+i);
v[0]=V;while(v[K]) v[++K]=v[K-1]>>1;
for(k=0;k<=K;k++)
{
for(i=x=1;i<=n;i++)
L[i][k]=x=(i>1&&na[i]-na[i-1]>v[k])?i:x;
for(i=x=n;i;i--)
R[i][k]=x=(i<n&&na[i+1]-na[i]>v[k])?i:x;
R[n+1][k]=n+1;
}
std::fill(g,g+(1<<K),n+1);
for(int S=1;S<1<<K;S++)
for(i=1;i<=K;i++)
if((S>>i-1)&1)
umx(f[S],R[f[S^(1<<i-1)]+1][i]),
umn(g[S],L[g[S^(1<<i-1)]-1][i]);
for(int S=0,msk=(1<<K)-1;S<1<<K;S++)
{
int l=L[g[S]-1][0],r=R[f[msk^S]+1][0];
if(l<=r) seq[l]++,seq[r+1]--;
}
for(i=1;i<=n;i++) seq[i]+=seq[i-1];
for(i=1;i<=n;i++) puts(seq[i]?"Possible":"Impossible");
return 0;
} |
#include<iostream>
#include<algorithm>
#include<unordered_map>
//#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define chmax(a,b) a=max(a,b);
#define N (1<<18)
#define M 19
ll n,v;
class Alpha{
public:
ll f[N];
P g[N][M];
void setg(ll a[]){
for(int k=0;k<M;k++){
for(int i=0;i<n;i++)g[i][k]=make_pair(i,i);
ll bef=1e18,pnt=0; a[n]=1e18;
for(int i=0;i<=n;i++){
if(abs(a[i]-bef)>(v>>k)){
for(int j=pnt;j<i;j++)g[j][k]=make_pair(pnt,i-1);
pnt=i;
}
bef=a[i];
}
if((v>>k)==0)break;
}
}
void main(ll a[]){
setg(a);
for(int i=0;i<N;i++)f[i]=-1;
for(int i=0;i<N;i++){
for(int j=0;j<M-1;j++){
if(i&(1<<j))continue;
chmax(f[i+(1<<j)],g[f[i]+1][j+1].second);
}
}
}
};Alpha L,R;
class Solve{
public:
unordered_map<ll,bool> mas;
bool main(ll l,ll r){
if(mas.size()>M)return 0;
if(mas.find(l)!=mas.end()){
return mas[l];
}
bool res=0;
int who=1; for(int x=v;x;x>>=1)who*=2;
for(int i=0;i<who;i++){
int ls=i,rs=who-1-i;
if(l-1<=L.f[ls]&&n-1-R.f[rs]<=r+1)res=1;
}
mas[l]=res;
return res;
}
};Solve sv;
ll a[N];
int main(){
cin>>n>>v;
for(int i=0;i<n;i++)cin>>a[i];
L.main(a);
for(int i=0;i<n/2;i++)swap(a[i],a[n-i-1]);
R.main(a);
for(int i=0;i<n;i++){
bool ans=sv.main(L.g[i][0].first,L.g[i][0].second);
cout<<(ans?"Possible":"Impossible")<<endl;
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define fill(x,t) memset(x,t,sizeof(x))
const int N=400005;
int f[N],g[N],p[N],L[N],R[N],ans[N];
int left[25][N],righ[25][N],bel[N];
int n,V,tot;
int read() {
int x=0,v=1; char ch=getchar();
for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
return x*v;
}
void pre(int v,int id) {
for (int i=1,j;i<=n;i=j+1) {
for (j=i;j<n&&p[j+1]-p[j]<=v;) j++;
rep(k,i,j) left[id][i]=j,righ[id][j]=i;
}
}
void solve() {
for (int i=0,lim=(1<<tot);i<lim;++i) {
g[i]=n+1;
}
for (int i=0,lim=(1<<tot);i<lim;++i) {
rep(j,0,tot-1) if ((i>>j)&1) {
f[i]=std:: max(f[i],left[j][f[i-(1<<j)]+1]);
g[i]=std:: min(g[i],righ[j][g[i-(1<<j)]-1]);
}
}
for (int i=0,lim=(1<<tot);i<lim;++i) {
int j=lim-i-1;
if (f[i]+1>=L[bel[f[i]+1]]&&g[j]-1<=R[bel[f[i]+1]]) {
ans[bel[f[i]+1]]=1;
}
}
}
int main(void) {
fill(righ,63);
n=read(),V=read();
rep(i,1,n) p[i]=read();
for (int v=V/2;;v>>=1) {
pre(v,tot++);
if (!v) break;
}
for (int i=1,j;i<=n;i=j+1) {
bel[i]=++bel[0];
for (j=i;j<n&&p[j+1]-p[j]<=V;) bel[++j]=bel[0];
L[bel[0]]=i,R[bel[0]]=j;
}
solve();
rep(i,1,n) if (ans[bel[i]]) puts("Possible");
else puts("Impossible");
return 0;
} |
#include<cstdio>
#include<iostream>
using namespace std;
const int maxn=400100;
int dpl[maxn],dpr[maxn];
int val[maxn];
int nex[maxn][20],las[maxn][20];
int a[maxn];
int b[20],k=-1;
int f[maxn];
int main(){
// freopen("E.in","r",stdin);
// freopen("E.out","w",stdout);
int n,v;
scanf("%d%d",&n,&v);
while(v){
b[++k]=v;
v/=2;
}
b[++k]=0;
for(int i=0;i<=k;i++)
if(i<k-i)
swap(b[i],b[k-i]);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int j=0;j<=k;j++)
{
nex[n][j]=n;
nex[n+1][j]=n;
las[1][j]=1;
las[0][j]=1;
}
for(int i=n-1;i>=1;i--)
for(int j=0;j<=k;j++)
{
if(a[i+1]-a[i]<=b[j])
nex[i][j]=nex[i+1][j];
else
nex[i][j]=i;
}
for(int i=2;i<=n;i++)
for(int j=0;j<=k;j++)
{
if(a[i]-a[i-1]<=b[j])
las[i][j]=las[i-1][j];
else
las[i][j]=i;
}
for(int i=0;i<(1<<k);i++){
for(int j=0;j<k;j++){
if(i&(1<<j)) continue;
if(nex[dpl[i]+1][j]>dpl[i|(1<<j)])
dpl[i|(1<<j)]=nex[dpl[i]+1][j];
}
}
for(int i=0;i<(1<<k);i++)
dpr[i]=n+1;
for(int i=0;i<(1<<k);i++){
for(int j=0;j<k;j++){
if(i&(1<<j)) continue;
if(las[dpr[i]-1][j]<dpr[i|(1<<j)])
dpr[i|(1<<j)]=las[dpr[i]-1][j];
}
}
for(int i=1;i<=n;i++)
f[i]=n+1;
for(int i=0;i<(1<<k);i++)
if(dpr[((1<<k)-1)^i]-1<f[dpl[i]+1])
f[dpl[i]+1]=dpr[((1<<k)-1)^i]-1;
int r,mn;
for(int i=1;i<=n;i=r+1){
r=nex[i][k],mn=n+1;
for(int j=i;j<=r;j++)
if(f[j]<mn) mn=f[j];
if(mn<=r){
for(int j=i;j<=r;j++)
printf("Possible\n");
}
else{
for(int j=i;j<=r;j++)
printf("Impossible\n");
}
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
#define maxn 200005
#define D 20
#define INF 2147483647
using namespace std;
int n,v,x[maxn],vis[maxn],maxv[maxn],cnt[D],l[D][maxn],r[D][maxn],f1[maxn*5],f2[maxn*5],ans[maxn];
int upfind(int i,int pos)
{
pos++;
int p=upper_bound(l[i]+1,l[i]+cnt[i]+1,pos)-l[i]-1;
if(p<=0) return pos;
return max(r[i][p],pos-1);
}
int lowfind(int i,int pos)
{
pos--;
int p=lower_bound(r[i]+1,r[i]+cnt[i]+1,pos)-r[i];
if(p>cnt[i]) return pos;
return min(l[i][p],pos+1);
}
int main()
{
scanf("%d%d",&n,&v);
for(int i=1;i<=n;i++) scanf("%d",&x[i]);
x[0]=-INF,x[n+1]=INF;
int log2;
for(log2=0;(1<<log2)<=v;log2++);
for(int lg=0;lg<=log2;lg++)
{
int d=v/(1<<lg);
cnt[lg]=l[lg][1]=1;
for(int i=1;i<=n;i++)
{
r[lg][cnt[lg]]=i;
if(x[i+1]-x[i]>d) l[lg][++cnt[lg]]=i+1;
}
cnt[lg]--;
}
if(cnt[0]>log2+1)
{
for(int i=1;i<=n;i++) printf("Impossible\n");
return 0;
}
int S=(1<<(log2+1));
for(int s=0;s<S;s++) f1[s]=0,f2[s]=INF;
f2[0]=n+1;
for(int s=0;s<S;s+=2)
for(int i=0;i<=log2;i++)
{
if(!(s&(1<<i))) continue;
f1[s]=max(f1[s],upfind(i,f1[s-(1<<i)]));
f2[s]=min(f2[s],lowfind(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<S;s1+=2)
{
int s2=S-s1-2;
int lp=f1[s1],rp=f2[s2];
if(lp>=ln-1&&rp<=rn+1) { ans[i]=true; break; }
}
}
for(int i=1,pos=1;i<=n;i++)
{
printf("%s\n",ans[pos]?"Possible":"Impossible");
if(x[i+1]-x[i]>v) pos++;
}
}
|
#include<bits/stdc++.h>
#define maxn 524289
using namespace std;
int s[maxn][20],t[maxn][20];
int dpl[maxn],dpr[maxn],tag[maxn],n,v,x[maxn],y[20],mx,p;
int main(){
scanf("%d%d",&n,&v);
y[p++]=v;
do{y[p++]=v/=2;}while(v);
for(int i=1;i<=n;++i)scanf("%d",&x[i]);
for(int i=0;i<p;++i)
for(int j=1,k,l;j<=n;j=k){
for(k=j+1;k<=n&&x[k]-x[k-1]<=y[i];k++);
for(l=j;l<k;l++)s[l][i]=k-1,t[l][i]=j;
// printf("[%d,%d,%d,(%d,%d)]",y[i],j,k-1,x[k],x[k-1]);
}
dpl[0]=0,dpr[0]=n+1;
for(int i=1;i<(1<<p);i++)if(~i&1){
dpl[i]=0,dpr[i]=n+1;
for(int j=0;j<p;++j)if(i&(1<<j))
dpl[i]=max(dpl[i],dpl[i^(1<<j)]>=n?n:s[dpl[i^(1<<j)]+1][j]),
dpr[i]=min(dpr[i],dpr[i^(1<<j)]<=1?1:t[dpr[i^(1<<j)]-1][j]);
// printf("[l=%d,r=%d]\n",dpl[i],dpr[i]);
}
for(int i=0;i<(1<<p);++i)if(~i&1){
int l=dpl[i],r=dpr[(1<<p)-1-i-1];
// printf("[%d,%d,%d]",l,r,s[l+1][0]);
if(l+1>=r)tag[1]++;
else if(s[l+1][0]+1>=r)tag[t[l+1][0]]++,tag[s[l+1][0]+1]--;
}
for(int i=1;i<=n;++i){
mx+=tag[i];
if(mx>0)puts("Possible");
else puts("Impossible");
}
} |
#include <bits/stdc++.h>
const int MAXN = 524289;
int n, V, xs[MAXN];
int ls[MAXN], rs[MAXN], bak;
int L[32][MAXN], R[32][MAXN];
int pre[MAXN], suc[MAXN];
void getmax(int & x, int y) { x < y ? x = y : 0; }
void getmin(int & x, int y) { x > y ? x = y : 0; }
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> V;
for (int i = 1; i <= n; ++i) std::cin >> xs[i];
int T = 0;
for (; ; ++T, V >>= 1) {
int lst = 1;
for (int i = 2; i <= n + 1; ++i)
if (xs[i] - xs[i - 1] > V || i == n + 1) {
int l = lst, r = i - 1;
if (!T) ls[++bak] = l, rs[bak] = r;
else for (int j = l; j <= r; ++j)
L[T - 1][j] = l, R[T - 1][j] = r;
lst = i;
}
if (!V) break;
}
const int U = 1 << T;
for (int i = 0; i != U; ++i) suc[i] = n + 1;
for (int i = 0; i != U; ++i)
for (int j = 0; j != T; ++j)
if (~i >> j & 1) {
getmax(pre[i | 1 << j], R[j][pre[i] + 1]);
getmin(suc[i | 1 << j], L[j][suc[i] - 1]);
}
for (int i = 1; i <= bak; ++i) {
bool can = false;
if (bak <= 40) {
for (int j = 0; j != U; ++j)
if (pre[j] >= ls[i] - 1 && suc[U - j - 1] <= rs[i] + 1) {
can = true;
break;
}
}
for (int j = ls[i]; j <= rs[i]; ++j)
std::cout << (can ? "Possible\n" : "Impossible\n");
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
const int MN = 200005, MM = 18;
int N, V, A[MN], v[MM], M;
int L[MM + 1][MN], R[MM + 1][MN];
int fl[1 << MM], fr[1 << MM];
int val[MN];
int main() {
scanf("%d%d", &N, &V);
for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
for (int x = V; x; ) v[M++] = x /= 2;
for (int j = 0; j <= M; ++j) {
int nv = j ? v[j - 1] : V;
L[j][0] = L[j][1] = 1, R[j][N + 1] = R[j][N] = N;
for (int i = 2; i <= N; ++i) L[j][i] = A[i] - A[i - 1] > nv ? i : L[j][i - 1];
for (int i = N - 1; i >= 1; --i) R[j][i] = A[i + 1] - A[i] > nv ? i : R[j][i + 1];
}
fl[0] = 0, fr[0] = N + 1;
for (int S = 1; S < 1 << M; ++S) {
fl[S] = 0, fr[S] = N + 1;
for (int j = 0; j < M; ++j) if (S >> j & 1)
fl[S] = std::max(fl[S], R[j + 1][fl[S ^ 1 << j] + 1]),
fr[S] = std::min(fr[S], L[j + 1][fr[S ^ 1 << j] - 1]);
}
for (int i = 0; i <= N; ++i) val[i] = N + 2;
for (int S = 0; S < 1 << M; ++S)
val[fl[S]] = std::min(val[fl[S]], fr[((1 << M) - 1) ^ S]);
for (int i = N - 1; i >= 0; --i) val[i] = std::min(val[i], val[i + 1]);
for (int i = 1; i <= N; ++i) puts(val[L[0][i] - 1] <= R[0][i] + 1 ? "Possible" : "Impossible");
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define mid (l+r>>1)
typedef long long ll;
template<typename T>inline T read(){
T x=0,f=1;char c=getchar();
for(;c<'0'||c>'9';f=c=='-'?-1:1,c=getchar());
for(;c>='0'&&c<='9';x=(x<<3)+(x<<1)+c-'0',c=getchar());
return x*f;
}
const int maxs=1<<19,maxn=2e5+5;
int n,v,lg,s,lt[maxs],rt[maxs],a[20][maxn],cnt[20];
ll x[maxn];
int S(int opt,int k,int x){
int l=1,r=cnt[k];
while(r-l>1)
if(a[k][mid]<x||(opt&&a[k][mid]==x))l=mid+opt;
else r=mid-1+opt;
int r1=opt?l:r,r2=opt?r:l,f=opt?1:-1;
if(a[k][r1]*f>x*f)return a[k][r1]+1-opt;
return a[k][r2]+1-opt;
}
int main(){
n=read<int>();v=read<int>();
lg=ceil(log2(v))+1+(ceil(log2(v))==log2(v));s=(1<<lg)-1;
for(int i=1;i<=n;i++)x[i]=read<ll>(),x[i-1]=x[i]-x[i-1];x[n]=0;
for(int i=1;i<=lg;i++){
cnt[i]=1;
for(int j=1;j<=n;j++)
a[i][cnt[i]]=j,cnt[i]+=(x[j]>v>>(i-1));
}
if(cnt[1]>lg){for(int i=0;i<n;i++)puts("Impossible");return 0;}
memset(rt,0,sizeof(rt));
for(int i=0;i<=s;i++)lt[i]=n+1;
for(int i=0;i<=s;i+=2)
for(int j=2;j<=lg;j++){
int s0=1<<j-1;
if(i&s0)continue;
rt[i|s0]=std::max(rt[i|s0],S(1,j,rt[i]));
lt[i|s0]=std::min(lt[i|s0],S(0,j,lt[i]-1));
}
for(int i=1;i<=cnt[1];i++){
int f=0,b=a[1][i-1]+1,e=a[1][i];
if(i==1)b=1;
for(int s0=0;s0<=s&&(!f);s0+=2)f=(b<=rt[s0]+1&&e>=lt[s-s0-1]-1);
for(int j=b;j<=e;j++)puts(f?"Possible":"Impossible");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
template<typename T> inline void chkmin(T &a, const T &b) { a = a < b ? a : b; }
template<typename T> inline void chkmax(T &a, const T &b) { a = a > b ? a : b; }
const int MAXN = 200005;
int f[1 << 18], g[1 << 18], pla[MAXN], nxt[18][MAXN], n, V, tn;
vector<int> seg[18];
int main() {
scanf("%d%d", &n, &V);
for (int i = 1; i <= n; i++) scanf("%d", pla + i);
for (int i = V; i; i >>= 1) ++tn;
for (int i = 0; i < tn; i++) {
for (int j = 1; j < n; j++)
if (pla[j] + (V >> i >> 1) < pla[j + 1]) seg[i].push_back(j);
seg[i].push_back(n);
}
int m = 1;
for (int i = 1; i < n; i++)
if (pla[i] + V < pla[i + 1]) ++m;
if (m > tn + 2) {
for (int i = 1; i <= n; i++) puts("Impossible");
return 0;
}
fill(f, f + (1 << tn), 0);
for (int i = 0; i < tn; i++) {
int lst = 1;
for (int j : seg[i]) {
for (int k = lst; k <= j; k++) nxt[i][k] = j;
lst = j + 1;
}
}
for (int i = 0; i + 1 < 1 << tn; i++) {
for (int j = 0; j < tn; j++) if (~i >> j & 1)
chkmax(f[i | 1 << j], nxt[j][f[i] + 1]);
}
for (int i = 0; i < tn; i++) {
int lst = 1;
for (int j : seg[i]) {
for (int k = lst; k <= j; k++) nxt[i][k] = lst;
lst = j + 1;
}
}
fill(g, g + (1 << tn), n + 1);
for (int i = 0; i + 1 < 1 << tn; i++) {
for (int j = 0; j < tn; j++) if (~i >> j & 1)
chkmin(g[i | 1 << j], nxt[j][g[i] - 1]);
}
int lst = 1;
for (int i = 1; i <= n; i++) {
if (i < n && pla[i] + V >= pla[i + 1]) continue;
bool flag = false;
for (int j = 0; j < 1 << tn; j++)
if (f[j] >= lst - 1 && g[j ^ ((1 << tn) - 1)] <= i + 1) { flag = true; break; }
for (int j = lst; j <= i; j++) puts(flag ? "Possible" : "Impossible");
lst = i + 1;
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;inline int inn() { int x;scanf("%d",&x);return x; }const int N=270000,LOG=20;int x[N],v[N],L[LOG][N],R[LOG][N],val[N],Lf[N],Rf[N];
int main()
{
int n=inn(),k=0;v[0]=inn();rep(i,1,n) x[i]=inn();while(v[k]) v[k+1]=v[k]>>1,k++;int all=(1<<k)-1;
rep(i,0,k)
{
L[i][1]=1;for(int j=1+1;j<=n;j++) if(x[j]-x[j-1]<=v[i]) L[i][j]=L[i][j-1];else L[i][j]=j;
R[i][n]=n;for(int j=n-1;j>=0;j--) if(x[j+1]-x[j]<=v[i]) R[i][j]=R[i][j+1];else R[i][j]=j;
}
rep(i,1,all) Lf[i]=1,Rf[i]=n;Lf[0]=0,Rf[0]=n+1;
rep(i,0,all) rep(j,1,k) if(!((i>>(j-1))&1)) Lf[i|(1<<(j-1))]=max(Lf[i|(1<<(j-1))],R[j][Lf[i]+1]),Rf[i|(1<<(j-1))]=min(Rf[i|(1<<(j-1))],L[j][Rf[i]-1]);
rep(i,0,n+1) val[i]=n+n;rep(i,0,all) val[Lf[i]]=min(val[Lf[i]],Rf[all^i]);for(int i=n;i>=0;i--) val[i]=min(val[i],val[i+1]);
rep(i,1,n) printf(val[L[0][i]-1]<=R[0][i]+1?"Possible\n":"Impossible\n");return 0;
} |
#include <bits/stdc++.h>
#define inf 12345678
using namespace std;
inline int read()
{int x=0,f=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();
if (f) x=-x;
return x;
}
inline int max(int a,int b)
{return a>b?a:b;}
inline int min(int a,int b)
{return a<b?a:b;}
int l[21][200005],r[21][200005];
int a[200005],n,v,p[21],cnt=0;
int fl[262145],fr[262145],tot[21];
inline int calc(int pos)
{int lp=l[cnt+1][pos]-1,rp=r[cnt+1][pos]+1;
for (int i=0;i<(1<<cnt);i++)
{if (fl[i]>=lp&&fr[(1<<cnt)-1-i]<=rp) return 1;
}
return 0;
}
int main (){
int i,j;
n=read();v=read();
for (i=1;i<=n;i++)
{a[i]=read();}
while (v) {p[++cnt]=v;v>>=1;}
p[++cnt]=0;
reverse(p+1,p+cnt+1);
for (j=1;j<=cnt;j++)
{int pos=1;
while (pos<=n)
{int sta=pos;
while (pos<=n&&a[pos+1]-a[pos]<=p[j]) pos++;
for (i=sta;i<=pos;i++)
{l[j][i]=sta;r[j][i]=pos;}
pos++;tot[j]++;
}
l[j][n+1]=n+1;r[j][n+1]=n+1;
l[j][0]=0;r[j][0]=0;
}
if (tot[cnt]>cnt)
{for (i=1;i<=n;i++)
{puts("Impossible");}
return 0;
}
cnt--;
for (i=0;i<(1<<cnt);i++)
{fl[i]=0;fr[i]=n+1;
for (j=1;j<=cnt;j++)
{if (!((1<<(j-1))&i)) continue;
fl[i]=max(fl[i],r[j][fl[(i^(1<<(j-1)))]+1]);
fr[i]=min(fr[i],l[j][fr[(i^(1<<(j-1)))]-1]);
}
}
int las;
for (i=1;i<=n;i++)
{if (l[cnt+1][i]==i) las=calc(i);
puts(las?"Possible":"Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=200005;
const int M=(1<<18)+5;
int a[N],b[N],n,m,v;
int pl[19][N],pr[19][N];
int fl[M],fr[M];
int main(){
scanf("%d%d",&n,&v);
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
for (int i=0;i<=18;i++){
pl[i][1]=pl[i][0]=1;
pr[i][n]=pr[i][n+1]=n;
for (int j=2;j<=n;j++)
pl[i][j]=(a[j]-a[j-1]<=v?pl[i][j-1]:j);
for (int j=n-1;j;j--)
pr[i][j]=(a[j+1]-a[j]<=v?pr[i][j+1]:j);
if (!v){
m=i; break;
}
v>>=1;
}
for (int i=0;i<1<<m;i++)
fl[i]=0,fr[i]=n+1;
for (int i=0;i<1<<m;i++)
for (int j=1;j<=m;j++)
if (!((i>>(j-1))&1)){
int I=i|(1<<(j-1));
fl[I]=max(fl[I],pr[j][fl[i]+1]);
fr[I]=min(fr[I],pl[j][fr[i]-1]);
}
for (int i=0;i<1<<m;i++)
if (pr[0][fl[i]+1]>=fr[((1<<m)-1)^i]-1)
b[pr[0][fl[i]+1]]=1;
for (int i=1;i<=n;i++)
if (b[pr[0][i]])
puts("Possible");
else
puts("Impossible");
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.