Submission #754158

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
754158	2023-06-07T03:52:28 Z	marvinthang	Cave (IOI13_cave)	C++17	100 / 100	1016 ms	676 KB

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

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.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	309 ms	440 KB	Output is correct
2	Correct	331 ms	420 KB	Output is correct
3	Correct	503 ms	560 KB	Output is correct
4	Correct	346 ms	424 KB	Output is correct
5	Correct	483 ms	428 KB	Output is correct
6	Correct	495 ms	436 KB	Output is correct
7	Correct	501 ms	432 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	312 KB	Output is correct
12	Correct	484 ms	596 KB	Output is correct
13	Correct	504 ms	552 KB	Output is correct
14	Correct	490 ms	432 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	496 ms	440 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	524 ms	432 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	488 ms	460 KB	Output is correct
7	Correct	545 ms	556 KB	Output is correct
8	Correct	1016 ms	428 KB	Output is correct
9	Correct	960 ms	428 KB	Output is correct
10	Correct	985 ms	444 KB	Output is correct
11	Correct	583 ms	416 KB	Output is correct

Subtask #3

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	220 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct

Subtask #4

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	220 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	1 ms	308 KB	Output is correct
20	Correct	81 ms	364 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	304 KB	Output is correct
23	Correct	136 ms	360 KB	Output is correct
24	Correct	123 ms	360 KB	Output is correct
25	Correct	119 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	79 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	76 ms	364 KB	Output is correct
31	Correct	73 ms	364 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	125 ms	364 KB	Output is correct
36	Correct	121 ms	324 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct

Subtask #5

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	309 ms	440 KB	Output is correct
2	Correct	331 ms	420 KB	Output is correct
3	Correct	503 ms	560 KB	Output is correct
4	Correct	346 ms	424 KB	Output is correct
5	Correct	483 ms	428 KB	Output is correct
6	Correct	495 ms	436 KB	Output is correct
7	Correct	501 ms	432 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	312 KB	Output is correct
12	Correct	484 ms	596 KB	Output is correct
13	Correct	504 ms	552 KB	Output is correct
14	Correct	490 ms	432 KB	Output is correct
15	Correct	496 ms	440 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	524 ms	432 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	488 ms	460 KB	Output is correct
21	Correct	545 ms	556 KB	Output is correct
22	Correct	1016 ms	428 KB	Output is correct
23	Correct	960 ms	428 KB	Output is correct
24	Correct	985 ms	444 KB	Output is correct
25	Correct	583 ms	416 KB	Output is correct
26	Correct	1 ms	312 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	308 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	308 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	308 KB	Output is correct
38	Correct	1 ms	220 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	304 KB	Output is correct
44	Correct	1 ms	308 KB	Output is correct
45	Correct	81 ms	364 KB	Output is correct
46	Correct	1 ms	212 KB	Output is correct
47	Correct	1 ms	304 KB	Output is correct
48	Correct	136 ms	360 KB	Output is correct
49	Correct	123 ms	360 KB	Output is correct
50	Correct	119 ms	340 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	1 ms	212 KB	Output is correct
53	Correct	79 ms	340 KB	Output is correct
54	Correct	1 ms	212 KB	Output is correct
55	Correct	76 ms	364 KB	Output is correct
56	Correct	73 ms	364 KB	Output is correct
57	Correct	1 ms	212 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	125 ms	364 KB	Output is correct
61	Correct	121 ms	324 KB	Output is correct
62	Correct	1 ms	212 KB	Output is correct
63	Correct	317 ms	424 KB	Output is correct
64	Correct	332 ms	424 KB	Output is correct
65	Correct	494 ms	432 KB	Output is correct
66	Correct	335 ms	424 KB	Output is correct
67	Correct	523 ms	556 KB	Output is correct
68	Correct	535 ms	676 KB	Output is correct
69	Correct	563 ms	436 KB	Output is correct
70	Correct	0 ms	212 KB	Output is correct
71	Correct	1 ms	308 KB	Output is correct
72	Correct	492 ms	440 KB	Output is correct
73	Correct	498 ms	436 KB	Output is correct
74	Correct	517 ms	552 KB	Output is correct
75	Correct	524 ms	436 KB	Output is correct
76	Correct	1 ms	212 KB	Output is correct
77	Correct	1 ms	312 KB	Output is correct
78	Correct	507 ms	544 KB	Output is correct
79	Correct	518 ms	432 KB	Output is correct
80	Correct	959 ms	428 KB	Output is correct
81	Correct	961 ms	428 KB	Output is correct
82	Correct	927 ms	432 KB	Output is correct
83	Correct	546 ms	540 KB	Output is correct
84	Correct	1 ms	212 KB	Output is correct
85	Correct	70 ms	352 KB	Output is correct
86	Correct	516 ms	432 KB	Output is correct
87	Correct	1 ms	308 KB	Output is correct
88	Correct	1 ms	212 KB	Output is correct
89	Correct	120 ms	364 KB	Output is correct
90	Correct	124 ms	364 KB	Output is correct
91	Correct	120 ms	340 KB	Output is correct
92	Correct	934 ms	428 KB	Output is correct
93	Correct	991 ms	460 KB	Output is correct
94	Correct	988 ms	468 KB	Output is correct
95	Correct	1 ms	212 KB	Output is correct
96	Correct	1 ms	212 KB	Output is correct
97	Correct	525 ms	432 KB	Output is correct
98	Correct	73 ms	372 KB	Output is correct
99	Correct	508 ms	548 KB	Output is correct
100	Correct	1 ms	212 KB	Output is correct
101	Correct	80 ms	360 KB	Output is correct
102	Correct	74 ms	364 KB	Output is correct
103	Correct	498 ms	428 KB	Output is correct
104	Correct	1 ms	212 KB	Output is correct
105	Correct	1 ms	308 KB	Output is correct
106	Correct	1 ms	212 KB	Output is correct
107	Correct	119 ms	340 KB	Output is correct
108	Correct	119 ms	340 KB	Output is correct
109	Correct	966 ms	428 KB	Output is correct
110	Correct	942 ms	432 KB	Output is correct
111	Correct	1 ms	212 KB	Output is correct