Submission #826141

---

Source Code Expand

// AtCoder agc002

#include <bits/stdc++.h>
#define ld long double
#define ll long long int
#define mod 1000000007
#define ll_inf 1000000000000000
#define int_inf 1000000000
#define pb push_back
#define endl '\n'
#define Endl '\n'
#define eps 1e-9
#define PI acos(-1.0)
#define ii pair<int,int>
#define iii pair<int,ii>
#define se second
#define fi first
using namespace std;
ll a[100010];
int main(){
    //cout.precision(12);
    //ifstream fin("in");
    int n; ll len;
    cin>>n>>len;
    ll sum=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        sum+=a[i];
    }
    vector<ll>ans;
    for(ll l=1,r=n;r!=l;){
        //cout<<ans.size()<<" ";
        //cout<<l<<" "<<r<<" "<<sum<<endl;
        if(a[l]>a[r]){
            if(sum-a[r]>=len || (l+1==r && sum>=len)){ans.pb(r-1); sum-=a[r]; r--;}
            else{
                cout<<"Impossible"<<endl; return 0;
            }
            continue;
        }
        if(sum-a[l]>=len || (l+1==r && sum>=len) ){ans.pb(l); sum-=a[l]; l++;}
        else{
            cout<<"Impossible"<<endl; return 0;
        }
    }
    cout<<"Possible"<<endl;
    int sz=ans.size();
    for(int i=0;i<sz;i++){
        if(i==sz-1)cout<<ans[i];
        else cout<<ans[i]<<endl;
    }
}

Submission Info

Judge Result