oj.uz

Submission #552782

# Submission time Handle Problem Language Result Execution time Memory
552782 2022-04-24T00:35:41 Z d4xn Cave (IOI13_cave) C++17
100 / 100
 503 ms 660 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 5000;

int n;
int s[N];
int d[N];
bool vis[N]; // switch que no puedo tocar
int cnt; // numero de switchs que me quedan por tocar
int mxAbierta;
bool abierta;

int find(int i) {
    // cual es el switch que corresponde a la puerta i
    // cambiar los [l - mid] switchs
    // si la puerta cambia buscar en los que he cambiado
    // si no buscar en los que no he cambiado

    if (mxAbierta <= i) mxAbierta = tryCombination(s);
    if (mxAbierta == -1) mxAbierta = n;
    abierta = mxAbierta > i;

    int l = 1;
    int r = cnt;
    while (l < r) {
        int mid = (l+r)/2;

        int s2[N];
        for (int j = 0; j < n; j++) {
            s2[j] = s[j];
        }
        
        int temp = 0;
        for (int j = 0; j < n && temp < mid; j++) {
            if (vis[j]) continue;
            temp++;
            if (temp >= l) s2[j] = !s2[j];
        }

        int x = tryCombination(s2);
        if (x == -1) x = n;
        if (x > i) {
            if (!abierta) {
                r = mid;
            }
            else {
                l = mid+1;
            }
        }
        else {
            if (abierta) {
                r = mid;
            }
            else {
                l = mid+1;
            }
        }
    }

    int temp = 0;
    for (int j = 0; j < n; j++) {
        if (vis[j]) continue;
        temp++;
        if (temp == l) return j;
    }

    return rand() % n; // nunca llego
}

void exploreCave(int nn) {
    n = nn;
    cnt = n;

    for (int i = 0; i < n; i++) {
        int x = find(i);
        d[x] = i;

        if (!abierta) {
            s[x] = !s[x];
        }

        vis[x] = 1;
        cnt--;
    }

    answer(s, d);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 380 KB Output is correct
2 Correct 162 ms 412 KB Output is correct
3 Correct 266 ms 340 KB Output is correct
4 Correct 179 ms 412 KB Output is correct
5 Correct 241 ms 412 KB Output is correct
6 Correct 252 ms 660 KB Output is correct
7 Correct 236 ms 412 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 247 ms 420 KB Output is correct
13 Correct 249 ms 340 KB Output is correct
14 Correct 246 ms 416 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 360 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 260 ms 380 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 244 ms 492 KB Output is correct
7 Correct 261 ms 468 KB Output is correct
8 Correct 501 ms 460 KB Output is correct
9 Correct 483 ms 340 KB Output is correct
10 Correct 503 ms 384 KB Output is correct
11 Correct 241 ms 380 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 34 ms 376 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 66 ms 368 KB Output is correct
24 Correct 62 ms 372 KB Output is correct
25 Correct 65 ms 368 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 30 ms 376 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 39 ms 372 KB Output is correct
31 Correct 34 ms 380 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 66 ms 380 KB Output is correct
36 Correct 61 ms 372 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 380 KB Output is correct
2 Correct 162 ms 412 KB Output is correct
3 Correct 266 ms 340 KB Output is correct
4 Correct 179 ms 412 KB Output is correct
5 Correct 241 ms 412 KB Output is correct
6 Correct 252 ms 660 KB Output is correct
7 Correct 236 ms 412 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 247 ms 420 KB Output is correct
13 Correct 249 ms 340 KB Output is correct
14 Correct 246 ms 416 KB Output is correct
15 Correct 247 ms 360 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 260 ms 380 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 244 ms 492 KB Output is correct
21 Correct 261 ms 468 KB Output is correct
22 Correct 501 ms 460 KB Output is correct
23 Correct 483 ms 340 KB Output is correct
24 Correct 503 ms 384 KB Output is correct
25 Correct 241 ms 380 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 34 ms 376 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 66 ms 368 KB Output is correct
49 Correct 62 ms 372 KB Output is correct
50 Correct 65 ms 368 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 30 ms 376 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 39 ms 372 KB Output is correct
56 Correct 34 ms 380 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 66 ms 380 KB Output is correct
61 Correct 61 ms 372 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 161 ms 412 KB Output is correct
64 Correct 168 ms 528 KB Output is correct
65 Correct 256 ms 468 KB Output is correct
66 Correct 173 ms 396 KB Output is correct
67 Correct 240 ms 416 KB Output is correct
68 Correct 253 ms 340 KB Output is correct
69 Correct 238 ms 536 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 304 KB Output is correct
72 Correct 254 ms 428 KB Output is correct
73 Correct 242 ms 404 KB Output is correct
74 Correct 243 ms 412 KB Output is correct
75 Correct 262 ms 412 KB Output is correct
76 Correct 0 ms 340 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 243 ms 416 KB Output is correct
79 Correct 273 ms 416 KB Output is correct
80 Correct 492 ms 340 KB Output is correct
81 Correct 485 ms 416 KB Output is correct
82 Correct 492 ms 340 KB Output is correct
83 Correct 245 ms 416 KB Output is correct
84 Correct 1 ms 304 KB Output is correct
85 Correct 36 ms 372 KB Output is correct
86 Correct 267 ms 416 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 64 ms 448 KB Output is correct
90 Correct 62 ms 372 KB Output is correct
91 Correct 65 ms 372 KB Output is correct
92 Correct 485 ms 428 KB Output is correct
93 Correct 494 ms 340 KB Output is correct
94 Correct 482 ms 432 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 242 ms 432 KB Output is correct
98 Correct 30 ms 376 KB Output is correct
99 Correct 215 ms 548 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 38 ms 340 KB Output is correct
102 Correct 35 ms 312 KB Output is correct
103 Correct 237 ms 420 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 63 ms 372 KB Output is correct
108 Correct 61 ms 340 KB Output is correct
109 Correct 490 ms 436 KB Output is correct
110 Correct 483 ms 464 KB Output is correct
111 Correct 1 ms 340 KB Output is correct