답안 #446336

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446336 2021-07-21T15:08:31 Z mickytanawin 동굴 (IOI13_cave) C++14
100 / 100
283 ms 460 KB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;

bool isOpen(int i, int ret){
    return ret == -1 || ret > i;
}

void exploreCave(int N){
    int switches[N], permu[N], ansD[N], ansP[N];
    for(int i = 0; i < N; ++i){
        switches[i] = i;
        permu[i] = 0;
        ansP[i] = 0;
        ansD[i] = 0;
    }
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < N - i; ++j){
            permu[switches[j]] = 0;
        }
        int correct;
        /*cout << "PRINT SWITCHES\n";
        for(int j = 0; j < N; ++j){
            cout << switches[j] << ' ';
        }
        cout << '\n';
        printPermu(permu, N);
        printf("check:%d\n", tryCombination(permu));*/
        if(isOpen(i, tryCombination(permu))){
            correct = 0;
        } else {
            correct = 1;
        }
        //printf("correct:%d\n", correct);
        int l = 0;
        int r = N - i - 1;
        int ans = 0;
        while(l < r){
            //printf("l:%d r:%d\n", l, r);
            int m = (l + r) / 2;
            //permu[switches[m]] = correct ^ 1;
            for(int j = l; j <= m; ++j){
                permu[switches[j]] = correct;
            }
            for(int j = m + 1; j <= r; ++j){
                permu[switches[j]] = correct ^ 1;
            }
            if(isOpen(i, tryCombination(permu))){
                r = m;
            } else {
                /*for(int j = l; j <= m; ++j){
                    permu[switches[j]] = correct ^ 1;
                }*/
                l = m + 1;
            }
        }
        ans = l;
        //printf("ans:%d door[%d]:%d\n", ans, i, switches[ans]);
        ansP[switches[ans]] = correct;
        permu[switches[ans]] = correct;
        ansD[switches[ans]] = i;
        swap(switches[ans], switches[N - i - 1]);
        /*cout << "ansP: ";
        for(int j = 0; j < N; ++j){
            cout << ansP[j] << ' ';
        }
        cout << "\nansD: ";
        for(int j = 0; j < N; ++j){
            cout << ansD[j] << ' ';
        }
        cout << '\n';*/
    }
    answer(ansP, ansD);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 332 KB Output is correct
2 Correct 159 ms 416 KB Output is correct
3 Correct 222 ms 436 KB Output is correct
4 Correct 161 ms 416 KB Output is correct
5 Correct 227 ms 332 KB Output is correct
6 Correct 217 ms 452 KB Output is correct
7 Correct 232 ms 452 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 212 ms 440 KB Output is correct
13 Correct 217 ms 436 KB Output is correct
14 Correct 214 ms 452 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 408 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 229 ms 432 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 223 ms 460 KB Output is correct
7 Correct 245 ms 332 KB Output is correct
8 Correct 276 ms 452 KB Output is correct
9 Correct 278 ms 452 KB Output is correct
10 Correct 283 ms 440 KB Output is correct
11 Correct 222 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 36 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 36 ms 332 KB Output is correct
24 Correct 37 ms 332 KB Output is correct
25 Correct 40 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 33 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 35 ms 332 KB Output is correct
31 Correct 34 ms 336 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 38 ms 332 KB Output is correct
36 Correct 36 ms 332 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 332 KB Output is correct
2 Correct 159 ms 416 KB Output is correct
3 Correct 222 ms 436 KB Output is correct
4 Correct 161 ms 416 KB Output is correct
5 Correct 227 ms 332 KB Output is correct
6 Correct 217 ms 452 KB Output is correct
7 Correct 232 ms 452 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 212 ms 440 KB Output is correct
13 Correct 217 ms 436 KB Output is correct
14 Correct 214 ms 452 KB Output is correct
15 Correct 230 ms 408 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 229 ms 432 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 223 ms 460 KB Output is correct
21 Correct 245 ms 332 KB Output is correct
22 Correct 276 ms 452 KB Output is correct
23 Correct 278 ms 452 KB Output is correct
24 Correct 283 ms 440 KB Output is correct
25 Correct 222 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 36 ms 332 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 36 ms 332 KB Output is correct
49 Correct 37 ms 332 KB Output is correct
50 Correct 40 ms 332 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 33 ms 332 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 35 ms 332 KB Output is correct
56 Correct 34 ms 336 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 38 ms 332 KB Output is correct
61 Correct 36 ms 332 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 143 ms 332 KB Output is correct
64 Correct 143 ms 332 KB Output is correct
65 Correct 222 ms 332 KB Output is correct
66 Correct 148 ms 452 KB Output is correct
67 Correct 228 ms 444 KB Output is correct
68 Correct 217 ms 460 KB Output is correct
69 Correct 225 ms 440 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 217 ms 332 KB Output is correct
73 Correct 218 ms 440 KB Output is correct
74 Correct 208 ms 452 KB Output is correct
75 Correct 232 ms 440 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 234 ms 448 KB Output is correct
79 Correct 253 ms 460 KB Output is correct
80 Correct 274 ms 432 KB Output is correct
81 Correct 278 ms 332 KB Output is correct
82 Correct 269 ms 440 KB Output is correct
83 Correct 224 ms 448 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 34 ms 332 KB Output is correct
86 Correct 212 ms 448 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 35 ms 332 KB Output is correct
90 Correct 35 ms 332 KB Output is correct
91 Correct 34 ms 332 KB Output is correct
92 Correct 256 ms 444 KB Output is correct
93 Correct 261 ms 452 KB Output is correct
94 Correct 262 ms 452 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 212 ms 440 KB Output is correct
98 Correct 37 ms 332 KB Output is correct
99 Correct 224 ms 432 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 36 ms 332 KB Output is correct
102 Correct 36 ms 364 KB Output is correct
103 Correct 215 ms 452 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 36 ms 364 KB Output is correct
108 Correct 36 ms 332 KB Output is correct
109 Correct 263 ms 448 KB Output is correct
110 Correct 264 ms 452 KB Output is correct
111 Correct 1 ms 296 KB Output is correct