Submission #825265


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>;
vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using P = pair<ll, ll>;

template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; cout << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
void printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }
#define ldout fixed << setprecision(40) 

static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;

int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    ll n, l; cin >> n >> l;
    vll a(n); rep(i, a.size()) cin >> a[i];
    ll start = -1;
    rep(i, n-1) {
        if (a[i] + a[i+1] >= l) {
            start = i;
            break;
        }
    }
    if (start == -1) {
        cout << "Impossible" << endl;
        return 0;
    }

    cout << "Possible" << endl;
    repi(i, 1, start + 1) {
        cout << i << endl;
    }
    for (ll i = n - 1; i >= start + 2; i--) {
        cout << i << endl;
    }
    cout << start + 1 << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Knot Puzzle
User hamko
Language C++14 (GCC 5.4.1)
Score 500
Code Size 3502 Byte
Status
Exec Time 730 ms
Memory 1664 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt
All 500 / 500 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 4 ms 256 KB
0_01.txt 4 ms 256 KB
0_02.txt 4 ms 256 KB
1_00.txt 4 ms 256 KB
1_01.txt 4 ms 256 KB
1_02.txt 720 ms 1664 KB
1_03.txt 15 ms 1024 KB
1_04.txt 621 ms 1664 KB
1_05.txt 14 ms 1024 KB
1_06.txt 727 ms 1664 KB
1_07.txt 14 ms 1024 KB
1_08.txt 725 ms 1664 KB
1_09.txt 15 ms 1024 KB
1_10.txt 700 ms 1664 KB
1_11.txt 15 ms 1024 KB
1_12.txt 730 ms 1664 KB
1_13.txt 23 ms 1024 KB
1_14.txt 594 ms 1664 KB
1_15.txt 4 ms 256 KB
1_16.txt 4 ms 256 KB
1_17.txt 23 ms 1024 KB
1_18.txt 711 ms 1536 KB
1_19.txt 23 ms 1024 KB
1_20.txt 22 ms 1024 KB
1_21.txt 585 ms 1664 KB
1_22.txt 697 ms 1536 KB
1_23.txt 23 ms 1024 KB
1_24.txt 546 ms 1536 KB
1_25.txt 22 ms 1024 KB
1_26.txt 685 ms 1536 KB
1_27.txt 696 ms 1536 KB
1_28.txt 706 ms 1536 KB
1_29.txt 562 ms 1536 KB
1_30.txt 704 ms 1536 KB
1_31.txt 667 ms 1536 KB