oj.uz

Submission #962696

# Submission time Handle Problem Language Result Execution time Memory
962696 2024-04-14T07:11:38 Z n3rm1n Cave (IOI13_cave) C++17
100 / 100
 468 ms 832 KB 
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;

int is_fixed[5005], gen_fixed[5005];
bool check(int n, int door, int index)
{
    int c[n];
    for (int i = 0 ; i < n ; ++ i)
        c[i] = 0;
    int cnt = 0;
    for (int i = 0; i < n; ++ i )
    {
        if(is_fixed[i])c[i] = gen_fixed[i];
        else
        {
            cnt ++;
            if(cnt <= index)c[i] = 0;
            else c[i] = 1;
        }
    }
    int feedback = tryCombination(c);
    return (feedback > door || feedback == -1);
}
bool check2(int n, int door, int index)
{
    int c[n];
    int cnt = 0;
    for (int i = 0; i < n; ++i)
        c[i] = 0;
    for (int i = 0; i < n; ++ i )
    {
        if(is_fixed[i])c[i] = gen_fixed[i];
        else
        {
            cnt ++;
            if(cnt <= index)c[i] = 1;
            else c[i] = 0;
        }
    }
    int feedback = tryCombination(c);
   //cout << "na " << index << " " << feedback << endl;
    return (feedback > door || feedback == -1);
}
void exploreCave(int N)
{
    int n = N;
    int s[n], feedback;
    int fixed[n]; /// opravi i gen_fixed
    int d[n];
    for (int i = 0; i < n; ++ i)
    {
        fixed[i] = 0;
        s[i] = 0;
        d[i] = 0;
    }
    for (int i = 0; i < n; ++ i)
    {
        feedback = tryCombination(s);

        if(feedback == -1 || feedback > i) /// s 0 se otvarq, vsichko 1ici pyrvata mid-nata 0 kydeto se otvarq
        {
            /// edinici
            int l = 1, r = n-i, mid, ans = 1;
            while(l <= r)
            {
                mid = (l + r)/2;
                if(check(n, i, mid))
                {
                    r = mid - 1;
                    ans = mid;
                }
                else l = mid + 1;
            }
            int cnt_non = 0;
            for (int j = 0; j < n; ++ j)
            {
                if(is_fixed[j])continue;
                cnt_non ++;
                if(cnt_non == ans)
                {
                    fixed[j] = 0;
                    gen_fixed[j] = 0;
                    is_fixed[j] = 1;
                    d[j] = i;
                    s[j] = 0;
                    //cout << i << " " << j << " " << fixed[j] << endl;
                    break;
                }
            }
        }
        else /// s 1 se otvarq, pyrvoto promeneno na 1ci kydeot stava
        {
           int l = 1, r = n-i, mid, ans = 1;
            while(l <= r)
            {
                mid = (l + r)/2;
                if(check2(n, i, mid))
                {
                    r = mid - 1;

                    ans = mid;
                }
                else l = mid + 1;
            }
            int cnt_non = 0;
            for (int j = 0; j < n; ++ j)
            {
                if(is_fixed[j])continue;
                cnt_non ++;
                if(cnt_non == ans)
                {
                    fixed[j] = 1;
                    gen_fixed[j] = 1;
                    is_fixed[j] = 1;
                    d[j] = i;
                    s[j] = 1;
                    //cout << i << " " << j << " " << fixed[j] << endl;
                    break;
                }
            }
        }
    }
    answer(fixed, d);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 564 KB Output is correct
2 Correct 171 ms 552 KB Output is correct
3 Correct 250 ms 344 KB Output is correct
4 Correct 177 ms 600 KB Output is correct
5 Correct 258 ms 580 KB Output is correct
6 Correct 249 ms 560 KB Output is correct
7 Correct 268 ms 568 KB Output is correct
8 Correct 0 ms 344 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 248 ms 560 KB Output is correct
13 Correct 248 ms 600 KB Output is correct
14 Correct 277 ms 572 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 281 ms 832 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 262 ms 348 KB Output is correct
7 Correct 280 ms 576 KB Output is correct
8 Correct 408 ms 600 KB Output is correct
9 Correct 430 ms 580 KB Output is correct
10 Correct 468 ms 604 KB Output is correct
11 Correct 278 ms 588 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 544 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 1 ms 544 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 40 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 54 ms 348 KB Output is correct
24 Correct 56 ms 500 KB Output is correct
25 Correct 52 ms 500 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 36 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 36 ms 492 KB Output is correct
31 Correct 39 ms 600 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 464 KB Output is correct
35 Correct 49 ms 348 KB Output is correct
36 Correct 51 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 564 KB Output is correct
2 Correct 171 ms 552 KB Output is correct
3 Correct 250 ms 344 KB Output is correct
4 Correct 177 ms 600 KB Output is correct
5 Correct 258 ms 580 KB Output is correct
6 Correct 249 ms 560 KB Output is correct
7 Correct 268 ms 568 KB Output is correct
8 Correct 0 ms 344 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 248 ms 560 KB Output is correct
13 Correct 248 ms 600 KB Output is correct
14 Correct 277 ms 572 KB Output is correct
15 Correct 268 ms 600 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 281 ms 832 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 262 ms 348 KB Output is correct
21 Correct 280 ms 576 KB Output is correct
22 Correct 408 ms 600 KB Output is correct
23 Correct 430 ms 580 KB Output is correct
24 Correct 468 ms 604 KB Output is correct
25 Correct 278 ms 588 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 544 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 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 40 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 54 ms 348 KB Output is correct
49 Correct 56 ms 500 KB Output is correct
50 Correct 52 ms 500 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 36 ms 348 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 36 ms 492 KB Output is correct
56 Correct 39 ms 600 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 464 KB Output is correct
60 Correct 49 ms 348 KB Output is correct
61 Correct 51 ms 348 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 164 ms 552 KB Output is correct
64 Correct 163 ms 568 KB Output is correct
65 Correct 251 ms 580 KB Output is correct
66 Correct 173 ms 348 KB Output is correct
67 Correct 258 ms 592 KB Output is correct
68 Correct 243 ms 568 KB Output is correct
69 Correct 258 ms 560 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 244 ms 580 KB Output is correct
73 Correct 245 ms 344 KB Output is correct
74 Correct 244 ms 348 KB Output is correct
75 Correct 272 ms 568 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 262 ms 580 KB Output is correct
79 Correct 274 ms 572 KB Output is correct
80 Correct 430 ms 584 KB Output is correct
81 Correct 433 ms 592 KB Output is correct
82 Correct 444 ms 604 KB Output is correct
83 Correct 284 ms 584 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 38 ms 512 KB Output is correct
86 Correct 292 ms 552 KB Output is correct
87 Correct 1 ms 600 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 53 ms 512 KB Output is correct
90 Correct 52 ms 748 KB Output is correct
91 Correct 51 ms 348 KB Output is correct
92 Correct 435 ms 604 KB Output is correct
93 Correct 429 ms 580 KB Output is correct
94 Correct 444 ms 584 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 264 ms 576 KB Output is correct
98 Correct 40 ms 344 KB Output is correct
99 Correct 255 ms 568 KB Output is correct
100 Correct 1 ms 356 KB Output is correct
101 Correct 36 ms 348 KB Output is correct
102 Correct 38 ms 344 KB Output is correct
103 Correct 278 ms 580 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 48 ms 496 KB Output is correct
108 Correct 53 ms 348 KB Output is correct
109 Correct 436 ms 580 KB Output is correct
110 Correct 422 ms 600 KB Output is correct
111 Correct 0 ms 348 KB Output is correct