Submission #826151
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i=0; i<(int)(n); ++i) long long int a[100010]; int main(void) { int N, L; cin >> N >> L; long long int sum = 0; vector<int> step; rep(i, N) { scanf("%lld", &a[i]); sum += a[i]; } int l = 0; int r = N-1; bool clear = true; rep(i, N-1) { if(sum < L) { clear = false; break; } if(a[l] <= a[r]) { sum -= a[l]; step.push_back(l+1); l++; } else { sum -= a[r]; step.push_back(r); r--; } } if(clear) { cout << "Possible" << endl; rep(i, step.size()) cout << step[i] << endl; } else { cout << "Impossible" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Knot Puzzle |
User | kivantium |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 854 Byte |
Status | WA |
Exec Time | 642 ms |
Memory | 2168 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &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 | 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 | 605 ms | 2168 KB |
1_03.txt | AC | 19 ms | 1660 KB |
1_04.txt | AC | 602 ms | 2168 KB |
1_05.txt | AC | 19 ms | 1660 KB |
1_06.txt | AC | 604 ms | 2168 KB |
1_07.txt | AC | 19 ms | 1660 KB |
1_08.txt | AC | 599 ms | 2168 KB |
1_09.txt | AC | 20 ms | 1660 KB |
1_10.txt | AC | 596 ms | 2168 KB |
1_11.txt | AC | 20 ms | 1660 KB |
1_12.txt | AC | 614 ms | 2168 KB |
1_13.txt | AC | 28 ms | 1660 KB |
1_14.txt | AC | 642 ms | 2168 KB |
1_15.txt | WA | 4 ms | 256 KB |
1_16.txt | WA | 4 ms | 256 KB |
1_17.txt | AC | 28 ms | 1660 KB |
1_18.txt | WA | 27 ms | 1660 KB |
1_19.txt | AC | 29 ms | 1660 KB |
1_20.txt | AC | 26 ms | 1532 KB |
1_21.txt | WA | 28 ms | 1660 KB |
1_22.txt | WA | 27 ms | 1660 KB |
1_23.txt | AC | 27 ms | 1660 KB |
1_24.txt | WA | 26 ms | 1532 KB |
1_25.txt | AC | 28 ms | 1660 KB |
1_26.txt | WA | 26 ms | 1660 KB |
1_27.txt | AC | 602 ms | 2040 KB |
1_28.txt | AC | 594 ms | 2040 KB |
1_29.txt | AC | 545 ms | 1912 KB |
1_30.txt | AC | 615 ms | 2040 KB |
1_31.txt | AC | 555 ms | 1912 KB |