oj.uz

Submission #578830

# Submission time Handle Problem Language Result Execution time Memory
578830 2022-06-18T05:19:17 Z Mazaalai Cave (IOI13_cave) C++17
100 / 100
 862 ms 460 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int n;
// tryCombination
void exploreCave(int N) {
    n = N;
    int lastAns = 0;
    int value[n], switches[n]; memset(value, 0, sizeof(value)); memset(switches, -1, sizeof(switches));
    bool assigned[N]; memset(assigned, 0, sizeof(assigned));
    int assignCnt = 0;
    bool done = 0;
    for (int i = 0; i < n && !done; i++) {
        int nums[n], tar = 0;
        for (int j = 0; j < n; j++) {
            nums[j] = 0;
            if (assigned[j]) nums[j] = value[j];
        }
        int cur = tryCombination(nums);
        if (cur == -1) {
            for (int j = 0; j < n; j++) value[j] = nums[j];
            break;
        } else if(assignCnt==n-1 && cur == n-1) {
            // cout << "HERE?\n";
            for (int j = 0; j < n; j++) {
                nums[j] = 1;
                if (assigned[j]) nums[j] = value[j];
            }
            for (int j = 0; j < n; j++) value[j] = nums[j];
            break;
        }
        if (cur == i) tar = 1; // did not open
        int l = 0, r = n-1, res = r;
        while(l <= r && !done) {
            // checkLeft
            int mid = (l+r)>>1;
            int L = l, R = mid;
            for (int j = 0; j < n; j++) {
                if (assigned[j]) nums[j] = value[j];
                else {
                    if (L <= j && j <= R) {
                        nums[j] = tar;
                    } else {
                        nums[j] = tar^1;
                    }
                }
            }
            cur = tryCombination(nums);
            if (cur == -1) {
                for (int j = 0; j < n; j++) 
                    value[j] = nums[j];
                
                done = 1;
                break;
            }
            if (cur == i) { // did not open
                l = mid+1;
            } else {
                r = mid;
            }
            if (l == r) {
                res = l;
                break;
            }
        }
        if (!done) {
            switches[res] = i;
            assigned[res] = 1; assignCnt++;
            value[res] = tar;
        }
    }
    for (int i = 0; i < n; i++) {
        if (switches[i] == -1) {
            value[i] ^= 1;
            switches[i] = tryCombination(value);
            value[i] ^= 1;
        }
    }
    answer(value, switches);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:8:9: warning: unused variable 'lastAns' [-Wunused-variable]
    8 |     int lastAns = 0;
      |         ^~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 384 KB Output is correct
2 Correct 238 ms 384 KB Output is correct
3 Correct 434 ms 408 KB Output is correct
4 Correct 110 ms 380 KB Output is correct
5 Correct 9 ms 416 KB Output is correct
6 Correct 451 ms 392 KB Output is correct
7 Correct 400 ms 396 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 374 ms 396 KB Output is correct
13 Correct 407 ms 396 KB Output is correct
14 Correct 413 ms 396 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 9 ms 416 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 340 KB Output is correct
7 Correct 8 ms 340 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 9 ms 420 KB Output is correct
10 Correct 12 ms 340 KB Output is correct
11 Correct 8 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory 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 0 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 1 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 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory 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 0 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 1 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 1 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 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 55 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 97 ms 344 KB Output is correct
24 Correct 106 ms 340 KB Output is correct
25 Correct 103 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 66 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 59 ms 340 KB Output is correct
31 Correct 55 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 100 ms 344 KB Output is correct
36 Correct 101 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 384 KB Output is correct
2 Correct 238 ms 384 KB Output is correct
3 Correct 434 ms 408 KB Output is correct
4 Correct 110 ms 380 KB Output is correct
5 Correct 9 ms 416 KB Output is correct
6 Correct 451 ms 392 KB Output is correct
7 Correct 400 ms 396 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 374 ms 396 KB Output is correct
13 Correct 407 ms 396 KB Output is correct
14 Correct 413 ms 396 KB Output is correct
15 Correct 9 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 9 ms 416 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 10 ms 340 KB Output is correct
21 Correct 8 ms 340 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 9 ms 420 KB Output is correct
24 Correct 12 ms 340 KB Output is correct
25 Correct 8 ms 340 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 0 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 1 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 1 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 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 55 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 97 ms 344 KB Output is correct
49 Correct 106 ms 340 KB Output is correct
50 Correct 103 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 66 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 59 ms 340 KB Output is correct
56 Correct 55 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 100 ms 344 KB Output is correct
61 Correct 101 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 234 ms 384 KB Output is correct
64 Correct 258 ms 380 KB Output is correct
65 Correct 378 ms 340 KB Output is correct
66 Correct 102 ms 340 KB Output is correct
67 Correct 8 ms 420 KB Output is correct
68 Correct 366 ms 396 KB Output is correct
69 Correct 403 ms 392 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 380 ms 396 KB Output is correct
73 Correct 395 ms 396 KB Output is correct
74 Correct 364 ms 340 KB Output is correct
75 Correct 9 ms 340 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 9 ms 340 KB Output is correct
79 Correct 9 ms 340 KB Output is correct
80 Correct 10 ms 412 KB Output is correct
81 Correct 9 ms 412 KB Output is correct
82 Correct 9 ms 340 KB Output is correct
83 Correct 9 ms 340 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 51 ms 340 KB Output is correct
86 Correct 341 ms 400 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 106 ms 340 KB Output is correct
90 Correct 102 ms 340 KB Output is correct
91 Correct 109 ms 344 KB Output is correct
92 Correct 862 ms 408 KB Output is correct
93 Correct 826 ms 460 KB Output is correct
94 Correct 841 ms 392 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 386 ms 412 KB Output is correct
98 Correct 70 ms 340 KB Output is correct
99 Correct 453 ms 396 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 64 ms 340 KB Output is correct
102 Correct 54 ms 340 KB Output is correct
103 Correct 355 ms 340 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 102 ms 340 KB Output is correct
108 Correct 106 ms 340 KB Output is correct
109 Correct 846 ms 340 KB Output is correct
110 Correct 807 ms 396 KB Output is correct
111 Correct 0 ms 212 KB Output is correct