oj.uz

Submission #556259

# Submission time Handle Problem Language Result Execution time Memory
556259 2022-05-02T16:36:01 Z Zanite Cave (IOI13_cave) C++17
100 / 100
 370 ms 468 KB 
#include "cave.h"

#include <bits/stdc++.h>
using namespace std;

void exploreCave(int N) {
    int toggle[N], correspondence[N];
    bool answered[N];

    memset(toggle, 0, sizeof(toggle));
    memset(correspondence, 0, sizeof(correspondence));
    memset(answered, 0, sizeof(answered));

    for (int i = 0; i < N; i++) {
        // check the correct position of the switch that handles the i-th door
        int correctPos = 0;
        for (int s = 0; s < N; s++) {
            if (!answered[s]) {toggle[s] = 0;}
        }
        if (tryCombination(toggle) == i) {
            for (int s = 0; s < N; s++) {
                if (!answered[s]) {toggle[s] = 1;}
            }
            correctPos = 1;
        }
        
        // search which switch connects to the i-th door
        deque<int> guesses;
        for (int s = 0; s < N; s++) {
            if (!answered[s]) {guesses.push_back(s);}
        }
        while (guesses.size() > 1) {
            // guess the left half of deque
            bool removeLeft = 0;
            for (int g = 0; g < (guesses.size() >> 1); g++) {
                toggle[guesses[g]] = 1 - correctPos;
            }
            if (tryCombination(toggle) != i) {
                removeLeft = 1;
            }
            for (int g = 0; g < (guesses.size() >> 1); g++) {
                toggle[guesses[g]] = correctPos;
            }

            int bound = guesses.size();
            if (removeLeft) {
                for (int g = 0; g < (bound >> 1); g++) {
                    guesses.pop_front();
                }   
            } else {
                for (int g = (bound >> 1); g < bound; g++) {
                    guesses.pop_back();
                }
            }
        }
        correspondence[guesses[0]] = i;
        answered[guesses[0]] = 1;
    }

    answer(toggle, correspondence);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:35:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |             for (int g = 0; g < (guesses.size() >> 1); g++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~
cave.cpp:41:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             for (int g = 0; g < (guesses.size() >> 1); g++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 396 KB Output is correct
2 Correct 174 ms 416 KB Output is correct
3 Correct 276 ms 444 KB Output is correct
4 Correct 180 ms 420 KB Output is correct
5 Correct 253 ms 360 KB Output is correct
6 Correct 256 ms 460 KB Output is correct
7 Correct 254 ms 432 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 264 ms 444 KB Output is correct
13 Correct 253 ms 444 KB Output is correct
14 Correct 256 ms 432 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 392 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 281 ms 428 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 284 ms 440 KB Output is correct
7 Correct 268 ms 340 KB Output is correct
8 Correct 369 ms 440 KB Output is correct
9 Correct 352 ms 428 KB Output is correct
10 Correct 352 ms 448 KB Output is correct
11 Correct 278 ms 432 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 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 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 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 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 52 ms 348 KB Output is correct
24 Correct 52 ms 340 KB Output is correct
25 Correct 52 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 41 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 42 ms 340 KB Output is correct
31 Correct 41 ms 340 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 52 ms 340 KB Output is correct
36 Correct 48 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 396 KB Output is correct
2 Correct 174 ms 416 KB Output is correct
3 Correct 276 ms 444 KB Output is correct
4 Correct 180 ms 420 KB Output is correct
5 Correct 253 ms 360 KB Output is correct
6 Correct 256 ms 460 KB Output is correct
7 Correct 254 ms 432 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 264 ms 444 KB Output is correct
13 Correct 253 ms 444 KB Output is correct
14 Correct 256 ms 432 KB Output is correct
15 Correct 262 ms 392 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 281 ms 428 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 284 ms 440 KB Output is correct
21 Correct 268 ms 340 KB Output is correct
22 Correct 369 ms 440 KB Output is correct
23 Correct 352 ms 428 KB Output is correct
24 Correct 352 ms 448 KB Output is correct
25 Correct 278 ms 432 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 1 ms 212 KB Output is correct
31 Correct 0 ms 212 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 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 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 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 43 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 52 ms 348 KB Output is correct
49 Correct 52 ms 340 KB Output is correct
50 Correct 52 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 41 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 42 ms 340 KB Output is correct
56 Correct 41 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 52 ms 340 KB Output is correct
61 Correct 48 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 171 ms 412 KB Output is correct
64 Correct 176 ms 416 KB Output is correct
65 Correct 262 ms 340 KB Output is correct
66 Correct 181 ms 412 KB Output is correct
67 Correct 259 ms 428 KB Output is correct
68 Correct 271 ms 436 KB Output is correct
69 Correct 265 ms 432 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 254 ms 340 KB Output is correct
73 Correct 255 ms 340 KB Output is correct
74 Correct 259 ms 340 KB Output is correct
75 Correct 276 ms 448 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 286 ms 468 KB Output is correct
79 Correct 274 ms 460 KB Output is correct
80 Correct 347 ms 436 KB Output is correct
81 Correct 356 ms 440 KB Output is correct
82 Correct 370 ms 440 KB Output is correct
83 Correct 281 ms 428 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 42 ms 340 KB Output is correct
86 Correct 271 ms 436 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 53 ms 364 KB Output is correct
90 Correct 54 ms 344 KB Output is correct
91 Correct 54 ms 316 KB Output is correct
92 Correct 370 ms 436 KB Output is correct
93 Correct 370 ms 444 KB Output is correct
94 Correct 369 ms 428 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 285 ms 432 KB Output is correct
98 Correct 42 ms 340 KB Output is correct
99 Correct 263 ms 444 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 41 ms 344 KB Output is correct
102 Correct 41 ms 364 KB Output is correct
103 Correct 279 ms 428 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 312 KB Output is correct
107 Correct 53 ms 340 KB Output is correct
108 Correct 50 ms 344 KB Output is correct
109 Correct 370 ms 340 KB Output is correct
110 Correct 344 ms 432 KB Output is correct
111 Correct 1 ms 212 KB Output is correct