oj.uz

Submission #624943

# Submission time Handle Problem Language Result Execution time Memory
624943 2022-08-09T07:47:02 Z Mr_Husanboy Cave (IOI13_cave) C++14
100 / 100
 288 ms 460 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;



void exploreCave(int N) {
    int n = N;
    vector<int> done(N), ans(N), door(N);
    for(int i = 0; i < n; i ++){
        int k = tryCombination(ans.data());
     //   cout << k << endl;
        if(k == i){
            int l = 0, r = n - 1;
            while(l != r){
                int m = (l+r)/2;
                for(int j = l; j <= m; j ++){
                    if(!done[j]) ans[j] = 1;
                }
                int tem = tryCombination(ans.data());
                for(int j = l; j <= m; j ++){
                    if(!done[j]) ans[j] = 0;
                }
                if(tem == -1) tem = n;
                if(tem > i){
                    r = m;
                }else l = m + 1;
            }
            door[r] = i;
            done[r] = 1;
            ans[r] = 1;
      //      cout << r << " r2" << endl;
        }else{
            int l = 0, r = n - 1;
            while(l != r){
                int m = (l+r)/2;
                for(int j = l; j <= m; j ++){
                    if(!done[j]) ans[j] = 1;
                }
                int tem = tryCombination(ans.data());
                for(int j = l; j <= m; j ++){
                    if(!done[j]) ans[j] = 0;
                }
                if(tem == -1) tem = n;
                if(tem == i){
                    r = m;
                }else l = m + 1;

            } //cout << r << "r1 " << endl;
            door[r] = i;
            done[r] = 1;
            ans[r] = 0;
            //ans[r] = 0; cout << ans[r] << endl;
        }
    }
  //  for(auto u : ans) cout << u << ' ' ; cout << endl;
   // for(auto u : door) cout << u << ' ' ; cout << endl;
    answer(ans.data(), door.data());
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 420 KB Output is correct
2 Correct 111 ms 412 KB Output is correct
3 Correct 149 ms 436 KB Output is correct
4 Correct 97 ms 340 KB Output is correct
5 Correct 177 ms 444 KB Output is correct
6 Correct 146 ms 340 KB Output is correct
7 Correct 176 ms 444 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 178 ms 428 KB Output is correct
13 Correct 140 ms 340 KB Output is correct
14 Correct 134 ms 432 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 432 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 163 ms 364 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 184 ms 432 KB Output is correct
7 Correct 137 ms 436 KB Output is correct
8 Correct 235 ms 444 KB Output is correct
9 Correct 238 ms 432 KB Output is correct
10 Correct 236 ms 428 KB Output is correct
11 Correct 137 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 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 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 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 1 ms 212 KB Output is correct
13 Correct 1 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 1 ms 304 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 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 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 1 ms 212 KB Output is correct
13 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 25 ms 460 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 30 ms 352 KB Output is correct
24 Correct 33 ms 340 KB Output is correct
25 Correct 31 ms 340 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 23 ms 316 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 20 ms 352 KB Output is correct
31 Correct 19 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 31 ms 340 KB Output is correct
36 Correct 29 ms 348 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 92 ms 420 KB Output is correct
2 Correct 111 ms 412 KB Output is correct
3 Correct 149 ms 436 KB Output is correct
4 Correct 97 ms 340 KB Output is correct
5 Correct 177 ms 444 KB Output is correct
6 Correct 146 ms 340 KB Output is correct
7 Correct 176 ms 444 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 178 ms 428 KB Output is correct
13 Correct 140 ms 340 KB Output is correct
14 Correct 134 ms 432 KB Output is correct
15 Correct 213 ms 432 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 163 ms 364 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 184 ms 432 KB Output is correct
21 Correct 137 ms 436 KB Output is correct
22 Correct 235 ms 444 KB Output is correct
23 Correct 238 ms 432 KB Output is correct
24 Correct 236 ms 428 KB Output is correct
25 Correct 137 ms 340 KB Output is correct
26 Correct 1 ms 304 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 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 304 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 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 308 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 304 KB Output is correct
45 Correct 25 ms 460 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 30 ms 352 KB Output is correct
49 Correct 33 ms 340 KB Output is correct
50 Correct 31 ms 340 KB Output is correct
51 Correct 1 ms 304 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 23 ms 316 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 20 ms 352 KB Output is correct
56 Correct 19 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 31 ms 340 KB Output is correct
61 Correct 29 ms 348 KB Output is correct
62 Correct 1 ms 300 KB Output is correct
63 Correct 100 ms 412 KB Output is correct
64 Correct 101 ms 412 KB Output is correct
65 Correct 133 ms 432 KB Output is correct
66 Correct 94 ms 420 KB Output is correct
67 Correct 186 ms 440 KB Output is correct
68 Correct 132 ms 340 KB Output is correct
69 Correct 180 ms 432 KB Output is correct
70 Correct 1 ms 304 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 147 ms 444 KB Output is correct
73 Correct 139 ms 436 KB Output is correct
74 Correct 132 ms 432 KB Output is correct
75 Correct 166 ms 440 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 172 ms 440 KB Output is correct
79 Correct 129 ms 340 KB Output is correct
80 Correct 239 ms 444 KB Output is correct
81 Correct 221 ms 448 KB Output is correct
82 Correct 233 ms 432 KB Output is correct
83 Correct 156 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 18 ms 340 KB Output is correct
86 Correct 124 ms 460 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 31 ms 340 KB Output is correct
90 Correct 30 ms 312 KB Output is correct
91 Correct 30 ms 340 KB Output is correct
92 Correct 217 ms 432 KB Output is correct
93 Correct 234 ms 432 KB Output is correct
94 Correct 288 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 133 ms 440 KB Output is correct
98 Correct 21 ms 340 KB Output is correct
99 Correct 135 ms 444 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 23 ms 340 KB Output is correct
102 Correct 19 ms 340 KB Output is correct
103 Correct 119 ms 340 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 296 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 31 ms 340 KB Output is correct
108 Correct 30 ms 340 KB Output is correct
109 Correct 215 ms 444 KB Output is correct
110 Correct 211 ms 460 KB Output is correct
111 Correct 1 ms 212 KB Output is correct