oj.uz

Submission #979239

# Submission time Handle Problem Language Result Execution time Memory
979239 2024-05-10T12:04:12 Z rahidilbayramli Cave (IOI13_cave) C++17
100 / 100
 142 ms 604 KB 
#include "cave.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
void exploreCave(int N) {
    int n = N, i, j;
    int isfound[n], f[n], sw[n], fa[n];
    for(i = 0; i < n; i++)
    {
        f[i] = 0;
        isfound[i] = 0;
        sw[i] = 0;
    }
    for(i = 0; i < n; i++)
    {
        int ask = tryCombination(f);
        for(j = 0; j < n; j++)
            fa[j] = f[j];
        int l = 0, r = n - 1;
        while(l != r)
        {
            int mid = (l + r) / 2;
            for(j = l; j <= mid; j++)
            {
                if(!isfound[j])
                    fa[j] = 1 - fa[j];
            }
            int p1 = (ask == i), p2;
            ask = tryCombination(fa);
            p2 = (ask == i);
            if(p1 != p2)
                r = mid;
            else
                l = mid + 1;
        }
        isfound[l] = 1;
        sw[l] = i;
        if(ask == i)
            fa[l] = 1 - fa[l];
        for(j = 0; j < n; j++)
            f[j] = fa[j];
    }
    answer(fa, sw);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 348 KB Output is correct
2 Correct 73 ms 348 KB Output is correct
3 Correct 110 ms 348 KB Output is correct
4 Correct 76 ms 344 KB Output is correct
5 Correct 129 ms 348 KB Output is correct
6 Correct 112 ms 348 KB Output is correct
7 Correct 118 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 114 ms 348 KB Output is correct
13 Correct 110 ms 348 KB Output is correct
14 Correct 110 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 576 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 109 ms 576 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 116 ms 572 KB Output is correct
7 Correct 119 ms 572 KB Output is correct
8 Correct 128 ms 348 KB Output is correct
9 Correct 128 ms 344 KB Output is correct
10 Correct 137 ms 576 KB Output is correct
11 Correct 116 ms 580 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 17 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 18 ms 344 KB Output is correct
24 Correct 18 ms 344 KB Output is correct
25 Correct 23 ms 496 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 17 ms 508 KB Output is correct
29 Correct 1 ms 436 KB Output is correct
30 Correct 16 ms 348 KB Output is correct
31 Correct 17 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 18 ms 348 KB Output is correct
36 Correct 18 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 348 KB Output is correct
2 Correct 73 ms 348 KB Output is correct
3 Correct 110 ms 348 KB Output is correct
4 Correct 76 ms 344 KB Output is correct
5 Correct 129 ms 348 KB Output is correct
6 Correct 112 ms 348 KB Output is correct
7 Correct 118 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 114 ms 348 KB Output is correct
13 Correct 110 ms 348 KB Output is correct
14 Correct 110 ms 348 KB Output is correct
15 Correct 120 ms 576 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 109 ms 576 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 116 ms 572 KB Output is correct
21 Correct 119 ms 572 KB Output is correct
22 Correct 128 ms 348 KB Output is correct
23 Correct 128 ms 344 KB Output is correct
24 Correct 137 ms 576 KB Output is correct
25 Correct 116 ms 580 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 600 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 17 ms 600 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 18 ms 344 KB Output is correct
49 Correct 18 ms 344 KB Output is correct
50 Correct 23 ms 496 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 17 ms 508 KB Output is correct
54 Correct 1 ms 436 KB Output is correct
55 Correct 16 ms 348 KB Output is correct
56 Correct 17 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 18 ms 348 KB Output is correct
61 Correct 18 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 71 ms 556 KB Output is correct
64 Correct 72 ms 556 KB Output is correct
65 Correct 116 ms 592 KB Output is correct
66 Correct 75 ms 348 KB Output is correct
67 Correct 117 ms 600 KB Output is correct
68 Correct 108 ms 604 KB Output is correct
69 Correct 117 ms 576 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 108 ms 580 KB Output is correct
73 Correct 109 ms 348 KB Output is correct
74 Correct 111 ms 348 KB Output is correct
75 Correct 109 ms 588 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 116 ms 448 KB Output is correct
79 Correct 116 ms 348 KB Output is correct
80 Correct 142 ms 600 KB Output is correct
81 Correct 128 ms 348 KB Output is correct
82 Correct 128 ms 348 KB Output is correct
83 Correct 119 ms 344 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 16 ms 348 KB Output is correct
86 Correct 110 ms 604 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 21 ms 500 KB Output is correct
90 Correct 18 ms 512 KB Output is correct
91 Correct 20 ms 344 KB Output is correct
92 Correct 141 ms 600 KB Output is correct
93 Correct 134 ms 348 KB Output is correct
94 Correct 127 ms 580 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 110 ms 348 KB Output is correct
98 Correct 20 ms 348 KB Output is correct
99 Correct 109 ms 580 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 17 ms 508 KB Output is correct
102 Correct 17 ms 348 KB Output is correct
103 Correct 109 ms 572 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 0 ms 600 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 18 ms 348 KB Output is correct
108 Correct 19 ms 596 KB Output is correct
109 Correct 142 ms 348 KB Output is correct
110 Correct 127 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct