oj.uz

Submission #711950

# Submission time Handle Problem Language Result Execution time Memory
711950 2023-03-17T18:28:02 Z thimote75 Cave (IOI13_cave) C++14
100 / 100
 1049 ms 716 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

#define MAX_N 5000

int currentDoor = 0;

static int S[MAX_N];
static int F[MAX_N];
static int D[MAX_N];

int nbSwitch;

void makeCombination (int left, int right, int t0, int t1) {
    int c = 0;
    for (int i = 0; i < nbSwitch; i ++) {
        if (F[i] != -1) {
            S[i] = F[i];
        } else {
            S[i] = left <= c && c <= right ? t1 : t0;
            c ++;
        }
    }
}
int nbTry = 0;
int tryComb (int left, int right, int t0, int t1) {
    makeCombination(left, right, t0, t1);

    int v = tryCombination(S);
    nbTry ++;

    if (v == -1) return nbSwitch + 1;
    return v;
}

int getValid (int door) {
    return tryComb(0, nbSwitch - 1 - door, 0, 1) > door ? 1 : 0;
}
int getDoor (int door, int target) {
    int n_target = 1 - target;

    int a = 0;
    int b = nbSwitch - 1 - door;

    while (a + 1 < b) {
        int c = (a + b) >> 1;

        if (tryComb(a, c, n_target, target) > door) {
            b = c;
        } else {
            a = c;
        }
    }

    int na = 0;
    int nb = 0;

    for (int i = a; i >= 0; na ++)
        i -= F[na] == -1 ? 1 : 0;
    for (int i = b; i >= 0; nb ++)
        i -= F[nb] == -1 ? 1 : 0;
    na --; nb --;

    return tryComb(a, a, n_target, target) > door ? na : nb;
}
#define di pair<int, int>
di getDoor (int door) {
    int target = getValid(door);

    return { getDoor(door, target), target };
}
void solve (int door) {
    di data = getDoor(door);
    
    int idSwitch = data.first;

    F[idSwitch] = data.second;
    D[idSwitch] = door;
}

void exploreCave(int N) {
    nbSwitch = N;

    for (int i = 0; i < N; i ++)
        F[i] = -1; // Signifies that it is not fixed

    for (int i = 0; i < N; i ++)
        solve(i);
    
    answer(F, D);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 388 KB Output is correct
2 Correct 303 ms 388 KB Output is correct
3 Correct 495 ms 512 KB Output is correct
4 Correct 330 ms 420 KB Output is correct
5 Correct 447 ms 680 KB Output is correct
6 Correct 464 ms 468 KB Output is correct
7 Correct 471 ms 424 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 445 ms 556 KB Output is correct
13 Correct 464 ms 552 KB Output is correct
14 Correct 458 ms 424 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 460 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 513 ms 428 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 518 ms 552 KB Output is correct
7 Correct 455 ms 716 KB Output is correct
8 Correct 978 ms 436 KB Output is correct
9 Correct 975 ms 432 KB Output is correct
10 Correct 1032 ms 340 KB Output is correct
11 Correct 543 ms 428 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 236 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 72 ms 348 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 124 ms 352 KB Output is correct
24 Correct 127 ms 364 KB Output is correct
25 Correct 120 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 80 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 88 ms 348 KB Output is correct
31 Correct 77 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 123 ms 340 KB Output is correct
36 Correct 130 ms 356 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 388 KB Output is correct
2 Correct 303 ms 388 KB Output is correct
3 Correct 495 ms 512 KB Output is correct
4 Correct 330 ms 420 KB Output is correct
5 Correct 447 ms 680 KB Output is correct
6 Correct 464 ms 468 KB Output is correct
7 Correct 471 ms 424 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 445 ms 556 KB Output is correct
13 Correct 464 ms 552 KB Output is correct
14 Correct 458 ms 424 KB Output is correct
15 Correct 467 ms 460 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 513 ms 428 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 518 ms 552 KB Output is correct
21 Correct 455 ms 716 KB Output is correct
22 Correct 978 ms 436 KB Output is correct
23 Correct 975 ms 432 KB Output is correct
24 Correct 1032 ms 340 KB Output is correct
25 Correct 543 ms 428 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 236 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 72 ms 348 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 124 ms 352 KB Output is correct
49 Correct 127 ms 364 KB Output is correct
50 Correct 120 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 80 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 88 ms 348 KB Output is correct
56 Correct 77 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 123 ms 340 KB Output is correct
61 Correct 130 ms 356 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 308 ms 420 KB Output is correct
64 Correct 317 ms 424 KB Output is correct
65 Correct 511 ms 432 KB Output is correct
66 Correct 301 ms 428 KB Output is correct
67 Correct 452 ms 432 KB Output is correct
68 Correct 463 ms 548 KB Output is correct
69 Correct 461 ms 588 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 457 ms 548 KB Output is correct
73 Correct 438 ms 432 KB Output is correct
74 Correct 476 ms 428 KB Output is correct
75 Correct 486 ms 432 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 563 ms 436 KB Output is correct
79 Correct 440 ms 436 KB Output is correct
80 Correct 1008 ms 468 KB Output is correct
81 Correct 978 ms 436 KB Output is correct
82 Correct 976 ms 432 KB Output is correct
83 Correct 480 ms 432 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 72 ms 340 KB Output is correct
86 Correct 447 ms 428 KB Output is correct
87 Correct 1 ms 308 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 129 ms 340 KB Output is correct
90 Correct 133 ms 364 KB Output is correct
91 Correct 119 ms 340 KB Output is correct
92 Correct 990 ms 340 KB Output is correct
93 Correct 978 ms 432 KB Output is correct
94 Correct 969 ms 432 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 308 KB Output is correct
97 Correct 487 ms 564 KB Output is correct
98 Correct 80 ms 340 KB Output is correct
99 Correct 514 ms 416 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 69 ms 364 KB Output is correct
102 Correct 74 ms 340 KB Output is correct
103 Correct 438 ms 340 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 308 KB Output is correct
107 Correct 126 ms 360 KB Output is correct
108 Correct 122 ms 340 KB Output is correct
109 Correct 1049 ms 452 KB Output is correct
110 Correct 970 ms 428 KB Output is correct
111 Correct 1 ms 212 KB Output is correct