oj.uz

Submission #788669

# Submission time Handle Problem Language Result Execution time Memory
788669 2023-07-20T13:08:56 Z borisAngelov Cave (IOI13_cave) C++17
100 / 100
 393 ms 612 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 5005;

int n;

int ans[maxn];
int val[maxn];
int connection[maxn];

int guess[maxn];

void exploreCave(int N)
{
    n = N;

    vector<int> switches;

    for (int i = 0; i < n; ++i)
    {
        switches.push_back(i);
    }

    for (int i = 0; i < n; ++i)
    {
        int curr_code = 1;

        for (int j = 0; j < n; ++j)
        {
            guess[j] = 1;
        }

        for (int j = 0; j < i; ++j)
        {
            guess[ans[j]] = val[ans[j]];
        }

        if (tryCombination(guess) == i)
        {
            curr_code = 0;
        }

        int l = 0;
        int r = switches.size() - 2;

        while (l <= r)
        {
            int mid = (l + r) / 2;

            for (int j = 0; j < n; ++j)
            {
                guess[j] = 1 - curr_code;
            }

            for (int j = 0; j < i; ++j)
            {
                guess[ans[j]] = val[ans[j]];
            }

            for (int j = 0; j <= mid; ++j)
            {
                guess[switches[j]] = curr_code;
            }

            if (tryCombination(guess) == i)
            {
                l = mid + 1;
            }
            else
            {
                r = mid - 1;
            }
        }

        ans[i] = switches[l];

        val[switches[l]] = curr_code;

        switches.erase(switches.begin() + l);
    }

    for (int i = 0; i < n; ++i)
    {
        connection[ans[i]] = i;
    }

    answer(val, connection);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 340 KB Output is correct
2 Correct 188 ms 568 KB Output is correct
3 Correct 326 ms 440 KB Output is correct
4 Correct 180 ms 440 KB Output is correct
5 Correct 283 ms 572 KB Output is correct
6 Correct 262 ms 440 KB Output is correct
7 Correct 275 ms 452 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 257 ms 444 KB Output is correct
13 Correct 273 ms 440 KB Output is correct
14 Correct 316 ms 444 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 428 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 383 ms 456 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 275 ms 476 KB Output is correct
7 Correct 392 ms 580 KB Output is correct
8 Correct 313 ms 484 KB Output is correct
9 Correct 350 ms 492 KB Output is correct
10 Correct 327 ms 488 KB Output is correct
11 Correct 338 ms 468 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 66 ms 364 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 45 ms 384 KB Output is correct
24 Correct 45 ms 392 KB Output is correct
25 Correct 51 ms 380 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 52 ms 376 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 54 ms 380 KB Output is correct
31 Correct 53 ms 380 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 300 KB Output is correct
35 Correct 55 ms 380 KB Output is correct
36 Correct 52 ms 388 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 173 ms 340 KB Output is correct
2 Correct 188 ms 568 KB Output is correct
3 Correct 326 ms 440 KB Output is correct
4 Correct 180 ms 440 KB Output is correct
5 Correct 283 ms 572 KB Output is correct
6 Correct 262 ms 440 KB Output is correct
7 Correct 275 ms 452 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 257 ms 444 KB Output is correct
13 Correct 273 ms 440 KB Output is correct
14 Correct 316 ms 444 KB Output is correct
15 Correct 272 ms 428 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 383 ms 456 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 275 ms 476 KB Output is correct
21 Correct 392 ms 580 KB Output is correct
22 Correct 313 ms 484 KB Output is correct
23 Correct 350 ms 492 KB Output is correct
24 Correct 327 ms 488 KB Output is correct
25 Correct 338 ms 468 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 300 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 300 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 66 ms 364 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 45 ms 384 KB Output is correct
49 Correct 45 ms 392 KB Output is correct
50 Correct 51 ms 380 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 52 ms 376 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 54 ms 380 KB Output is correct
56 Correct 53 ms 380 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 300 KB Output is correct
60 Correct 55 ms 380 KB Output is correct
61 Correct 52 ms 388 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 195 ms 452 KB Output is correct
64 Correct 190 ms 468 KB Output is correct
65 Correct 289 ms 488 KB Output is correct
66 Correct 194 ms 468 KB Output is correct
67 Correct 291 ms 476 KB Output is correct
68 Correct 258 ms 476 KB Output is correct
69 Correct 288 ms 592 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 304 KB Output is correct
72 Correct 275 ms 484 KB Output is correct
73 Correct 265 ms 488 KB Output is correct
74 Correct 269 ms 492 KB Output is correct
75 Correct 307 ms 468 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 304 KB Output is correct
78 Correct 306 ms 468 KB Output is correct
79 Correct 393 ms 476 KB Output is correct
80 Correct 334 ms 480 KB Output is correct
81 Correct 316 ms 484 KB Output is correct
82 Correct 318 ms 612 KB Output is correct
83 Correct 336 ms 468 KB Output is correct
84 Correct 1 ms 304 KB Output is correct
85 Correct 49 ms 372 KB Output is correct
86 Correct 343 ms 608 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 43 ms 384 KB Output is correct
90 Correct 44 ms 388 KB Output is correct
91 Correct 43 ms 392 KB Output is correct
92 Correct 314 ms 496 KB Output is correct
93 Correct 312 ms 604 KB Output is correct
94 Correct 312 ms 492 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 297 ms 604 KB Output is correct
98 Correct 39 ms 340 KB Output is correct
99 Correct 284 ms 484 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 47 ms 340 KB Output is correct
102 Correct 49 ms 380 KB Output is correct
103 Correct 382 ms 468 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 43 ms 316 KB Output is correct
108 Correct 43 ms 372 KB Output is correct
109 Correct 306 ms 488 KB Output is correct
110 Correct 316 ms 492 KB Output is correct
111 Correct 1 ms 212 KB Output is correct