Submission #920082

# Submission time Handle Problem Language Result Execution time Memory
920082 2024-02-02T03:32:58 Z tanprodium Cave (IOI13_cave) C++14
100 / 100
628 ms 744 KB
// include
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

// random
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

// templates
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (y > x) {
            x = y;
            return (true);
        } else return (false);
    }

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (y < x) {
            x = y;
            return (true);
        } else return (false);
    }

// define
#define fi    first
#define se    second

#define pub   push_back
#define pob   pop_back
#define puf   push_front
#define pof   pop_front
#define eb    emplace_back
#define upb   upper_bound
#define lwb   lower_bound

#define left  VAN
#define right TAN

#define all(a) (a).begin(),(a).end()
#define rall(a) (a).begin(),(a).end()
#define sort_and_unique(a) sort(all(a));(a).resize(unique(all(a))-a.begin())
#define max_ max_element
#define min_ min_element

// another define
using ll  = long long;
using ld  = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

// limit
const int oo = 2e9;

// function
void yesno(bool x) {
    cout << (x ? "YES\n" : "NO\n");
}

void exploreCave(int N) {
    int S[N], D[N], done[N], out[N];
    for (int i = 0; i < N; i++)
        S[i] = D[i] = done[i] = out[i] = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++)
            if (!done[j])
                out[j] = 0;
        int ask = tryCombination(out);
        int stt;
        if (ask > i || ask == -1)
            stt = 0;
        else stt = 1;
        int l = 0, r = N - 1;
        while (l <= r) {
            int mid = (l + r) >> 1;
            for (int j = 0; j < N; j++)
                if (!done[j])
                    out[j] = (stt ^ 1);
            for (int j = l; j <= mid; j++)
                if (!done[j])
                    out[j] = stt;
            int taken = tryCombination(out);
            if (taken > i || taken == -1)
                r = mid - 1;
            else l = mid + 1;
        }
        D[l] = i;
        S[l] = stt;
        out[l] = stt;
        done[l] = 1;
    }
    answer(S, D);
}
# Verdict Execution time Memory Grader output
1 Correct 254 ms 344 KB Output is correct
2 Correct 252 ms 344 KB Output is correct
3 Correct 378 ms 600 KB Output is correct
4 Correct 278 ms 560 KB Output is correct
5 Correct 404 ms 580 KB Output is correct
6 Correct 397 ms 580 KB Output is correct
7 Correct 424 ms 600 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 377 ms 344 KB Output is correct
13 Correct 399 ms 596 KB Output is correct
14 Correct 405 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 422 ms 592 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 465 ms 580 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 396 ms 596 KB Output is correct
7 Correct 391 ms 600 KB Output is correct
8 Correct 614 ms 344 KB Output is correct
9 Correct 623 ms 600 KB Output is correct
10 Correct 628 ms 580 KB Output is correct
11 Correct 382 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 548 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 548 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 72 ms 488 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 82 ms 344 KB Output is correct
24 Correct 76 ms 348 KB Output is correct
25 Correct 77 ms 488 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 57 ms 488 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 52 ms 744 KB Output is correct
31 Correct 55 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 448 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 78 ms 492 KB Output is correct
36 Correct 80 ms 492 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 254 ms 344 KB Output is correct
2 Correct 252 ms 344 KB Output is correct
3 Correct 378 ms 600 KB Output is correct
4 Correct 278 ms 560 KB Output is correct
5 Correct 404 ms 580 KB Output is correct
6 Correct 397 ms 580 KB Output is correct
7 Correct 424 ms 600 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 377 ms 344 KB Output is correct
13 Correct 399 ms 596 KB Output is correct
14 Correct 405 ms 600 KB Output is correct
15 Correct 422 ms 592 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 465 ms 580 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 396 ms 596 KB Output is correct
21 Correct 391 ms 600 KB Output is correct
22 Correct 614 ms 344 KB Output is correct
23 Correct 623 ms 600 KB Output is correct
24 Correct 628 ms 580 KB Output is correct
25 Correct 382 ms 600 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 548 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 600 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 72 ms 488 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 82 ms 344 KB Output is correct
49 Correct 76 ms 348 KB Output is correct
50 Correct 77 ms 488 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 57 ms 488 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 52 ms 744 KB Output is correct
56 Correct 55 ms 344 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 448 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 78 ms 492 KB Output is correct
61 Correct 80 ms 492 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 252 ms 344 KB Output is correct
64 Correct 265 ms 712 KB Output is correct
65 Correct 390 ms 600 KB Output is correct
66 Correct 272 ms 556 KB Output is correct
67 Correct 396 ms 740 KB Output is correct
68 Correct 401 ms 580 KB Output is correct
69 Correct 415 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 398 ms 580 KB Output is correct
73 Correct 399 ms 344 KB Output is correct
74 Correct 398 ms 580 KB Output is correct
75 Correct 431 ms 576 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 411 ms 604 KB Output is correct
79 Correct 366 ms 600 KB Output is correct
80 Correct 612 ms 600 KB Output is correct
81 Correct 610 ms 600 KB Output is correct
82 Correct 611 ms 600 KB Output is correct
83 Correct 387 ms 600 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 55 ms 344 KB Output is correct
86 Correct 363 ms 580 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 76 ms 500 KB Output is correct
90 Correct 77 ms 492 KB Output is correct
91 Correct 82 ms 600 KB Output is correct
92 Correct 622 ms 600 KB Output is correct
93 Correct 604 ms 600 KB Output is correct
94 Correct 623 ms 592 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 393 ms 600 KB Output is correct
98 Correct 54 ms 592 KB Output is correct
99 Correct 365 ms 580 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 54 ms 344 KB Output is correct
102 Correct 56 ms 488 KB Output is correct
103 Correct 400 ms 600 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 1 ms 344 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 76 ms 492 KB Output is correct
108 Correct 77 ms 344 KB Output is correct
109 Correct 606 ms 604 KB Output is correct
110 Correct 608 ms 592 KB Output is correct
111 Correct 0 ms 348 KB Output is correct