oj.uz

Submission #572254

# Submission time Handle Problem Language Result Execution time Memory
572254 2022-06-04T07:10:08 Z MadokaMagicaFan Cave (IOI13_cave) C++14
100 / 100
 510 ms 988 KB 
#include "bits/stdc++.h"
#include "cave.h"

using namespace std;

using ll = long long;
const ll inf = 1e9;
const int md1 = 1e9+7;
const int md2 = 998244353;

#define all(v)                      v.begin(), v.end()
#define rall(v)                     v.rbegin(), v.rend()
#define sz(v)                       ((int)v.size())

#define forn(i,n)                   for(int i = 0; i < n; ++i)
#define forbe(i,b,e)                for(int i = b; i < e; ++i)

#define pb                          push_back

#define pry                         puts("YES")
#define prn                         puts("NO")
#define endl                        '\n'

#define fst                         first
#define scn                         second

const int N = 5e4;

/* void answer(int s[], int d[]); */
/* int tryCombination(int s[]); */

#ifdef ONPC
void answer(vector<int> s, vector<int> d) {
    cout << "Answer :\n\t";
    for (int i = 0; i < sz(s); ++i) {
        cout << s[i] << ' ';
    }
    cout << "\n\t";
    for (int i = 0; i < sz(d); ++i) {
        cout << d[i] << ' ';
    }
    cout << endl;
}
int tryCombination(vector<int> s) {
    cout << "Question :\n\t";
    for (int i = 0; i < sz(s); ++i) {
        cout << s[i] << ' ';
    }
    cout << endl;

    int ans;
    cin >> ans;
    return ans;
}
#endif

bitset<N> c;

int
ask(int n, int l, int r, int v, int *p, int *s)
{
    for (int i = 0; i < n; ++i) s[i] = p[i];
    for (int i = l; i < r; ++i) {
        if (!c[i])
            s[i] = v;
    }
    return tryCombination(s);
}

int
test(int n, int x, int* p, int *s)
{
    int l = 0;
    int r = n;
    int mid;

    int ans;

    int val = ask(n,0,r,0,p,s);

    if (val == -1 || val > x)
        val = 0;
    else
        val = 1;

    for (int i = 0; i < n; ++i) {
        if (!c[i])
            p[i] = !val;
    }

    while (l < r-1) {
        mid = (l+r)>>1;
        ans = ask(n, l,mid, val, p, s);
        if (ans == -1 || ans > x)
            r = mid;
        else
            l = mid;
    }

    c[l] = 1;
    p[l] = val;

    return l;
}

void
exploreCave(int n)
{
    int p[N];
    int s[N];
    int d[N];

    for (int i = 0; i < n; ++i) p[i] = s[i] = d[i] = 0;

    for (int i = 0; i < n; ++i) {
        d[test(n,i,p,s)] = i;
    }

    answer(p,d);
    return;
}

#ifdef ONPC
void
solve()
{
    exploreCave(4);
}

