oj.uz

Submission #720691

# Submission time Handle Problem Language Result Execution time Memory
720691 2023-04-09T00:35:28 Z joelgun14 Cave (IOI13_cave) C++17
100 / 100
 879 ms 688 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int N) {
    /* ... */
    // simple way
    // determine if 0/1
    // then determine where
    vector<pair<int, int>> p;
    int query[N];
    bool picked[N];
    vector<pair<int, int>> s;
    memset(picked, 0, sizeof(picked));
    for(int i = 0; i < N; ++i) {
        // determine 0 or 1
        // buat yg sebelum i harus di set manual
        for(int j = 0; j < N; ++j) {
            if(!picked[j])
                query[j] = 0;
        }
        int first = tryCombination(query);
        if(first > i || first == -1) {
            // is 0
            int l = 0, r = N - 1;
            while(l < r) {
                // coba jadikan l...mid 0 dan mid+1...r 1
                int mid = (l + r) / 2;
                for(int j = 0; j < N; ++j)
                    if(!picked[j])
                        query[j] = 1;
                for(int j = l; j <= mid; ++j)
                    if(!picked[j])
                        query[j] = 0;
                int q = tryCombination(query);
                if(q != i)
                    r = mid;
                else
                    l = mid + 1;
            }
            query[l] = 0;
            picked[l] = 1;
            p.push_back(make_pair(l, 0));
        }
        else {
            // is 1
            int l = 0, r = N - 1;
            while(l < r) {
                // coba jadikan l...mid 0 dan mid+1...r 1
                int mid = (l + r) / 2;
                for(int j = 0; j < N; ++j)
                    if(!picked[j])
                        query[j] = 0;
                for(int j = l; j <= mid; ++j)
                    if(!picked[j])
                        query[j] = 1;
                int q = tryCombination(query);
                if(q != i)
                    r = mid;
                else
                    l = mid + 1;
            }
            query[l] = 1;
            picked[l] = 1;
            p.push_back(make_pair(l, 1));
        }
    }
    int S[N], D[N];
    for(int i = 0; i < N; ++i)
        S[p[i].first] = p[i].second, D[p[i].first] = i;
    answer(S, D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 408 KB Output is correct
2 Correct 284 ms 396 KB Output is correct
3 Correct 415 ms 496 KB Output is correct
4 Correct 302 ms 444 KB Output is correct
5 Correct 321 ms 544 KB Output is correct
6 Correct 433 ms 616 KB Output is correct
7 Correct 352 ms 500 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 212 KB Output is correct
12 Correct 382 ms 584 KB Output is correct
13 Correct 389 ms 456 KB Output is correct
14 Correct 398 ms 496 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 460 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 360 ms 540 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 345 ms 540 KB Output is correct
7 Correct 321 ms 460 KB Output is correct
8 Correct 814 ms 528 KB Output is correct
9 Correct 833 ms 540 KB Output is correct
10 Correct 804 ms 544 KB Output is correct
11 Correct 317 ms 684 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 67 ms 368 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 111 ms 364 KB Output is correct
24 Correct 110 ms 360 KB Output is correct
25 Correct 111 ms 480 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 58 ms 368 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 51 ms 364 KB Output is correct
31 Correct 58 ms 364 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 125 ms 356 KB Output is correct
36 Correct 105 ms 364 KB Output is correct
37 Correct 1 ms 300 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 408 KB Output is correct
2 Correct 284 ms 396 KB Output is correct
3 Correct 415 ms 496 KB Output is correct
4 Correct 302 ms 444 KB Output is correct
5 Correct 321 ms 544 KB Output is correct
6 Correct 433 ms 616 KB Output is correct
7 Correct 352 ms 500 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 212 KB Output is correct
12 Correct 382 ms 584 KB Output is correct
13 Correct 389 ms 456 KB Output is correct
14 Correct 398 ms 496 KB Output is correct
15 Correct 360 ms 460 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 360 ms 540 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 345 ms 540 KB Output is correct
21 Correct 321 ms 460 KB Output is correct
22 Correct 814 ms 528 KB Output is correct
23 Correct 833 ms 540 KB Output is correct
24 Correct 804 ms 544 KB Output is correct
25 Correct 317 ms 684 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 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 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 67 ms 368 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 111 ms 364 KB Output is correct
49 Correct 110 ms 360 KB Output is correct
50 Correct 111 ms 480 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 58 ms 368 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 51 ms 364 KB Output is correct
56 Correct 58 ms 364 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 300 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 125 ms 356 KB Output is correct
61 Correct 105 ms 364 KB Output is correct
62 Correct 1 ms 300 KB Output is correct
63 Correct 243 ms 444 KB Output is correct
64 Correct 287 ms 460 KB Output is correct
65 Correct 487 ms 688 KB Output is correct
66 Correct 301 ms 396 KB Output is correct
67 Correct 380 ms 460 KB Output is correct
68 Correct 397 ms 464 KB Output is correct
69 Correct 366 ms 660 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 425 ms 492 KB Output is correct
73 Correct 397 ms 496 KB Output is correct
74 Correct 369 ms 496 KB Output is correct
75 Correct 368 ms 500 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 353 ms 552 KB Output is correct
79 Correct 342 ms 564 KB Output is correct
80 Correct 800 ms 428 KB Output is correct
81 Correct 789 ms 608 KB Output is correct
82 Correct 787 ms 576 KB Output is correct
83 Correct 300 ms 460 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 56 ms 364 KB Output is correct
86 Correct 388 ms 500 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 300 KB Output is correct
89 Correct 111 ms 480 KB Output is correct
90 Correct 107 ms 360 KB Output is correct
91 Correct 118 ms 356 KB Output is correct
92 Correct 879 ms 668 KB Output is correct
93 Correct 861 ms 668 KB Output is correct
94 Correct 876 ms 528 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 300 KB Output is correct
97 Correct 402 ms 492 KB Output is correct
98 Correct 52 ms 368 KB Output is correct
99 Correct 358 ms 504 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 52 ms 364 KB Output is correct
102 Correct 50 ms 364 KB Output is correct
103 Correct 338 ms 584 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 111 ms 360 KB Output is correct
108 Correct 100 ms 356 KB Output is correct
109 Correct 878 ms 532 KB Output is correct
110 Correct 805 ms 528 KB Output is correct
111 Correct 1 ms 212 KB Output is correct