oj.uz

답안 #768846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768846 2023-06-28T18:22:25 Z Ludissey 동굴 (IOI13_cave) C++14
100 / 100
 340 ms 424 KB 
#include "cave.h"
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>

using namespace std;


int S[100000] = {0};
int S0[100000] = { 0 };
int S1[100000] = { 0 };

int D[100000] = { 0 };

void exploreCave(int N) {
    int crack = 0;
    for (int i = 0; i < N; i++)
    {
        S[i] = 1;
        D[i] = 0;
    }
    /* while (crack < N) {
        S[crack] = 1 - S[crack];
        crack = tryCombination(S);
        if (crack == -1) break;
    }*/
    vector<bool> visited(N);
    while (crack < N) {
        int l=0, r=N-1;
        int comb = 0;
        for (int i = l; i <= r; i++)
        {
            if (!visited[i]) {
                S[i] = 0;
            }
        }
        int res = tryCombination(S);
        if (res == crack) {
            comb = 1;
            for (int i = l; i <= r; i++)
            {
                if (!visited[i]) {
                    S[i] = 1;
                }
            }
        }
        while (l < r) {
            int mid = (l + r) / 2;
            for (int i = l; i <= r; i++)
            {
                if (!visited[i]) {
                    if (i>mid) {
                       S[i] = 1-comb;
                    }
                    else {
                        S[i] = comb;
                    }
                }
            }
            res = tryCombination(S);
            if (res > crack || res == -1) {
                r = mid;
            }
            else {
                for (int i = l; i <= mid; i++)
                {
                    if (!visited[i]) S[i] = 1-comb;
                }
                l = mid+1;
            }
        }
        S[l] = comb;
        visited[l] = true;
        D[l] = crack;
        crack++;
    }
    answer(S, D);
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 404 KB Output is correct
2 Correct 117 ms 316 KB Output is correct
3 Correct 218 ms 424 KB Output is correct
4 Correct 124 ms 408 KB Output is correct
5 Correct 178 ms 424 KB Output is correct
6 Correct 171 ms 424 KB Output is correct
7 Correct 174 ms 424 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 169 ms 340 KB Output is correct
13 Correct 173 ms 416 KB Output is correct
14 Correct 169 ms 420 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 184 ms 420 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 215 ms 424 KB Output is correct
7 Correct 184 ms 416 KB Output is correct
8 Correct 305 ms 316 KB Output is correct
9 Correct 335 ms 420 KB Output is correct
10 Correct 307 ms 424 KB Output is correct
11 Correct 168 ms 424 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 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 308 KB Output is correct
13 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 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 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 30 ms 372 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 45 ms 340 KB Output is correct
24 Correct 46 ms 352 KB Output is correct
25 Correct 45 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 27 ms 352 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 30 ms 340 KB Output is correct
31 Correct 28 ms 324 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 46 ms 340 KB Output is correct
36 Correct 44 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 404 KB Output is correct
2 Correct 117 ms 316 KB Output is correct
3 Correct 218 ms 424 KB Output is correct
4 Correct 124 ms 408 KB Output is correct
5 Correct 178 ms 424 KB Output is correct
6 Correct 171 ms 424 KB Output is correct
7 Correct 174 ms 424 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 169 ms 340 KB Output is correct
13 Correct 173 ms 416 KB Output is correct
14 Correct 169 ms 420 KB Output is correct
15 Correct 172 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 184 ms 420 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 215 ms 424 KB Output is correct
21 Correct 184 ms 416 KB Output is correct
22 Correct 305 ms 316 KB Output is correct
23 Correct 335 ms 420 KB Output is correct
24 Correct 307 ms 424 KB Output is correct
25 Correct 168 ms 424 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 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 308 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 308 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 308 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 30 ms 372 KB Output is correct
46 Correct 1 ms 312 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 45 ms 340 KB Output is correct
49 Correct 46 ms 352 KB Output is correct
50 Correct 45 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 27 ms 352 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 30 ms 340 KB Output is correct
56 Correct 28 ms 324 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 304 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 46 ms 340 KB Output is correct
61 Correct 44 ms 340 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 109 ms 412 KB Output is correct
64 Correct 123 ms 408 KB Output is correct
65 Correct 206 ms 420 KB Output is correct
66 Correct 128 ms 408 KB Output is correct
67 Correct 194 ms 424 KB Output is correct
68 Correct 180 ms 416 KB Output is correct
69 Correct 176 ms 340 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 171 ms 424 KB Output is correct
73 Correct 206 ms 340 KB Output is correct
74 Correct 185 ms 416 KB Output is correct
75 Correct 182 ms 416 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 176 ms 420 KB Output is correct
79 Correct 191 ms 424 KB Output is correct
80 Correct 316 ms 420 KB Output is correct
81 Correct 330 ms 420 KB Output is correct
82 Correct 322 ms 416 KB Output is correct
83 Correct 186 ms 416 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 31 ms 340 KB Output is correct
86 Correct 197 ms 368 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 53 ms 348 KB Output is correct
90 Correct 45 ms 352 KB Output is correct
91 Correct 46 ms 352 KB Output is correct
92 Correct 339 ms 420 KB Output is correct
93 Correct 337 ms 420 KB Output is correct
94 Correct 340 ms 416 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 172 ms 416 KB Output is correct
98 Correct 26 ms 352 KB Output is correct
99 Correct 168 ms 420 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 26 ms 352 KB Output is correct
102 Correct 27 ms 352 KB Output is correct
103 Correct 188 ms 420 KB Output is correct
104 Correct 1 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 45 ms 348 KB Output is correct
108 Correct 42 ms 320 KB Output is correct
109 Correct 340 ms 416 KB Output is correct
110 Correct 321 ms 420 KB Output is correct
111 Correct 1 ms 212 KB Output is correct