Submission #754158

#	Time	Username	Problem	Language	Result	Execution time	Memory
754158		marvinthang	Cave (IOI13_cave)	C++17	100 / 100	1016 ms	676 KiB

cave

/*************************************
*    author: marvinthang             *
*    created: 07.06.2023 10:34:24    *
*************************************/

#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int MAX = 5005;

int S[MAX], D[MAX], F[MAX];

void exploreCave(int N) {
    memset(S, -1, N * sizeof(int));
    auto ask = [&] () {
        REP(i, N) if (S[i] != -1) F[i] = S[i];
        return tryCombination(F);
    };
    auto flip = [&] (int pos) {
        REP(i, pos) F[i] ^= 1;
    };
    REP(i, N) {
        int x = ask();
        if (x != i) flip(N);
        int l = 0, r = N - 1;
        while (l <= r) {
            int m = l + r >> 1;
            flip(m);
            if (ask() != i) r = m - 1;
            else l = m + 1;
            flip(m);
        }
        S[r] = !F[r];
        D[r] = i;
    }
    answer(S, D);
}

#ifdef LOCAL
#include "graderlib.c"

int main() {
    file("cave");
    int N;
    N = init();
    exploreCave(N);
    printf("INCORRECT\nYour solution did not call answer().\n");
    return 0;
}
#endif

Compilation message (stderr)

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:64:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |             int m = l + r >> 1;
      |                     ~~^~~

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24