Submission #2708296
Source Code Expand
#include <bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef complex<ld> cd; typedef pair<int, int> pi; typedef pair<ll,ll> pl; typedef pair<ld,ld> pd; typedef vector<int> vi; typedef vector<ld> vd; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<cd> vcd; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; #define FOR(i, a, b) for (int i=a; i<(b); i++) #define F0R(i, a) for (int i=0; i<(a); i++) #define FORd(i,a,b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--) #define sz(x) (int)(x).size() #define mp make_pair #define pb push_back #define f first #define s second #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() const int MOD = 1000000007; const ll INF = 1e18; const int MX = 100001; int n,L; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> L; vi a(n+1); FOR(i,1,n+1) cin >> a[i]; FOR(i,1,n) if (a[i]+a[i+1] >= L) { cout << "Possible\n"; FOR(j,1,i) cout << j << "\n"; FORd(j,i+1,n) cout << j << "\n"; cout << i << "\n"; exit(0); } cout << "Impossible"; } // read the question correctly (is y a vowel? what are the exact constraints?) // look out for SPECIAL CASES (n=1?) and overflow (ll vs int?) ARRAY OUT OF BOUNDSS
Submission Info
Submission Time | |
---|---|
Task | C - Knot Puzzle |
User | Benq |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1591 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1280 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 | 14 ms | 1280 KB |
1_03.txt | AC | 7 ms | 640 KB |
1_04.txt | AC | 14 ms | 1280 KB |
1_05.txt | AC | 7 ms | 640 KB |
1_06.txt | AC | 14 ms | 1280 KB |
1_07.txt | AC | 7 ms | 640 KB |
1_08.txt | AC | 14 ms | 1280 KB |
1_09.txt | AC | 7 ms | 640 KB |
1_10.txt | AC | 14 ms | 1280 KB |
1_11.txt | AC | 7 ms | 640 KB |
1_12.txt | AC | 18 ms | 1280 KB |
1_13.txt | AC | 11 ms | 640 KB |
1_14.txt | AC | 19 ms | 1280 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 1 ms | 256 KB |
1_17.txt | AC | 11 ms | 640 KB |
1_18.txt | AC | 19 ms | 1152 KB |
1_19.txt | AC | 11 ms | 640 KB |
1_20.txt | AC | 10 ms | 640 KB |
1_21.txt | AC | 18 ms | 1280 KB |
1_22.txt | AC | 19 ms | 1152 KB |
1_23.txt | AC | 11 ms | 640 KB |
1_24.txt | AC | 16 ms | 1152 KB |
1_25.txt | AC | 11 ms | 640 KB |
1_26.txt | AC | 17 ms | 1152 KB |
1_27.txt | AC | 18 ms | 1152 KB |
1_28.txt | AC | 18 ms | 1152 KB |
1_29.txt | AC | 16 ms | 1152 KB |
1_30.txt | AC | 17 ms | 1152 KB |
1_31.txt | AC | 17 ms | 1152 KB |