Submission #826152
Source Code Expand
#include <cstdio> #include <cmath> #include <cstring> #include <iostream> #include <algorithm> #include <queue> #include <vector> #include <map> using namespace std; typedef long long LL; int n; int len,a[100005]; LL sum; int l,r; bool flag; int ans[100005]; int main() { scanf("%d%d",&n,&len); for (int i=1;i<=n;++i) scanf("%d",&a[i]); sum=0; for (int i=1;i<=n;++i) sum+=a[i]; flag=true; l=1;r=n; for (int z=1;z<n;++z) { if (sum>=len) { if (a[l]<=a[r]) { ans[z]=l; sum-=a[l]; l++; } else { sum-=a[r]; ans[z]=r-1; r--; } } else { flag=false; } } if (flag) { printf("Possible\n"); for (int i=1;i<n;++i) printf("%d\n",ans[i]); } else { printf("Impossible\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Knot Puzzle |
User | zscloverinyo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 844 Byte |
Status | WA |
Exec Time | 44 ms |
Memory | 1536 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:36:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&len); ^ ./Main.cpp:37:42: 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 | 0 / 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 | 6 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 | 34 ms | 1536 KB |
1_03.txt | AC | 19 ms | 1024 KB |
1_04.txt | AC | 34 ms | 1536 KB |
1_05.txt | AC | 19 ms | 1024 KB |
1_06.txt | AC | 34 ms | 1536 KB |
1_07.txt | AC | 18 ms | 1024 KB |
1_08.txt | AC | 34 ms | 1536 KB |
1_09.txt | AC | 19 ms | 1024 KB |
1_10.txt | AC | 35 ms | 1536 KB |
1_11.txt | AC | 18 ms | 1024 KB |
1_12.txt | AC | 42 ms | 1536 KB |
1_13.txt | AC | 27 ms | 1024 KB |
1_14.txt | AC | 44 ms | 1536 KB |
1_15.txt | WA | 4 ms | 256 KB |
1_16.txt | WA | 4 ms | 256 KB |
1_17.txt | AC | 26 ms | 1024 KB |
1_18.txt | WA | 27 ms | 1024 KB |
1_19.txt | AC | 27 ms | 1024 KB |
1_20.txt | AC | 24 ms | 896 KB |
1_21.txt | WA | 27 ms | 1024 KB |
1_22.txt | WA | 26 ms | 1024 KB |
1_23.txt | AC | 25 ms | 1024 KB |
1_24.txt | WA | 24 ms | 896 KB |
1_25.txt | AC | 26 ms | 1024 KB |
1_26.txt | WA | 25 ms | 1024 KB |
1_27.txt | AC | 41 ms | 1536 KB |
1_28.txt | AC | 41 ms | 1536 KB |
1_29.txt | AC | 39 ms | 1408 KB |
1_30.txt | AC | 42 ms | 1536 KB |
1_31.txt | AC | 39 ms | 1536 KB |