oj.uz

Submission #947215

# Submission time Handle Problem Language Result Execution time Memory
947215 2024-03-15T16:27:36 Z steveonalex Cave (IOI13_cave) C++11
100 / 100
 1293 ms 604 KB 

#include "cave.h"
#include <bits/stdc++.h>


 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

// int tryCombination(int S[]){
//     return 0;
// }
// void answer(int S[],int D[]){

// }
void exploreCave(int n) {
    int S[n], D[n];    
    vector<bool> used(n);
    for(int i= 0; i<n; ++i){
        int state[n];
        memset(state, 0, sizeof state);
        for(int j = 0; j < n; ++j) if (used[j]) state[j] = S[j];

        int v= tryCombination(state);
        bool correct_state = (v == i);
        int l = 0, r = n - 1;
        while(l < r){
            int mid = (l + r) >> 1;
            int state[n];
            memset(state, 0, sizeof state);
            for(int j = 0; j < n; ++j) if (used[j]) state[j] = S[j];
            for(int j = 0; j <= mid; ++j) if (!used[j]) state[j] = correct_state;
            for(int j = mid + 1; j < n; ++j) if (!used[j]) state[j] = !correct_state;

            if (tryCombination(state) == i) l = mid + 1;
            else r = mid;
        }
        int x = l;
        S[x] = correct_state;
        D[x] = i;
        used[x] = true;
    }
    answer(S, D);
}



// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     return 0;
// }

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 596 KB Output is correct
2 Correct 398 ms 348 KB Output is correct
3 Correct 607 ms 580 KB Output is correct
4 Correct 421 ms 556 KB Output is correct
5 Correct 607 ms 576 KB Output is correct
6 Correct 588 ms 580 KB Output is correct
7 Correct 613 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 604 ms 580 KB Output is correct
13 Correct 662 ms 596 KB Output is correct
14 Correct 608 ms 596 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 632 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 592 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 606 ms 576 KB Output is correct
7 Correct 641 ms 348 KB Output is correct
8 Correct 1232 ms 580 KB Output is correct
9 Correct 1230 ms 580 KB Output is correct
10 Correct 1293 ms 592 KB Output is correct
11 Correct 601 ms 576 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 77 ms 488 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 121 ms 348 KB Output is correct
24 Correct 118 ms 484 KB Output is correct
25 Correct 124 ms 488 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 84 ms 344 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Correct 78 ms 484 KB Output is correct
31 Correct 77 ms 348 KB Output is correct
32 Correct 1 ms 356 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 119 ms 488 KB Output is correct
36 Correct 117 ms 348 KB Output is correct
37 Correct 1 ms 440 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 596 KB Output is correct
2 Correct 398 ms 348 KB Output is correct
3 Correct 607 ms 580 KB Output is correct
4 Correct 421 ms 556 KB Output is correct
5 Correct 607 ms 576 KB Output is correct
6 Correct 588 ms 580 KB Output is correct
7 Correct 613 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 604 ms 580 KB Output is correct
13 Correct 662 ms 596 KB Output is correct
14 Correct 608 ms 596 KB Output is correct
15 Correct 632 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 592 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 606 ms 576 KB Output is correct
21 Correct 641 ms 348 KB Output is correct
22 Correct 1232 ms 580 KB Output is correct
23 Correct 1230 ms 580 KB Output is correct
24 Correct 1293 ms 592 KB Output is correct
25 Correct 601 ms 576 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 440 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 77 ms 488 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 440 KB Output is correct
48 Correct 121 ms 348 KB Output is correct
49 Correct 118 ms 484 KB Output is correct
50 Correct 124 ms 488 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 448 KB Output is correct
53 Correct 84 ms 344 KB Output is correct
54 Correct 1 ms 352 KB Output is correct
55 Correct 78 ms 484 KB Output is correct
56 Correct 77 ms 348 KB Output is correct
57 Correct 1 ms 356 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 119 ms 488 KB Output is correct
61 Correct 117 ms 348 KB Output is correct
62 Correct 1 ms 440 KB Output is correct
63 Correct 396 ms 560 KB Output is correct
64 Correct 392 ms 580 KB Output is correct
65 Correct 602 ms 576 KB Output is correct
66 Correct 409 ms 560 KB Output is correct
67 Correct 618 ms 592 KB Output is correct
68 Correct 595 ms 576 KB Output is correct
69 Correct 617 ms 580 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 625 ms 580 KB Output is correct
73 Correct 601 ms 576 KB Output is correct
74 Correct 603 ms 592 KB Output is correct
75 Correct 579 ms 572 KB Output is correct
76 Correct 0 ms 600 KB Output is correct
77 Correct 1 ms 436 KB Output is correct
78 Correct 610 ms 580 KB Output is correct
79 Correct 615 ms 580 KB Output is correct
80 Correct 1225 ms 592 KB Output is correct
81 Correct 1252 ms 604 KB Output is correct
82 Correct 1231 ms 592 KB Output is correct
83 Correct 638 ms 596 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 79 ms 492 KB Output is correct
86 Correct 556 ms 576 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 1 ms 444 KB Output is correct
89 Correct 116 ms 348 KB Output is correct
90 Correct 117 ms 348 KB Output is correct
91 Correct 116 ms 484 KB Output is correct
92 Correct 1222 ms 576 KB Output is correct
93 Correct 1234 ms 600 KB Output is correct
94 Correct 1245 ms 600 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 600 ms 596 KB Output is correct
98 Correct 82 ms 348 KB Output is correct
99 Correct 619 ms 592 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 78 ms 484 KB Output is correct
102 Correct 79 ms 488 KB Output is correct
103 Correct 555 ms 348 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 1 ms 344 KB Output is correct
106 Correct 1 ms 436 KB Output is correct
107 Correct 121 ms 488 KB Output is correct
108 Correct 116 ms 348 KB Output is correct
109 Correct 1264 ms 576 KB Output is correct
110 Correct 1224 ms 576 KB Output is correct
111 Correct 0 ms 348 KB Output is correct