oj.uz

Submission #17650

# Submission time Handle Problem Language Result Execution time Memory
17650 2016-01-06T23:12:40 Z Namnamseo Cave (IOI13_cave) C++14
100 / 100
 493 ms 644 KB 
#include "cave.h"
#include <cstdio>

int  trial_array   [5010];

bool fixed_point   [5010];

int switch_forward [5010]; // index is for switch
int switch_reverse [5010]; // index is for door
int switch_parity  [5010]; // index is for switch; value makes it open.

int n;

// zero is for open, one means closed.

int try_wrapper(){
    int tmp = tryCombination(trial_array);
    if(tmp<0) tmp=2*n;
    return tmp;
}

void find_switch(int l,int r,int target,int zero_result){
    if(l==r){
        //printf("Found door %d : switch %d\n",target,l);
        switch_reverse[target]=l;
        switch_forward[l]=target;
        switch_parity [l]=1-zero_result;
        fixed_point   [l]=1;
    } else {
        int m=(l+r)/2;
        int i;
        for(i=l; i<=m; ++i) if(!fixed_point[i]) trial_array[i]=1;
        /*int tmp;
        printf("Trial ");
        for(tmp=0; tmp<n; ++tmp) {
            printf("%d",trial_array[tmp]);
            if(tmp+1<n) putchar(',');
        }
        printf(" : ");*/
        int result = try_wrapper();
        //printf("%d\n",result);
        for(i=l; i<=m; ++i) if(!fixed_point[i]) trial_array[i]=0;
        if((result != target) == !zero_result) {
            find_switch(l  , m, target, zero_result);
        } else {
            find_switch(m+1, r, target, zero_result);
        }
    }
}

void exploreCave(int n) {
    ::n=n;
    int i,j;
    for(i=0;i<n;++i){
        for(j=0;j<n;++j) trial_array[j]=0;
        for(j=0; j<i; ++j) {
            trial_array[switch_reverse[j]]=switch_parity[switch_reverse[j]];
            //printf("Fixed[%d] = %d; %d opens %d\n",j,fixed_point[j],switch_reverse[j],j);
        }
        /*printf("zero result(");
        printf("%d,%d,%d,%d",
               trial_array[0],
               trial_array[1],
               trial_array[2],
               trial_array[3]
               );
        printf(") : %d\n",(try_wrapper() != i));*/
        find_switch(0,n-1, i,(try_wrapper() != i));
    }
    answer(switch_parity, switch_forward);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 504 KB Output is correct
2 Correct 256 ms 480 KB Output is correct
3 Correct 323 ms 516 KB Output is correct
4 Correct 213 ms 536 KB Output is correct
5 Correct 449 ms 476 KB Output is correct
6 Correct 340 ms 516 KB Output is correct
7 Correct 488 ms 484 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 317 ms 516 KB Output is correct
13 Correct 340 ms 504 KB Output is correct
14 Correct 287 ms 536 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 524 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 329 ms 516 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 386 ms 512 KB Output is correct
7 Correct 309 ms 504 KB Output is correct
8 Correct 439 ms 512 KB Output is correct
9 Correct 428 ms 512 KB Output is correct
10 Correct 454 ms 588 KB Output is correct
11 Correct 330 ms 496 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 396 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 396 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 6 ms 396 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 396 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 396 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 6 ms 396 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 67 ms 512 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 82 ms 464 KB Output is correct
24 Correct 85 ms 460 KB Output is correct
25 Correct 80 ms 460 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 6 ms 324 KB Output is correct
28 Correct 66 ms 396 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 47 ms 460 KB Output is correct
31 Correct 47 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 68 ms 460 KB Output is correct
36 Correct 57 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 352 ms 524 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 329 ms 516 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 386 ms 512 KB Output is correct
7 Correct 309 ms 504 KB Output is correct
8 Correct 439 ms 512 KB Output is correct
9 Correct 428 ms 512 KB Output is correct
10 Correct 454 ms 588 KB Output is correct
11 Correct 330 ms 496 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 396 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 396 KB Output is correct
21 Correct 5 ms 396 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 6 ms 396 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 67 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 82 ms 464 KB Output is correct
35 Correct 85 ms 460 KB Output is correct
36 Correct 80 ms 460 KB Output is correct
37 Correct 6 ms 332 KB Output is correct
38 Correct 6 ms 324 KB Output is correct
39 Correct 66 ms 396 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 47 ms 460 KB Output is correct
42 Correct 47 ms 384 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 512 KB Output is correct
46 Correct 68 ms 460 KB Output is correct
47 Correct 57 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 231 ms 504 KB Output is correct
50 Correct 261 ms 496 KB Output is correct
51 Correct 301 ms 524 KB Output is correct
52 Correct 214 ms 484 KB Output is correct
53 Correct 351 ms 536 KB Output is correct
54 Correct 323 ms 488 KB Output is correct
55 Correct 351 ms 516 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 324 ms 512 KB Output is correct
59 Correct 306 ms 512 KB Output is correct
60 Correct 269 ms 516 KB Output is correct
61 Correct 360 ms 508 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 5 ms 512 KB Output is correct
64 Correct 391 ms 516 KB Output is correct
65 Correct 395 ms 504 KB Output is correct
66 Correct 455 ms 644 KB Output is correct
67 Correct 460 ms 516 KB Output is correct
68 Correct 422 ms 508 KB Output is correct
69 Correct 326 ms 520 KB Output is correct
70 Correct 6 ms 324 KB Output is correct
71 Correct 55 ms 396 KB Output is correct
72 Correct 292 ms 496 KB Output is correct
73 Correct 5 ms 396 KB Output is correct
74 Correct 5 ms 384 KB Output is correct
75 Correct 63 ms 468 KB Output is correct
76 Correct 73 ms 468 KB Output is correct
77 Correct 82 ms 512 KB Output is correct
78 Correct 404 ms 508 KB Output is correct
79 Correct 432 ms 512 KB Output is correct
80 Correct 493 ms 516 KB Output is correct
81 Correct 5 ms 324 KB Output is correct
82 Correct 6 ms 512 KB Output is correct
83 Correct 326 ms 516 KB Output is correct
84 Correct 54 ms 384 KB Output is correct
85 Correct 308 ms 504 KB Output is correct
86 Correct 5 ms 384 KB Output is correct
87 Correct 50 ms 464 KB Output is correct
88 Correct 50 ms 384 KB Output is correct
89 Correct 293 ms 512 KB Output is correct
90 Correct 6 ms 396 KB Output is correct
91 Correct 6 ms 396 KB Output is correct
92 Correct 5 ms 384 KB Output is correct
93 Correct 60 ms 424 KB Output is correct
94 Correct 60 ms 384 KB Output is correct
95 Correct 424 ms 516 KB Output is correct
96 Correct 412 ms 580 KB Output is correct
97 Correct 5 ms 384 KB Output is correct