int32_t
main()
{
    int t = 1;
    /* cin >> t; */
    while(t--)
        solve();
}
#endif

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 948 KB Output is correct
2 Correct 208 ms 944 KB Output is correct
3 Correct 400 ms 960 KB Output is correct
4 Correct 218 ms 948 KB Output is correct
5 Correct 337 ms 960 KB Output is correct
6 Correct 336 ms 972 KB Output is correct
7 Correct 349 ms 956 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 816 KB Output is correct
11 Correct 1 ms 816 KB Output is correct
12 Correct 340 ms 956 KB Output is correct
13 Correct 354 ms 964 KB Output is correct
14 Correct 319 ms 956 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 960 KB Output is correct
2 Correct 1 ms 816 KB Output is correct
3 Correct 346 ms 988 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 348 ms 956 KB Output is correct
7 Correct 386 ms 956 KB Output is correct
8 Correct 501 ms 956 KB Output is correct
9 Correct 463 ms 960 KB Output is correct
10 Correct 489 ms 956 KB Output is correct
11 Correct 332 ms 960 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 816 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 812 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 812 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 820 KB Output is correct
14 Correct 1 ms 852 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 816 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 812 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 812 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 820 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 816 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 50 ms 920 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 63 ms 916 KB Output is correct
24 Correct 69 ms 852 KB Output is correct
25 Correct 69 ms 912 KB Output is correct
26 Correct 1 ms 820 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 50 ms 916 KB Output is correct
29 Correct 1 ms 812 KB Output is correct
30 Correct 50 ms 912 KB Output is correct
31 Correct 52 ms 852 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 64 ms 852 KB Output is correct
36 Correct 64 ms 852 KB Output is correct
37 Correct 1 ms 816 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 948 KB Output is correct
2 Correct 208 ms 944 KB Output is correct
3 Correct 400 ms 960 KB Output is correct
4 Correct 218 ms 948 KB Output is correct
5 Correct 337 ms 960 KB Output is correct
6 Correct 336 ms 972 KB Output is correct
7 Correct 349 ms 956 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 816 KB Output is correct
11 Correct 1 ms 816 KB Output is correct
12 Correct 340 ms 956 KB Output is correct
13 Correct 354 ms 964 KB Output is correct
14 Correct 319 ms 956 KB Output is correct
15 Correct 356 ms 960 KB Output is correct
16 Correct 1 ms 816 KB Output is correct
17 Correct 346 ms 988 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 348 ms 956 KB Output is correct
21 Correct 386 ms 956 KB Output is correct
22 Correct 501 ms 956 KB Output is correct
23 Correct 463 ms 960 KB Output is correct
24 Correct 489 ms 956 KB Output is correct
25 Correct 332 ms 960 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 816 KB Output is correct
30 Correct 1 ms 852 KB Output is correct
31 Correct 1 ms 812 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 1 ms 812 KB Output is correct
36 Correct 1 ms 852 KB Output is correct
37 Correct 1 ms 852 KB Output is correct
38 Correct 1 ms 820 KB Output is correct
39 Correct 1 ms 852 KB Output is correct
40 Correct 1 ms 852 KB Output is correct
41 Correct 1 ms 852 KB Output is correct
42 Correct 1 ms 816 KB Output is correct
43 Correct 1 ms 852 KB Output is correct
44 Correct 1 ms 852 KB Output is correct
45 Correct 50 ms 920 KB Output is correct
46 Correct 1 ms 852 KB Output is correct
47 Correct 1 ms 852 KB Output is correct
48 Correct 63 ms 916 KB Output is correct
49 Correct 69 ms 852 KB Output is correct
50 Correct 69 ms 912 KB Output is correct
51 Correct 1 ms 820 KB Output is correct
52 Correct 1 ms 852 KB Output is correct
53 Correct 50 ms 916 KB Output is correct
54 Correct 1 ms 812 KB Output is correct
55 Correct 50 ms 912 KB Output is correct
56 Correct 52 ms 852 KB Output is correct
57 Correct 1 ms 852 KB Output is correct
58 Correct 1 ms 852 KB Output is correct
59 Correct 1 ms 852 KB Output is correct
60 Correct 64 ms 852 KB Output is correct
61 Correct 64 ms 852 KB Output is correct
62 Correct 1 ms 816 KB Output is correct
63 Correct 215 ms 852 KB Output is correct
64 Correct 248 ms 952 KB Output is correct
65 Correct 357 ms 972 KB Output is correct
66 Correct 231 ms 944 KB Output is correct
67 Correct 344 ms 960 KB Output is correct
68 Correct 338 ms 956 KB Output is correct
69 Correct 353 ms 956 KB Output is correct
70 Correct 1 ms 852 KB Output is correct
71 Correct 1 ms 852 KB Output is correct
72 Correct 333 ms 984 KB Output is correct
73 Correct 345 ms 956 KB Output is correct
74 Correct 343 ms 960 KB Output is correct
75 Correct 355 ms 956 KB Output is correct
76 Correct 1 ms 816 KB Output is correct
77 Correct 1 ms 852 KB Output is correct
78 Correct 337 ms 980 KB Output is correct
79 Correct 372 ms 952 KB Output is correct
80 Correct 461 ms 956 KB Output is correct
81 Correct 484 ms 956 KB Output is correct
82 Correct 472 ms 956 KB Output is correct
83 Correct 339 ms 956 KB Output is correct
84 Correct 1 ms 852 KB Output is correct
85 Correct 48 ms 852 KB Output is correct
86 Correct 361 ms 852 KB Output is correct
87 Correct 1 ms 852 KB Output is correct
88 Correct 1 ms 852 KB Output is correct
89 Correct 73 ms 912 KB Output is correct
90 Correct 65 ms 912 KB Output is correct
91 Correct 69 ms 912 KB Output is correct
92 Correct 457 ms 964 KB Output is correct
93 Correct 481 ms 980 KB Output is correct
94 Correct 461 ms 956 KB Output is correct
95 Correct 1 ms 852 KB Output is correct
96 Correct 1 ms 852 KB Output is correct
97 Correct 357 ms 964 KB Output is correct
98 Correct 49 ms 928 KB Output is correct
99 Correct 420 ms 956 KB Output is correct
100 Correct 1 ms 852 KB Output is correct
101 Correct 49 ms 912 KB Output is correct
102 Correct 51 ms 828 KB Output is correct
103 Correct 325 ms 964 KB Output is correct
104 Correct 1 ms 852 KB Output is correct
105 Correct 1 ms 852 KB Output is correct
106 Correct 1 ms 852 KB Output is correct
107 Correct 64 ms 912 KB Output is correct
108 Correct 66 ms 852 KB Output is correct
109 Correct 510 ms 952 KB Output is correct
110 Correct 468 ms 960 KB Output is correct
111 Correct 1 ms 852 KB Output is correct