oj.uz

답안 #796848

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796848 2023-07-28T20:47:52 Z Mohammed_Atalah 동굴 (IOI13_cave) C++17
100 / 100
 511 ms 688 KB 
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;
int can_change [5000];
int S [5000]; // correct position
int D [5000]; // destination

// tryCombination() => to check

int n;
int nums [5000];
void solve_for_X(int x) {

    int e = tryCombination(nums);

    if (e != x) {
        for (int i = 0; i < n ; i ++) {
            if (!can_change[i]) {
                if (nums[i] == 1) {
                    nums[i] = 0;
                } else {
                    nums[i] = 1;
                }
            }
        }
    }

    int l = 0;
    int r = n - 1;

    int  v[5000] =  {1};
    while (l < r) {
        // if (x == 3) {
        //     cout << l << " " << r << endl;
        // }
        // v = nums;
        // if (x == 3) {
        //     cout << v[0] << " " << v[1] << endl;
        // }
        int mid = (l + r) / 2;
        for (int i = 0; i < n; i++) {
            if (l <= i && i <= mid && !can_change[i]) {
                if (nums[i] == 1) {
                    v[i] = 0;
                } else {
                    v[i] = 1;
                }
            } else {
                v[i] = nums[i];
            }
        }
        // if (x == 3) {
        //     cout << v[0] << " " << v[1] << endl;
        // }
        e = tryCombination(v);
        if (e > x ||  e == -1) {
            r = mid;
        } else {
            l = mid + 1;
        }

    }

    can_change[l] = 1;
    // cout << x << " " << l << endl;
    if (nums[l] == 1) {
        S[l] =  0;
        nums[l] =  0;
    } else {
        S[l] =  1;
        nums[l] =  1;
    }
    D[l] = x;

}



void exploreCave(int N) {
    n = N;


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

    answer(S, D);
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 285 ms 432 KB Output is correct
2 Correct 284 ms 420 KB Output is correct
3 Correct 447 ms 488 KB Output is correct
4 Correct 295 ms 340 KB Output is correct
5 Correct 445 ms 572 KB Output is correct
6 Correct 453 ms 440 KB Output is correct
7 Correct 443 ms 436 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 447 ms 452 KB Output is correct
13 Correct 447 ms 464 KB Output is correct
14 Correct 452 ms 432 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 438 ms 460 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 437 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 447 ms 464 KB Output is correct
7 Correct 445 ms 460 KB Output is correct
8 Correct 462 ms 468 KB Output is correct
9 Correct 460 ms 468 KB Output is correct
10 Correct 461 ms 468 KB Output is correct
11 Correct 457 ms 540 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 63 ms 388 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 73 ms 384 KB Output is correct
24 Correct 68 ms 384 KB Output is correct
25 Correct 69 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 65 ms 384 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 65 ms 376 KB Output is correct
31 Correct 65 ms 384 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 69 ms 388 KB Output is correct
36 Correct 72 ms 400 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 285 ms 432 KB Output is correct
2 Correct 284 ms 420 KB Output is correct
3 Correct 447 ms 488 KB Output is correct
4 Correct 295 ms 340 KB Output is correct
5 Correct 445 ms 572 KB Output is correct
6 Correct 453 ms 440 KB Output is correct
7 Correct 443 ms 436 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 447 ms 452 KB Output is correct
13 Correct 447 ms 464 KB Output is correct
14 Correct 452 ms 432 KB Output is correct
15 Correct 438 ms 460 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 437 ms 468 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 447 ms 464 KB Output is correct
21 Correct 445 ms 460 KB Output is correct
22 Correct 462 ms 468 KB Output is correct
23 Correct 460 ms 468 KB Output is correct
24 Correct 461 ms 468 KB Output is correct
25 Correct 457 ms 540 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 300 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 304 KB Output is correct
44 Correct 1 ms 304 KB Output is correct
45 Correct 63 ms 388 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 73 ms 384 KB Output is correct
49 Correct 68 ms 384 KB Output is correct
50 Correct 69 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 65 ms 384 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 65 ms 376 KB Output is correct
56 Correct 65 ms 384 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 69 ms 388 KB Output is correct
61 Correct 72 ms 400 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 286 ms 436 KB Output is correct
64 Correct 301 ms 340 KB Output is correct
65 Correct 438 ms 436 KB Output is correct
66 Correct 307 ms 340 KB Output is correct
67 Correct 443 ms 504 KB Output is correct
68 Correct 461 ms 560 KB Output is correct
69 Correct 451 ms 432 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 300 KB Output is correct
72 Correct 462 ms 460 KB Output is correct
73 Correct 449 ms 432 KB Output is correct
74 Correct 453 ms 616 KB Output is correct
75 Correct 439 ms 428 KB Output is correct
76 Correct 0 ms 340 KB Output is correct
77 Correct 0 ms 340 KB Output is correct
78 Correct 441 ms 432 KB Output is correct
79 Correct 452 ms 464 KB Output is correct
80 Correct 472 ms 468 KB Output is correct
81 Correct 476 ms 460 KB Output is correct
82 Correct 458 ms 468 KB Output is correct
83 Correct 446 ms 432 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 63 ms 384 KB Output is correct
86 Correct 441 ms 460 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 68 ms 384 KB Output is correct
90 Correct 69 ms 388 KB Output is correct
91 Correct 69 ms 312 KB Output is correct
92 Correct 500 ms 468 KB Output is correct
93 Correct 511 ms 468 KB Output is correct
94 Correct 493 ms 468 KB Output is correct
95 Correct 1 ms 304 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 453 ms 688 KB Output is correct
98 Correct 64 ms 340 KB Output is correct
99 Correct 448 ms 556 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 65 ms 388 KB Output is correct
102 Correct 64 ms 388 KB Output is correct
103 Correct 443 ms 436 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 304 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 68 ms 388 KB Output is correct
108 Correct 67 ms 340 KB Output is correct
109 Correct 505 ms 588 KB Output is correct
110 Correct 482 ms 460 KB Output is correct
111 Correct 1 ms 340 KB Output is correct