oj.uz

답안 #648084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648084 2022-10-05T10:44:01 Z Clan328 동굴 (IOI13_cave) C++17
100 / 100
 412 ms 460 KB 
#include "cave.h"
#include "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;

#define DOWN 1
#define UP 0
#define NA 2

int n;
vi dir;

int check(int tmp, int lo, int mid, int hi) {
    int arr[n];
    for (int i = 0; i <= mid; i++) {
        if (dir[i] == NA) arr[i] = 1-tmp;
        else arr[i] = dir[i];
    }
     for (int i = mid+1; i < n; i++) {
        if (dir[i] == NA) arr[i] = tmp;
        else arr[i] = dir[i];
    }

    // for (int i = 0; i < n; i++) {
    //     cout << (arr[i] == UP? "UP" : "DOWN") << " ";
    // }
    // cout << endl;

    return tryCombination(arr);
}

void exploreCave(int N) {
    int S[N];
    int D[N];
    dir = vi(N, NA); // Dir to open door

    n = N;

    for (int i = 0; i < N; i++) {
        D[i] = -1;
    }

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            S[j] = DOWN;
            if (dir[j] != NA) S[j] = dir[j];
        }
        // for (int j = 0; j < N; j++) {
        //     if (D[j] != -1) S[D[j]] = dir[j];
        // }
        // cout << S[2] << endl;
        // for (int j = 0; j < N; j++) {
        //     cout << (S[j] == UP? "UP" : "DOWN") << " ";
        // }
        // cout << endl;

        int tmp = tryCombination(S);
        int tmpDir;
        if (tmp == i) {
            tmpDir = UP;
        } else
            tmpDir = DOWN;
        // cout << tmpDir << endl;
        int lo = 0, hi = N-1, mid;
        while (lo < hi) {
            mid = (lo+hi)/2;

            bool isDownI = check(tmpDir, lo, mid, hi) == i;
            // cout << lo << " " << mid << " " << isDownI << endl;
            if (isDownI) {
                hi = mid;
            } else
                lo = mid + 1;
        }
        D[lo] = i;
        if (tmp == i) {
            dir[lo] = UP;
        } else
            dir[lo] = DOWN;
        // cout << (dir[i] == UP? "UP" : "DOWN") << endl;
        // cout << "x: " << lo << endl;
    }

    for (int i = 0; i < N; i++) S[i] = dir[i];

    // int res[N];
    // for (int i = 0; i < N; i++) res[i] = dir[D[i]];

    // for (int i = 0; i < N; i++) {
    //     std::cout << S[i] << " ";
    // }
    // cout << endl;
    //  for (int i = 0; i < N; i++) {
    //     std::cout << D[i] << " ";
    // }
    // cout << endl;

    answer(S, D);
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 408 KB Output is correct
2 Correct 235 ms 400 KB Output is correct
3 Correct 411 ms 408 KB Output is correct
4 Correct 268 ms 392 KB Output is correct
5 Correct 405 ms 412 KB Output is correct
6 Correct 347 ms 424 KB Output is correct
7 Correct 388 ms 408 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 345 ms 416 KB Output is correct
13 Correct 354 ms 340 KB Output is correct
14 Correct 340 ms 408 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 404 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 361 ms 408 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 400 ms 420 KB Output is correct
7 Correct 357 ms 340 KB Output is correct
8 Correct 351 ms 412 KB Output is correct
9 Correct 360 ms 340 KB Output is correct
10 Correct 353 ms 412 KB Output is correct
11 Correct 354 ms 412 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 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 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 54 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 50 ms 340 KB Output is correct
24 Correct 53 ms 340 KB Output is correct
25 Correct 55 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 55 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 51 ms 348 KB Output is correct
31 Correct 50 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 50 ms 340 KB Output is correct
36 Correct 53 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 408 KB Output is correct
2 Correct 235 ms 400 KB Output is correct
3 Correct 411 ms 408 KB Output is correct
4 Correct 268 ms 392 KB Output is correct
5 Correct 405 ms 412 KB Output is correct
6 Correct 347 ms 424 KB Output is correct
7 Correct 388 ms 408 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 345 ms 416 KB Output is correct
13 Correct 354 ms 340 KB Output is correct
14 Correct 340 ms 408 KB Output is correct
15 Correct 385 ms 404 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 361 ms 408 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 400 ms 420 KB Output is correct
21 Correct 357 ms 340 KB Output is correct
22 Correct 351 ms 412 KB Output is correct
23 Correct 360 ms 340 KB Output is correct
24 Correct 353 ms 412 KB Output is correct
25 Correct 354 ms 412 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 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 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 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 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 54 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 50 ms 340 KB Output is correct
49 Correct 53 ms 340 KB Output is correct
50 Correct 55 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 55 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 51 ms 348 KB Output is correct
56 Correct 50 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 50 ms 340 KB Output is correct
61 Correct 53 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 227 ms 396 KB Output is correct
64 Correct 236 ms 392 KB Output is correct
65 Correct 412 ms 412 KB Output is correct
66 Correct 252 ms 412 KB Output is correct
67 Correct 395 ms 412 KB Output is correct
68 Correct 360 ms 460 KB Output is correct
69 Correct 390 ms 408 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 353 ms 408 KB Output is correct
73 Correct 347 ms 340 KB Output is correct
74 Correct 342 ms 412 KB Output is correct
75 Correct 363 ms 420 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 395 ms 408 KB Output is correct
79 Correct 352 ms 340 KB Output is correct
80 Correct 345 ms 416 KB Output is correct
81 Correct 351 ms 412 KB Output is correct
82 Correct 345 ms 424 KB Output is correct
83 Correct 354 ms 412 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 52 ms 340 KB Output is correct
86 Correct 341 ms 408 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 50 ms 340 KB Output is correct
90 Correct 55 ms 340 KB Output is correct
91 Correct 55 ms 340 KB Output is correct
92 Correct 354 ms 420 KB Output is correct
93 Correct 349 ms 408 KB Output is correct
94 Correct 350 ms 412 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 346 ms 424 KB Output is correct
98 Correct 52 ms 340 KB Output is correct
99 Correct 364 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 51 ms 340 KB Output is correct
102 Correct 51 ms 340 KB Output is correct
103 Correct 343 ms 408 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 53 ms 340 KB Output is correct
108 Correct 52 ms 340 KB Output is correct
109 Correct 351 ms 428 KB Output is correct
110 Correct 369 ms 412 KB Output is correct
111 Correct 1 ms 212 KB Output is correct