oj.uz

Submission #599617

# Submission time Handle Problem Language Result Execution time Memory
599617 2022-07-19T16:56:33 Z thezomb1e Cave (IOI13_cave) C++17
100 / 100
 669 ms 496 KB 
#include "cave.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)

using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;

//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;

//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> void mins(T& x, T y) {x = min(x, y);}
template<typename T> void maxs(T& x, T y) {x = max(x, y);}
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

//

void exploreCave(int n) {
    int S[n], D[n];
    vector<int> right_pos(n, -1);
    for (int _i = 0; _i < n; _i++) {
        // find the switch that opens the _i's door
        for (int i = 0; i < n; i++) {
            if (right_pos[i] == -1) {
                S[i] = 1;   
            } else {
                S[i] = right_pos[i];
            }
        }
        int pos = tryCombination(S);
        bool on = (pos == -1 || pos > _i);
        int lo = 0, hi = n - 1, res;
        while (lo <= hi) {
            int mi = (lo + hi) / 2;
            for (int i = 0; i < n; i++) {
                if (right_pos[i] == -1) {
                    if (i <= mi)
                        S[i] = on;
                    else 
                        S[i] = !on;
                } else {
                    S[i] = right_pos[i];
                }
            }
            pos = tryCombination(S);
            if (pos == -1 || pos > _i) {
                res = mi;
                hi = mi - 1;
            } else {
                lo = mi + 1;
            }
        } 
        D[res] = _i;
        right_pos[res] = on;
    }
    for (int i = 0; i < n; i++) 
        S[i] = right_pos[i];
    answer(S, D);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:76:22: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |         right_pos[res] = on;
      |                      ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 404 KB Output is correct
2 Correct 239 ms 404 KB Output is correct
3 Correct 375 ms 428 KB Output is correct
4 Correct 269 ms 408 KB Output is correct
5 Correct 386 ms 424 KB Output is correct
6 Correct 406 ms 428 KB Output is correct
7 Correct 403 ms 428 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 264 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 387 ms 424 KB Output is correct
13 Correct 383 ms 424 KB Output is correct
14 Correct 414 ms 428 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 380 ms 428 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 379 ms 424 KB Output is correct
7 Correct 414 ms 428 KB Output is correct
8 Correct 629 ms 428 KB Output is correct
9 Correct 650 ms 496 KB Output is correct
10 Correct 633 ms 428 KB Output is correct
11 Correct 401 ms 460 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 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 308 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 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 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 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 308 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 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 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 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 56 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 77 ms 348 KB Output is correct
24 Correct 84 ms 356 KB Output is correct
25 Correct 82 ms 348 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 55 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 60 ms 340 KB Output is correct
31 Correct 50 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 300 KB Output is correct
35 Correct 74 ms 344 KB Output is correct
36 Correct 80 ms 340 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 249 ms 404 KB Output is correct
2 Correct 239 ms 404 KB Output is correct
3 Correct 375 ms 428 KB Output is correct
4 Correct 269 ms 408 KB Output is correct
5 Correct 386 ms 424 KB Output is correct
6 Correct 406 ms 428 KB Output is correct
7 Correct 403 ms 428 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 264 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 387 ms 424 KB Output is correct
13 Correct 383 ms 424 KB Output is correct
14 Correct 414 ms 428 KB Output is correct
15 Correct 423 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 380 ms 428 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 379 ms 424 KB Output is correct
21 Correct 414 ms 428 KB Output is correct
22 Correct 629 ms 428 KB Output is correct
23 Correct 650 ms 496 KB Output is correct
24 Correct 633 ms 428 KB Output is correct
25 Correct 401 ms 460 KB Output is correct
26 Correct 0 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 308 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 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 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 304 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 308 KB Output is correct
45 Correct 56 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 77 ms 348 KB Output is correct
49 Correct 84 ms 356 KB Output is correct
50 Correct 82 ms 348 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 304 KB Output is correct
53 Correct 55 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 60 ms 340 KB Output is correct
56 Correct 50 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 300 KB Output is correct
60 Correct 74 ms 344 KB Output is correct
61 Correct 80 ms 340 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 239 ms 408 KB Output is correct
64 Correct 258 ms 408 KB Output is correct
65 Correct 366 ms 424 KB Output is correct
66 Correct 253 ms 412 KB Output is correct
67 Correct 374 ms 440 KB Output is correct
68 Correct 369 ms 428 KB Output is correct
69 Correct 403 ms 460 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 370 ms 428 KB Output is correct
73 Correct 355 ms 340 KB Output is correct
74 Correct 373 ms 428 KB Output is correct
75 Correct 377 ms 428 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 368 ms 424 KB Output is correct
79 Correct 414 ms 424 KB Output is correct
80 Correct 620 ms 424 KB Output is correct
81 Correct 588 ms 428 KB Output is correct
82 Correct 615 ms 440 KB Output is correct
83 Correct 394 ms 428 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 61 ms 348 KB Output is correct
86 Correct 396 ms 428 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 73 ms 340 KB Output is correct
90 Correct 96 ms 348 KB Output is correct
91 Correct 74 ms 348 KB Output is correct
92 Correct 624 ms 428 KB Output is correct
93 Correct 612 ms 424 KB Output is correct
94 Correct 669 ms 424 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 424 ms 424 KB Output is correct
98 Correct 49 ms 344 KB Output is correct
99 Correct 353 ms 428 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 54 ms 340 KB Output is correct
102 Correct 54 ms 340 KB Output is correct
103 Correct 347 ms 444 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 300 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 96 ms 348 KB Output is correct
108 Correct 74 ms 344 KB Output is correct
109 Correct 609 ms 444 KB Output is correct
110 Correct 657 ms 432 KB Output is correct
111 Correct 1 ms 212 KB Output is correct