Submission #826153

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}

signed main() {
	int N, L;
	cin >> N >> L;

	string possible = "Possible";
	string impossible = "Impossible";

	vector<int> a;
	inputVector(a, N);

	vector<int> ret;

	bool ok = false;
	rep(i, N - 1) {
		if (a[i] + a[i + 1] >= L) {
			ret.push_back(i + 1);
			for (int j = i - 1; j >= 0; j--) {
				ret.push_back(j + 1);
			}
			for (int j = i + 1; j < N - 1; j++) {
				ret.push_back(j + 1);
			}
			ok = true;
			break;
		}
	}
	if (!ok) {
		cout << impossible << endl;
		return 0;
	}

	reverse(all(ret));

	cout << possible << endl;
	rep(i, N - 1) {
		cout << ret[i] << endl;
	}

    return 0;
}

Submission Info

Judge Result