Submission #2708436
Source Code Expand
#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;
#define Pr(f,...) //fprintf(stderr,f,##__VA_ARGS__),fflush(stderr)
typedef long long ll;
template<typename T>
void read(T &x){
x=0;
char c;
for(c=getchar();!isdigit(c);c=getchar());
for(;isdigit(c);c=getchar())x=x*10+c-'0';
}
const int N=1e5+50;
int n,p,a[N],L;
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
//freopen("dat.in","r",stdin);
//freopen("my.out","w",stdout);
#endif
read(n),read(L);
rep(i,1,n)read(a[i]);
rep(i,1,n-1)if(a[i]+a[i+1]>=L)p=i;
if(!p){
printf("Impossible\n");
return 0;
}
printf("Possible\n");
rep(i,1,p-1)printf("%d\n",i);
dec(i,n-1,p)printf("%d\n",i);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Knot Puzzle |
User |
ax7e |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1033 Byte |
Status |
AC |
Exec Time |
17 ms |
Memory |
1152 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
1 ms |
256 KB |
0_01.txt |
AC |
1 ms |
256 KB |
0_02.txt |
AC |
1 ms |
256 KB |
1_00.txt |
AC |
1 ms |
256 KB |
1_01.txt |
AC |
1 ms |
256 KB |
1_02.txt |
AC |
11 ms |
1152 KB |
1_03.txt |
AC |
3 ms |
640 KB |
1_04.txt |
AC |
11 ms |
1152 KB |
1_05.txt |
AC |
3 ms |
640 KB |
1_06.txt |
AC |
11 ms |
1152 KB |
1_07.txt |
AC |
3 ms |
640 KB |
1_08.txt |
AC |
11 ms |
1152 KB |
1_09.txt |
AC |
3 ms |
640 KB |
1_10.txt |
AC |
11 ms |
1152 KB |
1_11.txt |
AC |
3 ms |
640 KB |
1_12.txt |
AC |
17 ms |
1152 KB |
1_13.txt |
AC |
9 ms |
640 KB |
1_14.txt |
AC |
17 ms |
1152 KB |
1_15.txt |
AC |
1 ms |
256 KB |
1_16.txt |
AC |
1 ms |
256 KB |
1_17.txt |
AC |
9 ms |
640 KB |
1_18.txt |
AC |
16 ms |
1152 KB |
1_19.txt |
AC |
9 ms |
640 KB |
1_20.txt |
AC |
8 ms |
640 KB |
1_21.txt |
AC |
17 ms |
1152 KB |
1_22.txt |
AC |
16 ms |
1152 KB |
1_23.txt |
AC |
10 ms |
640 KB |
1_24.txt |
AC |
15 ms |
1152 KB |
1_25.txt |
AC |
9 ms |
640 KB |
1_26.txt |
AC |
16 ms |
1152 KB |
1_27.txt |
AC |
16 ms |
1152 KB |
1_28.txt |
AC |
16 ms |
1152 KB |
1_29.txt |
AC |
16 ms |
1152 KB |
1_30.txt |
AC |
16 ms |
1152 KB |
1_31.txt |
AC |
16 ms |
1152 KB |