Submission #8520728


Source Code Expand

#include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int N,L,a[MAXN];
int main()
{
    scanf("%d%d",&N,&L);
    for(int i=1;i<=N;i++) scanf("%d",&a[i]);
    int id=-1;
    for(int i=1;i<=N-1;i++)
    {
        if(a[i]+a[i+1]>=L)
        {
            id=i;
            break;
        }
    }
    if(id==-1) {puts("Impossible"); return 0;}
    puts("Possible");
    for(int i=1;i<id;i++) printf("%d\n",i);
    for(int i=N-1;i>=id+1;i--) printf("%d\n",i);
    printf("%d\n",id);
    return 0;
}

Submission Info

Submission Time
Task C - Knot Puzzle
User Roundgod
Language C++14 (GCC 5.4.1)
Score 500
Code Size 661 Byte
Status AC
Exec Time 21 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&L);
                        ^
./Main.cpp:14:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=N;i++) scanf("%d",&a[i]);
                                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 35
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 17 ms 1152 KB
1_03.txt AC 9 ms 640 KB
1_04.txt AC 16 ms 1152 KB
1_05.txt AC 9 ms 640 KB
1_06.txt AC 17 ms 1152 KB
1_07.txt AC 9 ms 640 KB
1_08.txt AC 17 ms 1152 KB
1_09.txt AC 9 ms 640 KB
1_10.txt AC 17 ms 1152 KB
1_11.txt AC 9 ms 640 KB
1_12.txt AC 20 ms 1152 KB
1_13.txt AC 13 ms 640 KB
1_14.txt AC 21 ms 1152 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 1 ms 256 KB
1_17.txt AC 12 ms 640 KB
1_18.txt AC 20 ms 1152 KB
1_19.txt AC 13 ms 640 KB
1_20.txt AC 12 ms 640 KB
1_21.txt AC 20 ms 1152 KB
1_22.txt AC 20 ms 1152 KB
1_23.txt AC 12 ms 640 KB
1_24.txt AC 18 ms 1152 KB
1_25.txt AC 12 ms 640 KB
1_26.txt AC 19 ms 1152 KB
1_27.txt AC 20 ms 1152 KB
1_28.txt AC 20 ms 1152 KB
1_29.txt AC 19 ms 1152 KB
1_30.txt AC 20 ms 1152 KB
1_31.txt AC 19 ms 1152 KB