Submission #826148
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int MAX_N = 100000; int n, l, a[MAX_N + 1]; int main() { scanf("%d %d", &n, &l); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); } int lastKnot = 0; for (int i = 1; i < n; i++) { if (a[i] + a[i + 1] >= l) { lastKnot = i; } } if (lastKnot > 0) { printf("Possible\n"); for (int i = 1; i < lastKnot; i++) { printf("%d\n", i); } for (int i = n - 1; i > lastKnot; i--) { printf("%d\n", i); } printf("%d\n", lastKnot); } if (lastKnot == 0) { printf("Impossible"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Knot Puzzle |
User | KingArthur |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 741 Byte |
Status | AC |
Exec Time | 42 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &n, &l); ^ ./Main.cpp:13:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
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 | 4 ms | 256 KB |
0_01.txt | AC | 4 ms | 256 KB |
0_02.txt | AC | 4 ms | 256 KB |
1_00.txt | AC | 4 ms | 256 KB |
1_01.txt | AC | 4 ms | 256 KB |
1_02.txt | AC | 33 ms | 1152 KB |
1_03.txt | AC | 18 ms | 640 KB |
1_04.txt | AC | 33 ms | 1152 KB |
1_05.txt | AC | 18 ms | 640 KB |
1_06.txt | AC | 33 ms | 1152 KB |
1_07.txt | AC | 18 ms | 640 KB |
1_08.txt | AC | 33 ms | 1152 KB |
1_09.txt | AC | 18 ms | 640 KB |
1_10.txt | AC | 33 ms | 1152 KB |
1_11.txt | AC | 17 ms | 640 KB |
1_12.txt | AC | 41 ms | 1152 KB |
1_13.txt | AC | 26 ms | 640 KB |
1_14.txt | AC | 42 ms | 1152 KB |
1_15.txt | AC | 4 ms | 256 KB |
1_16.txt | AC | 4 ms | 256 KB |
1_17.txt | AC | 25 ms | 640 KB |
1_18.txt | AC | 40 ms | 1152 KB |
1_19.txt | AC | 26 ms | 640 KB |
1_20.txt | AC | 24 ms | 640 KB |
1_21.txt | AC | 41 ms | 1152 KB |
1_22.txt | AC | 40 ms | 1152 KB |
1_23.txt | AC | 25 ms | 640 KB |
1_24.txt | AC | 38 ms | 1152 KB |
1_25.txt | AC | 26 ms | 640 KB |
1_26.txt | AC | 39 ms | 1152 KB |
1_27.txt | AC | 41 ms | 1152 KB |
1_28.txt | AC | 41 ms | 1152 KB |
1_29.txt | AC | 37 ms | 1152 KB |
1_30.txt | AC | 40 ms | 1152 KB |
1_31.txt | AC | 38 ms | 1152 KB |