oj.uz

Submission #578943

# Submission time Handle Problem Language Result Execution time Memory
578943 2022-06-18T08:23:04 Z Belgutei Cave (IOI13_cave) C++17
100 / 100
 181 ms 568 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair

int l,r;
vector<int> v;
vector<int> :: iterator it;

void exploreCave(int N) {
    int x[N];
    int a[N];
    int tp[N];
    int ans[N];
    memset(a, 0, sizeof(a));
    //
    for(int i = 0; i < N; i ++) {
        v.pb(i);
    }
    //
    memset(tp, -1, sizeof(tp));
    //
    int pre = tryCombination(a);
    if(pre == -1) pre = N;
    for(int i = 0; i < N; i ++) {
        l = 0;
        r = v.size() - 1;
        while(l < r) {
            int mid = (l + r) / 2;
            for(int j = l; j <= mid; j ++) {
                a[v[j]] = 1 - a[v[j]];
            }
            int tmp = tryCombination(a);
            if(tmp == -1) tmp = N;
            if(pre <= i && tmp > i) {
                r = mid;
            }
            else if(pre <= i && tmp <= i) {
                l = mid + 1;
            }
            else if(pre > i && tmp <= i) {
                r = mid;
            }
            else l = mid + 1;
            pre = tmp;
            //cout << l << ' ' << r << '\n';
        }
        ans[v[l]] = i;
        if(pre > i) {
            tp[v[l]] = a[v[l]];
        }
        else {
            a[v[l]] = 1 - a[v[l]];
            tp[v[l]] = a[v[l]];
            pre = tryCombination(a);
            if(pre == -1) pre = N;
        }
        it = lower_bound(v.begin(), v.end(), v[l]);
        v.erase(it);
    }
    answer(tp, ans);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:17:9: warning: unused variable 'x' [-Wunused-variable]
   17 |     int x[N];
      |         ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 408 KB Output is correct
2 Correct 92 ms 432 KB Output is correct
3 Correct 137 ms 468 KB Output is correct
4 Correct 105 ms 428 KB Output is correct
5 Correct 142 ms 336 KB Output is correct
6 Correct 133 ms 488 KB Output is correct
7 Correct 136 ms 468 KB Output is correct
8 Correct 1 ms 308 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 135 ms 496 KB Output is correct
13 Correct 137 ms 488 KB Output is correct
14 Correct 140 ms 484 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 448 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 142 ms 480 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 181 ms 488 KB Output is correct
7 Correct 151 ms 480 KB Output is correct
8 Correct 143 ms 484 KB Output is correct
9 Correct 132 ms 484 KB Output is correct
10 Correct 133 ms 480 KB Output is correct
11 Correct 153 ms 492 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 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 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 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 ms 212 KB Output is correct
16 Correct 1 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 21 ms 368 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 20 ms 340 KB Output is correct
24 Correct 20 ms 368 KB Output is correct
25 Correct 19 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 23 ms 364 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 24 ms 368 KB Output is correct
31 Correct 20 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 21 ms 364 KB Output is correct
36 Correct 23 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 94 ms 408 KB Output is correct
2 Correct 92 ms 432 KB Output is correct
3 Correct 137 ms 468 KB Output is correct
4 Correct 105 ms 428 KB Output is correct
5 Correct 142 ms 336 KB Output is correct
6 Correct 133 ms 488 KB Output is correct
7 Correct 136 ms 468 KB Output is correct
8 Correct 1 ms 308 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 135 ms 496 KB Output is correct
13 Correct 137 ms 488 KB Output is correct
14 Correct 140 ms 484 KB Output is correct
15 Correct 161 ms 448 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 142 ms 480 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 181 ms 488 KB Output is correct
21 Correct 151 ms 480 KB Output is correct
22 Correct 143 ms 484 KB Output is correct
23 Correct 132 ms 484 KB Output is correct
24 Correct 133 ms 480 KB Output is correct
25 Correct 153 ms 492 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 296 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 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 0 ms 212 KB Output is correct
41 Correct 1 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 21 ms 368 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 20 ms 340 KB Output is correct
49 Correct 20 ms 368 KB Output is correct
50 Correct 19 ms 340 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 23 ms 364 KB Output is correct
54 Correct 1 ms 288 KB Output is correct
55 Correct 24 ms 368 KB Output is correct
56 Correct 20 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 21 ms 364 KB Output is correct
61 Correct 23 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 95 ms 440 KB Output is correct
64 Correct 97 ms 460 KB Output is correct
65 Correct 164 ms 568 KB Output is correct
66 Correct 92 ms 468 KB Output is correct
67 Correct 132 ms 480 KB Output is correct
68 Correct 138 ms 480 KB Output is correct
69 Correct 177 ms 484 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 304 KB Output is correct
72 Correct 133 ms 480 KB Output is correct
73 Correct 145 ms 480 KB Output is correct
74 Correct 134 ms 468 KB Output is correct
75 Correct 140 ms 488 KB Output is correct
76 Correct 1 ms 300 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 134 ms 496 KB Output is correct
79 Correct 134 ms 480 KB Output is correct
80 Correct 141 ms 468 KB Output is correct
81 Correct 145 ms 468 KB Output is correct
82 Correct 140 ms 468 KB Output is correct
83 Correct 153 ms 496 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 22 ms 316 KB Output is correct
86 Correct 126 ms 468 KB Output is correct
87 Correct 1 ms 304 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 21 ms 340 KB Output is correct
90 Correct 19 ms 384 KB Output is correct
91 Correct 21 ms 340 KB Output is correct
92 Correct 145 ms 484 KB Output is correct
93 Correct 132 ms 484 KB Output is correct
94 Correct 135 ms 484 KB Output is correct
95 Correct 1 ms 312 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 143 ms 480 KB Output is correct
98 Correct 23 ms 340 KB Output is correct
99 Correct 138 ms 480 KB Output is correct
100 Correct 1 ms 304 KB Output is correct
101 Correct 20 ms 316 KB Output is correct
102 Correct 25 ms 320 KB Output is correct
103 Correct 140 ms 468 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 22 ms 384 KB Output is correct
108 Correct 23 ms 384 KB Output is correct
109 Correct 151 ms 496 KB Output is correct
110 Correct 157 ms 496 KB Output is correct
111 Correct 1 ms 212 KB Output is correct