Submission #10377091
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define elif else if #define sp setprecision #define pb(x) push_back(x) typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<int, ll> pil; typedef pair<ll, int> pli; typedef pair<ld, ld> pdd; const ll MOD = 1e9+7; //const ll MOD = 998244353; const int inf = 1e8; const ll INF = 1e16; const string alpha = "abcdefghijklmnopqrstuvwxyz"; int main(){ int N; ll L; cin >> N >> L; ll a[N]; rep(i, N) cin >> a[i]; int c = 0; rep(i, N-1){ if(a[i]+a[i+1] >= L) c = i+1; } if(c == 0) cout << "Impossible" << endl; else{ cout << "Possible" << endl; rep2(i, 1, c-1) cout << i << endl; rep3(i, N-1, c+1) cout << i << endl; cout << c << endl; } }
Submission Info
Submission Time | |
---|---|
Task | C - Knot Puzzle |
User | tokusakurai |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1006 Byte |
Status | AC |
Exec Time | 191 ms |
Memory | 1536 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 | 168 ms | 1536 KB |
1_03.txt | AC | 16 ms | 1024 KB |
1_04.txt | AC | 169 ms | 1536 KB |
1_05.txt | AC | 17 ms | 1024 KB |
1_06.txt | AC | 181 ms | 1536 KB |
1_07.txt | AC | 16 ms | 1024 KB |
1_08.txt | AC | 170 ms | 1536 KB |
1_09.txt | AC | 16 ms | 1024 KB |
1_10.txt | AC | 166 ms | 1536 KB |
1_11.txt | AC | 16 ms | 1024 KB |
1_12.txt | AC | 191 ms | 1536 KB |
1_13.txt | AC | 40 ms | 1024 KB |
1_14.txt | AC | 191 ms | 1536 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 1 ms | 256 KB |
1_17.txt | AC | 40 ms | 1024 KB |
1_18.txt | AC | 184 ms | 1536 KB |
1_19.txt | AC | 40 ms | 1024 KB |
1_20.txt | AC | 36 ms | 896 KB |
1_21.txt | AC | 191 ms | 1536 KB |
1_22.txt | AC | 186 ms | 1536 KB |
1_23.txt | AC | 38 ms | 1024 KB |
1_24.txt | AC | 171 ms | 1408 KB |
1_25.txt | AC | 39 ms | 1024 KB |
1_26.txt | AC | 176 ms | 1536 KB |
1_27.txt | AC | 186 ms | 1536 KB |
1_28.txt | AC | 183 ms | 1536 KB |
1_29.txt | AC | 171 ms | 1408 KB |
1_30.txt | AC | 182 ms | 1536 KB |
1_31.txt | AC | 173 ms | 1536 KB |