oj.uz

Submission #648897

# Submission time Handle Problem Language Result Execution time Memory
648897 2022-10-08T17:04:33 Z JANCARAPAN Cave (IOI13_cave) C++17
100 / 100
 1483 ms 460 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x);
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr <<__func__<<":"<<" [" << #x << "] = ["; _print(x); /*cerr << "\e[39m" << endl;*/
#else
#define dbg(x...)
#endif


// int tryCombination(int a[4]) {
//     int sm = 0;
//     if (a[2] == 1) {
//         sm++;
//         if (a[1] == 1) {
//             sm++;
//             if (a[3] == 0) {
//                 sm++;
//                 if (a[0] == 1) {
//                     sm++;
//                 }
//             }
//         }
//     }
//     if (sm == 4) return -1;
//     else return sm;
// }


void exploreCave(int n) {
    int pos[n], con[n];
    
    memset(con, -1, sizeof(con));
    memset(pos, 0, sizeof(pos));

    for (int i=0; i<n; i++) {
        // per a cada porta faig bs dels interruptors
        int l = 0, r = n - 1;
        int res = n - 1;
        int on = (tryCombination(pos) == i);

        while (l <= r) {
            int m = l + (r - l) / 2;
            bool can = 0;
 
            for (int j=0; j<n; j++) {
                if (con[j] != -1) continue;
                if (j >= l && j <= m) {
                    pos[j] = on;
                } else {
                    pos[j] = 1 - on;
                }
            }

            int ans = tryCombination(pos);
            
            if (ans >= i + 1 || ans == -1) {
                can = 1;
            } 

            for (int j=0; j<n; j++) {
                if (con[j] != -1) continue;
                pos[j] = 0;
            }

            if (can) {
                r = m - 1;
                res = m;
            } else {
                l = m + 1;
            }
        }
        
        pos[res] = on;
        con[res] = i;
    }
    
    // for (auto x : pos) cout << x << " ";
    // cout << endl << endl;
    // for (auto x : con) cout << x <<" ";
    // cout << endl;

    answer(pos, con);
}

// int main() {
//     exploreCave(4);
// }

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 340 KB Output is correct
2 Correct 341 ms 364 KB Output is correct
3 Correct 569 ms 372 KB Output is correct
4 Correct 347 ms 360 KB Output is correct
5 Correct 523 ms 368 KB Output is correct
6 Correct 519 ms 368 KB Output is correct
7 Correct 530 ms 368 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 499 ms 372 KB Output is correct
13 Correct 490 ms 368 KB Output is correct
14 Correct 490 ms 368 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 372 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 596 ms 372 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 496 ms 340 KB Output is correct
7 Correct 455 ms 372 KB Output is correct
8 Correct 1478 ms 372 KB Output is correct
9 Correct 1452 ms 372 KB Output is correct
10 Correct 1483 ms 372 KB Output is correct
11 Correct 479 ms 368 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 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 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 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 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 1 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 67 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 173 ms 340 KB Output is correct
24 Correct 181 ms 320 KB Output is correct
25 Correct 180 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 74 ms 340 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 72 ms 212 KB Output is correct
31 Correct 86 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 169 ms 320 KB Output is correct
36 Correct 179 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 321 ms 340 KB Output is correct
2 Correct 341 ms 364 KB Output is correct
3 Correct 569 ms 372 KB Output is correct
4 Correct 347 ms 360 KB Output is correct
5 Correct 523 ms 368 KB Output is correct
6 Correct 519 ms 368 KB Output is correct
7 Correct 530 ms 368 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 499 ms 372 KB Output is correct
13 Correct 490 ms 368 KB Output is correct
14 Correct 490 ms 368 KB Output is correct
15 Correct 537 ms 372 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 596 ms 372 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 496 ms 340 KB Output is correct
21 Correct 455 ms 372 KB Output is correct
22 Correct 1478 ms 372 KB Output is correct
23 Correct 1452 ms 372 KB Output is correct
24 Correct 1483 ms 372 KB Output is correct
25 Correct 479 ms 368 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 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 1 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 67 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 173 ms 340 KB Output is correct
49 Correct 181 ms 320 KB Output is correct
50 Correct 180 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 74 ms 340 KB Output is correct
54 Correct 1 ms 256 KB Output is correct
55 Correct 72 ms 212 KB Output is correct
56 Correct 86 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 169 ms 320 KB Output is correct
61 Correct 179 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 333 ms 340 KB Output is correct
64 Correct 343 ms 360 KB Output is correct
65 Correct 520 ms 372 KB Output is correct
66 Correct 326 ms 460 KB Output is correct
67 Correct 495 ms 380 KB Output is correct
68 Correct 488 ms 368 KB Output is correct
69 Correct 506 ms 368 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 492 ms 372 KB Output is correct
73 Correct 476 ms 372 KB Output is correct
74 Correct 514 ms 368 KB Output is correct
75 Correct 550 ms 460 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 477 ms 340 KB Output is correct
79 Correct 465 ms 372 KB Output is correct
80 Correct 1417 ms 368 KB Output is correct
81 Correct 1399 ms 368 KB Output is correct
82 Correct 1413 ms 372 KB Output is correct
83 Correct 467 ms 368 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 69 ms 320 KB Output is correct
86 Correct 435 ms 372 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 161 ms 320 KB Output is correct
90 Correct 162 ms 340 KB Output is correct
91 Correct 172 ms 340 KB Output is correct
92 Correct 1370 ms 372 KB Output is correct
93 Correct 1416 ms 368 KB Output is correct
94 Correct 1418 ms 460 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 566 ms 368 KB Output is correct
98 Correct 70 ms 212 KB Output is correct
99 Correct 497 ms 380 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 67 ms 212 KB Output is correct
102 Correct 67 ms 340 KB Output is correct
103 Correct 465 ms 372 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 165 ms 340 KB Output is correct
108 Correct 171 ms 340 KB Output is correct
109 Correct 1427 ms 368 KB Output is correct
110 Correct 1440 ms 368 KB Output is correct
111 Correct 1 ms 212 KB Output is correct