oj.uz

Submission #502710

# Submission time Handle Problem Language Result Execution time Memory
502710 2022-01-06T13:29:13 Z Lobo Cave (IOI13_cave) C++17
100 / 100
 878 ms 544 KB 
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;

/*for ordered_set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
*/

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 

void exploreCave(ii n) {

    ii s[n], d[n];
    for(ii i = 0; i < n; i++) {
        s[i] = -1;
        d[i] = 0;
    }

    for(ii i = 0; i < n; i++) {
        ii sq[n];
        for(ii j = 0; j < n; j++) {
            if(s[j] == -1)
                sq[j] = 0;
            else 
                sq[j] = s[j];
        }

        ii ok = tryCombination(sq);
        //0 -> door i closed
        //1 -> door i open
        if(ok == i) ok = 0;
        else ok = 1;

        ii l = 0;
        ii r = n-1;
        ii ansbs;
        while(l <= r) {
            ii mid = (l+r)/2;
            //intervalo (l,mid) muda pra 1

            for(ii j = 0; j < n; j++) {
                if(s[j] == -1) {
                    if(l <= j && j <= mid) sq[j] = 1;
                    else sq[j] = 0;
                }
                else 
                    sq[j] = s[j];
            }

            ii ok1 = tryCombination(sq);
            if(ok1 == i) ok1 = 0;
            else ok1 = 1;

            if(ok1 == ok) {
                //swt for i in (mid+1,r);
                l = mid+1;
            }
            else {
                ansbs = mid;
                r = mid-1;
            }

        }

        //swt ansbs = door i
        d[ansbs] = i;
        //ok = 0 -> s[ansbs] = 0 -> door i is closed -> s[ansbs] = 1
        if(ok == 0) s[ansbs] = 1;
        else s[ansbs] = 0;
    }

    answer(s, d);
}

Compilation message

cave.cpp: In function 'void exploreCave(ii)':
cave.cpp:51:12: warning: 'ansbs' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |         ii ansbs;
      |            ^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 404 KB Output is correct
2 Correct 303 ms 284 KB Output is correct
3 Correct 472 ms 344 KB Output is correct
4 Correct 312 ms 452 KB Output is correct
5 Correct 511 ms 328 KB Output is correct
6 Correct 476 ms 416 KB Output is correct
7 Correct 517 ms 308 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 447 ms 416 KB Output is correct
13 Correct 479 ms 324 KB Output is correct
14 Correct 453 ms 332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 512 ms 436 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 529 ms 352 KB Output is correct
7 Correct 419 ms 416 KB Output is correct
8 Correct 878 ms 420 KB Output is correct
9 Correct 871 ms 412 KB Output is correct
10 Correct 846 ms 420 KB Output is correct
11 Correct 421 ms 432 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 292 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 60 ms 336 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 106 ms 332 KB Output is correct
24 Correct 106 ms 340 KB Output is correct
25 Correct 105 ms 340 KB Output is correct
26 Correct 1 ms 288 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 67 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 59 ms 304 KB Output is correct
31 Correct 59 ms 344 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 104 ms 336 KB Output is correct
36 Correct 104 ms 340 KB Output is correct
37 Correct 0 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 404 KB Output is correct
2 Correct 303 ms 284 KB Output is correct
3 Correct 472 ms 344 KB Output is correct
4 Correct 312 ms 452 KB Output is correct
5 Correct 511 ms 328 KB Output is correct
6 Correct 476 ms 416 KB Output is correct
7 Correct 517 ms 308 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 447 ms 416 KB Output is correct
13 Correct 479 ms 324 KB Output is correct
14 Correct 453 ms 332 KB Output is correct
15 Correct 509 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 512 ms 436 KB Output is correct
18 Correct 0 ms 296 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 529 ms 352 KB Output is correct
21 Correct 419 ms 416 KB Output is correct
22 Correct 878 ms 420 KB Output is correct
23 Correct 871 ms 412 KB Output is correct
24 Correct 846 ms 420 KB Output is correct
25 Correct 421 ms 432 KB Output is correct
26 Correct 0 ms 292 KB Output is correct
27 Correct 0 ms 296 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 292 KB Output is correct
30 Correct 0 ms 300 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 292 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 296 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 60 ms 336 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 292 KB Output is correct
48 Correct 106 ms 332 KB Output is correct
49 Correct 106 ms 340 KB Output is correct
50 Correct 105 ms 340 KB Output is correct
51 Correct 1 ms 288 KB Output is correct
52 Correct 1 ms 288 KB Output is correct
53 Correct 67 ms 332 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 59 ms 304 KB Output is correct
56 Correct 59 ms 344 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 104 ms 336 KB Output is correct
61 Correct 104 ms 340 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 287 ms 400 KB Output is correct
64 Correct 271 ms 332 KB Output is correct
65 Correct 450 ms 460 KB Output is correct
66 Correct 302 ms 332 KB Output is correct
67 Correct 509 ms 420 KB Output is correct
68 Correct 454 ms 416 KB Output is correct
69 Correct 515 ms 352 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 441 ms 352 KB Output is correct
73 Correct 442 ms 416 KB Output is correct
74 Correct 457 ms 452 KB Output is correct
75 Correct 519 ms 332 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 530 ms 416 KB Output is correct
79 Correct 401 ms 420 KB Output is correct
80 Correct 874 ms 420 KB Output is correct
81 Correct 867 ms 416 KB Output is correct
82 Correct 866 ms 416 KB Output is correct
83 Correct 411 ms 432 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 57 ms 324 KB Output is correct
86 Correct 395 ms 416 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 112 ms 332 KB Output is correct
90 Correct 105 ms 308 KB Output is correct
91 Correct 106 ms 336 KB Output is correct
92 Correct 827 ms 416 KB Output is correct
93 Correct 834 ms 452 KB Output is correct
94 Correct 869 ms 332 KB Output is correct
95 Correct 1 ms 292 KB Output is correct
96 Correct 1 ms 288 KB Output is correct
97 Correct 472 ms 544 KB Output is correct
98 Correct 73 ms 308 KB Output is correct
99 Correct 503 ms 416 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 62 ms 332 KB Output is correct
102 Correct 57 ms 332 KB Output is correct
103 Correct 387 ms 416 KB Output is correct
104 Correct 1 ms 296 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 108 ms 336 KB Output is correct
108 Correct 102 ms 332 KB Output is correct
109 Correct 830 ms 416 KB Output is correct
110 Correct 852 ms 452 KB Output is correct
111 Correct 0 ms 204 KB Output is correct