oj.uz

Submission #16640

# Submission time Handle Problem Language Result Execution time Memory
16640 2015-09-02T05:09:10 Z suhgyuho_william Cave (IOI13_cave) C++
100 / 100
 507 ms 604 KB 
#include "cave.h"

int ans[5002],door[5002],res[5002],resd[5002];
int test[5002],check[5002];

void exploreCave(int N) {
    //ans[0]=ans[1]=ans[2]=1; ans[3]=0;
    //door[0]=3; door[1]=1; door[2]=0; door[3]=2;

    int i,j,n=N;
    int left,mid,right;
    int num;

    for(i=0;i<n;i++){
        for(j=0;j<n;j++) if(!check[j]) test[j]=0;
        num=tryCombination(test);
        if(num==i) ans[i]=1;
        else ans[i]=0;

        left=0; right=n-1;
        while(left<=right){
            mid=(left+right)/2;
            if(left==right) break;

            for(j=left;j<=mid;j++) if(!check[j]) test[j]=ans[i];
            for(j=mid+1;j<=right;j++) if(!check[j]) test[j]=1-ans[i];
            num=tryCombination(test);
            if(num==i) left=mid+1;
            else right=mid;
        }
        door[i]=mid;
        check[mid]=1;
        test[mid]=ans[i];
    }

    for(i=0;i<n;i++) res[door[i]]=ans[i];
    for(i=0;i<n;i++) resd[door[i]]=i;
    answer(res,resd);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 452 KB Output is correct
2 Correct 199 ms 456 KB Output is correct
3 Correct 328 ms 504 KB Output is correct
4 Correct 248 ms 480 KB Output is correct
5 Correct 292 ms 488 KB Output is correct
6 Correct 331 ms 604 KB Output is correct
7 Correct 317 ms 572 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 335 ms 464 KB Output is correct
13 Correct 299 ms 508 KB Output is correct
14 Correct 383 ms 488 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 496 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 393 ms 480 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 294 ms 448 KB Output is correct
7 Correct 413 ms 484 KB Output is correct
8 Correct 507 ms 488 KB Output is correct
9 Correct 427 ms 488 KB Output is correct
10 Correct 471 ms 484 KB Output is correct
11 Correct 452 ms 472 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 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 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 304 KB Output is correct
14 Correct 5 ms 360 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 360 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 39 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 69 ms 424 KB Output is correct
10 Correct 60 ms 384 KB Output is correct
11 Correct 87 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 66 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 51 ms 484 KB Output is correct
17 Correct 38 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 56 ms 424 KB Output is correct
22 Correct 59 ms 452 KB Output is correct
23 Correct 4 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 584 KB Output is correct
2 Correct 171 ms 480 KB Output is correct
3 Correct 281 ms 468 KB Output is correct
4 Correct 202 ms 504 KB Output is correct
5 Correct 318 ms 460 KB Output is correct
6 Correct 361 ms 492 KB Output is correct
7 Correct 397 ms 488 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 342 ms 492 KB Output is correct
11 Correct 290 ms 500 KB Output is correct
12 Correct 294 ms 576 KB Output is correct
13 Correct 448 ms 488 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 364 ms 504 KB Output is correct
17 Correct 291 ms 488 KB Output is correct
18 Correct 392 ms 476 KB Output is correct
19 Correct 368 ms 476 KB Output is correct
20 Correct 401 ms 492 KB Output is correct
21 Correct 331 ms 496 KB Output is correct
22 Correct 5 ms 436 KB Output is correct
23 Correct 48 ms 384 KB Output is correct
24 Correct 248 ms 484 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 80 ms 384 KB Output is correct
28 Correct 77 ms 428 KB Output is correct
29 Correct 60 ms 428 KB Output is correct
30 Correct 472 ms 492 KB Output is correct
31 Correct 444 ms 488 KB Output is correct
32 Correct 475 ms 468 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 270 ms 488 KB Output is correct
36 Correct 65 ms 512 KB Output is correct
37 Correct 276 ms 492 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 42 ms 424 KB Output is correct
40 Correct 50 ms 384 KB Output is correct
41 Correct 258 ms 504 KB Output is correct
42 Correct 4 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 72 ms 424 KB Output is correct
46 Correct 58 ms 384 KB Output is correct
47 Correct 376 ms 512 KB Output is correct
48 Correct 435 ms 468 KB Output is correct
49 Correct 5 ms 384 KB Output is correct