oj.uz

Submission #16207

# Submission time Handle Problem Language Result Execution time Memory
16207 2015-08-17T11:54:08 Z mindol Cave (IOI13_cave) C++
100 / 100
 1061 ms 608 KB 
#include "cave.h"
#include<cstdio>
int temp[5001]; // 시도할 배열
bool check[5001]; // check[i] : i번째 스위치를 알아냈는지
int ans[5001]; // ans[i] : i번째 스위치의 답(i번째 스위치에 연결된 문을 열리게 하는 스위치의 답)
int connected[5001]; // connected[i]  :i번째 스위치와 연결된 문
void exploreCave(int N) {
    for(int i=0;i<N;i++) // i번째 문과 연결된 스위치를 찾을 것임.
    {
        for(int j=0;j<N;j++)
        {
            if(check[j]) temp[j]=ans[j];
            else temp[j]=0;
        } // 일단 스위치를 다 올려본다.

        int res=tryCombination(temp);
        if(res!=i)
        {
            for(int j=0;j<N;j++)
            {
                if(check[j]) temp[j]=ans[j];
                else temp[j]=1;
            } // 일단 스위치를 다 내려본다.
        }

        // 이제 i번째 문이 막혀있음

        int s=0,e=N-1;
        while(s<e)
        {
            int mid=(s+e)/2;
            for(int j=0;j<=mid;j++)
            {
                if(check[j]) temp[j]=ans[j];
                else temp[j]=!temp[j];
            } // 0~mid번째 까지를 반전시켜본다.

            int res=tryCombination(temp);
            if(res==i) // 그래도 i번째 문이 막혀있다면
            {
                // i번째 문에 연결된 문은 mid+1~e까지에 있다.
                s=mid+1;
            }
            else // i번째 문이 열렸다면
            {
                // i번째 문에 연결된 문은 s~mid까지에 있다.
                e=mid;
                for(int j=0;j<=mid;j++)
                {
                    if(check[j]) temp[j]=ans[j];
                    else temp[j]=!temp[j];
                } // 다시 원래대로
            }
        }
        check[s]=true;
        ans[s]=!temp[s];
        connected[s]=i;
    }
    answer(ans,connected);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 512 KB Output is correct
2 Correct 227 ms 516 KB Output is correct
3 Correct 504 ms 468 KB Output is correct
4 Correct 425 ms 484 KB Output is correct
5 Correct 563 ms 476 KB Output is correct
6 Correct 423 ms 504 KB Output is correct
7 Correct 506 ms 488 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 494 ms 520 KB Output is correct
13 Correct 472 ms 516 KB Output is correct
14 Correct 522 ms 480 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 495 ms 464 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 499 ms 504 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 491 ms 472 KB Output is correct
7 Correct 522 ms 384 KB Output is correct
8 Correct 906 ms 500 KB Output is correct
9 Correct 979 ms 516 KB Output is correct
10 Correct 884 ms 504 KB Output is correct
11 Correct 538 ms 512 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 6 ms 452 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 420 KB Output is correct
11 Correct 5 ms 396 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 512 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 452 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 82 ms 452 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 108 ms 512 KB Output is correct
10 Correct 134 ms 512 KB Output is correct
11 Correct 96 ms 512 KB Output is correct
12 Correct 5 ms 396 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 64 ms 448 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 105 ms 456 KB Output is correct
17 Correct 69 ms 452 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 5 ms 396 KB Output is correct
21 Correct 99 ms 512 KB Output is correct
22 Correct 140 ms 512 KB Output is correct
23 Correct 5 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 384 KB Output is correct
2 Correct 332 ms 516 KB Output is correct
3 Correct 469 ms 512 KB Output is correct
4 Correct 307 ms 516 KB Output is correct
5 Correct 515 ms 500 KB Output is correct
6 Correct 544 ms 472 KB Output is correct
7 Correct 427 ms 512 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 485 ms 512 KB Output is correct
11 Correct 436 ms 472 KB Output is correct
12 Correct 531 ms 488 KB Output is correct
13 Correct 577 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 457 ms 488 KB Output is correct
17 Correct 542 ms 480 KB Output is correct
18 Correct 1061 ms 500 KB Output is correct
19 Correct 868 ms 516 KB Output is correct
20 Correct 888 ms 500 KB Output is correct
21 Correct 601 ms 500 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 74 ms 444 KB Output is correct
24 Correct 536 ms 480 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 111 ms 512 KB Output is correct
28 Correct 101 ms 384 KB Output is correct
29 Correct 112 ms 384 KB Output is correct
30 Correct 841 ms 500 KB Output is correct
31 Correct 835 ms 504 KB Output is correct
32 Correct 814 ms 500 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 461 ms 480 KB Output is correct
36 Correct 63 ms 512 KB Output is correct
37 Correct 420 ms 512 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 93 ms 524 KB Output is correct
40 Correct 65 ms 444 KB Output is correct
41 Correct 476 ms 608 KB Output is correct
42 Correct 5 ms 332 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 113 ms 512 KB Output is correct
46 Correct 115 ms 452 KB Output is correct
47 Correct 892 ms 496 KB Output is correct
48 Correct 876 ms 504 KB Output is correct
49 Correct 5 ms 512 KB Output is correct