Submission #10371345
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i, n) for(int (i) = 0; (i) < (n); (i)++) #define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++) #define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--) #define all(x) (x).begin(), (x).end() #define lint long long #define ulint unsigned long long #define fi first #define se second #define setpre(x) cout << fixed << setprecision(x) #define ii(x) int x; cin >> (x) #define ii2(x, y) int x, y; cin >> (x) >> (y) #define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z) #define out(x) cout << (x) << endl #define outs(x) cout << (x) << " " #define yn(x) cout << ((x)?("Yes"):("No")) << endl #define YN(x) cout << ((x)?("YES"):("NO")) << endl #define bit_c(x) __builtin_popcountll(x) inline void logger(){ cout << endl; } template<typename A, typename... B> void logger(const A& a, const B&... b){ cout << a << " , "; logger(b...); } typedef pair<lint, lint> P; const lint MOD = 1000000007; const lint MOD9 = 998244353; const lint INF = MOD * MOD; const int MAX = 100005; /* ...o(^-^)o... */ int main(){ int n; lint l; cin >> n >> l; vector<lint> a(n); rep(i, n) cin >> a[i]; int ok = -1; rep(i, n-1){ if(a[i]+a[i+1] >= l){ ok = i; break; } } if(ok == -1){ out("Impossible"); return 0; } out("Possible"); for(int i = 0; i < ok; i++) out(i+1); for(int i = n-2; i > ok; i--) out(i+1); out(ok+1); }
Submission Info
Submission Time | |
---|---|
Task | C - Knot Puzzle |
User | kobecity |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1505 Byte |
Status | AC |
Exec Time | 193 ms |
Memory | 1664 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 | 170 ms | 1664 KB |
1_03.txt | AC | 17 ms | 1024 KB |
1_04.txt | AC | 168 ms | 1536 KB |
1_05.txt | AC | 17 ms | 1024 KB |
1_06.txt | AC | 170 ms | 1536 KB |
1_07.txt | AC | 16 ms | 1024 KB |
1_08.txt | AC | 171 ms | 1536 KB |
1_09.txt | AC | 16 ms | 1024 KB |
1_10.txt | AC | 174 ms | 1664 KB |
1_11.txt | AC | 17 ms | 1024 KB |
1_12.txt | AC | 192 ms | 1664 KB |
1_13.txt | AC | 41 ms | 1024 KB |
1_14.txt | AC | 193 ms | 1664 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 1 ms | 256 KB |
1_17.txt | AC | 39 ms | 1024 KB |
1_18.txt | AC | 182 ms | 1536 KB |
1_19.txt | AC | 40 ms | 1024 KB |
1_20.txt | AC | 37 ms | 896 KB |
1_21.txt | AC | 191 ms | 1536 KB |
1_22.txt | AC | 182 ms | 1536 KB |
1_23.txt | AC | 38 ms | 1024 KB |
1_24.txt | AC | 173 ms | 1408 KB |
1_25.txt | AC | 39 ms | 1024 KB |
1_26.txt | AC | 182 ms | 1536 KB |
1_27.txt | AC | 189 ms | 1536 KB |
1_28.txt | AC | 185 ms | 1536 KB |
1_29.txt | AC | 172 ms | 1408 KB |
1_30.txt | AC | 185 ms | 1536 KB |
1_31.txt | AC | 173 ms | 1536 KB |