oj.uz

Submission #569658

# Submission time Handle Problem Language Result Execution time Memory
569658 2022-05-27T15:20:19 Z joshjms Cave (IOI13_cave) C++14
100 / 100
 1145 ms 660 KB 
#include "cave.h"

#include <bits/stdc++.h>
using namespace std;

#define ld long double
#define pb push_back
#define fi first
#define se second
#define debug(x) cout << #x << " => " << x << "\n";

const long long mod = 1e9 + 7;

// #define MAX_N 5000
// #define MAX_CALLS 70000

// #define fail(s, x...) do { \
// 		fprintf(stderr, s "\n", ## x); \
// 		exit(1); \
// 	} while(0)

// /* Symbol obfuscation */
// #define N koala
// #define realS kangaroo
// #define realD possum
// #define inv platypus
// #define num_calls echidna

// static int N;
// static int realS[MAX_N];
// static int realD[MAX_N];
// static int inv[MAX_N];
// static int num_calls;

// void answer(int S[], int D[]) {
//     int i;
//     int correct = 1;
//     for (i = 0; i < N; ++i)
//         if (S[i] != realS[i] || D[i] != realD[i]) {
//             correct = 0;
//             break;
//         }

//     if (correct)
//         printf("CORRECT\n");
//     else
//         printf("INCORRECT\n");

//     for (i = 0; i < N; ++i) {
//         if (i > 0)
//             printf(" ");
//         printf("%d", S[i]);
//     }
//     printf("\n");

//     for (i = 0; i < N; ++i) {
//         if (i > 0)
//             printf(" ");
//         printf("%d", D[i]);
//     }
//     printf("\n");

//     exit(0);
// }

// int tryCombination(int S[]) {
//     int i;

//     if (num_calls >= MAX_CALLS) {
//         printf("INCORRECT\nToo many calls to tryCombination().\n");
//         exit(0);
//     }
//     ++num_calls;

//     for (i = 0; i < N; ++i)
//         if (S[inv[i]] != realS[inv[i]])
//             return i;
//     return -1;
// }

// int init() {
//     int i, res;

// 	res = scanf("%d", &N);

//     for (i = 0; i < N; ++i) {
//         res = scanf("%d", &realS[i]);
//     }
//     for (i = 0; i < N; ++i) {
//         res = scanf("%d", &realD[i]);
//         inv[realD[i]] = i;
//     }

//     num_calls = 0;
//     return N;
// }

int n, a[100000], c[100000], x[100000], v[100000], p[100000];

void exploreCave(int N) {
    n = N;

    for(int i = 0; i < n; i++) {

        for(int j = 0; j < n; j++)
            if(!v[j]) a[j] = 0;

        int X = tryCombination(a);
        if(X == -1) X = n;

        // for(int j = 0; j < n; j++)
        //     cout << a[j] << " ";
        // cout << "\n";

        // debug(X);

        int u = (X > i ? 0 : 1);

        int l = 0, r = n - 1;

        while(l <= r) {
            int mid = (l + r) / 2;

            for(int j = 0; j < n; j++) {
                if(v[j]) continue;
                if(j < l || j > r) a[j] = u ^ 1;
                else if(j <= mid) a[j] = u;
                else a[j] = u ^ 1;
            }

            // for(int j = 0; j < n; j++)
            //     cout << a[j] << " ";
            // cout << "\n";

            int Y = tryCombination(a);
            if(Y == -1) Y = n;

            // debug(Y);

            if(Y > i) r = mid - 1, c[i] = mid;
            else l = mid + 1;
        }

        // debug(c[i]);
        
        a[c[i]] = u;
        v[c[i]] = 1;
    }

    // for(int i = 0; i < n; i++)
    //     cout << c[i] << " ";
    // cout << "\n";

    for(int i = 0; i < n; i++)
        p[c[i]] = i;

    answer(a, p);
}

// int main() {
//     int N;
// 	N = init();
// 	exploreCave(N);
//     printf("INCORRECT\nYour solution did not call answer().\n");
// 	return 0;
// }

Compilation message

cave.cpp:17:1: warning: multi-line comment [-Wcomment]
   17 | // #define fail(s, x...) do { \
      | ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 392 KB Output is correct
2 Correct 315 ms 404 KB Output is correct
3 Correct 480 ms 412 KB Output is correct
4 Correct 309 ms 412 KB Output is correct
5 Correct 442 ms 396 KB Output is correct
6 Correct 436 ms 400 KB Output is correct
7 Correct 505 ms 388 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 1 ms 212 KB Output is correct
12 Correct 452 ms 400 KB Output is correct
13 Correct 446 ms 416 KB Output is correct
14 Correct 456 ms 396 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 396 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 522 ms 416 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 511 ms 528 KB Output is correct
7 Correct 460 ms 508 KB Output is correct
8 Correct 1135 ms 420 KB Output is correct
9 Correct 1145 ms 532 KB Output is correct
10 Correct 1131 ms 536 KB Output is correct
11 Correct 467 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 64 ms 352 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 144 ms 356 KB Output is correct
24 Correct 139 ms 356 KB Output is correct
25 Correct 138 ms 356 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 71 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 93 ms 348 KB Output is correct
31 Correct 62 ms 364 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 137 ms 356 KB Output is correct
36 Correct 140 ms 360 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 286 ms 392 KB Output is correct
2 Correct 315 ms 404 KB Output is correct
3 Correct 480 ms 412 KB Output is correct
4 Correct 309 ms 412 KB Output is correct
5 Correct 442 ms 396 KB Output is correct
6 Correct 436 ms 400 KB Output is correct
7 Correct 505 ms 388 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 1 ms 212 KB Output is correct
12 Correct 452 ms 400 KB Output is correct
13 Correct 446 ms 416 KB Output is correct
14 Correct 456 ms 396 KB Output is correct
15 Correct 492 ms 396 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 522 ms 416 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 511 ms 528 KB Output is correct
21 Correct 460 ms 508 KB Output is correct
22 Correct 1135 ms 420 KB Output is correct
23 Correct 1145 ms 532 KB Output is correct
24 Correct 1131 ms 536 KB Output is correct
25 Correct 467 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 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 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 64 ms 352 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 144 ms 356 KB Output is correct
49 Correct 139 ms 356 KB Output is correct
50 Correct 138 ms 356 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 71 ms 340 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 93 ms 348 KB Output is correct
56 Correct 62 ms 364 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 137 ms 356 KB Output is correct
61 Correct 140 ms 360 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 400 ms 636 KB Output is correct
64 Correct 338 ms 384 KB Output is correct
65 Correct 479 ms 516 KB Output is correct
66 Correct 320 ms 408 KB Output is correct
67 Correct 505 ms 516 KB Output is correct
68 Correct 491 ms 408 KB Output is correct
69 Correct 524 ms 396 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 492 ms 396 KB Output is correct
73 Correct 471 ms 340 KB Output is correct
74 Correct 460 ms 400 KB Output is correct
75 Correct 513 ms 416 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 445 ms 400 KB Output is correct
79 Correct 442 ms 404 KB Output is correct
80 Correct 1040 ms 536 KB Output is correct
81 Correct 1065 ms 412 KB Output is correct
82 Correct 1052 ms 408 KB Output is correct
83 Correct 431 ms 520 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 59 ms 360 KB Output is correct
86 Correct 412 ms 380 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 132 ms 356 KB Output is correct
90 Correct 127 ms 364 KB Output is correct
91 Correct 128 ms 340 KB Output is correct
92 Correct 1035 ms 412 KB Output is correct
93 Correct 1020 ms 536 KB Output is correct
94 Correct 999 ms 660 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 455 ms 520 KB Output is correct
98 Correct 59 ms 340 KB Output is correct
99 Correct 413 ms 396 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 56 ms 360 KB Output is correct
102 Correct 57 ms 360 KB Output is correct
103 Correct 385 ms 412 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 128 ms 356 KB Output is correct
108 Correct 122 ms 348 KB Output is correct
109 Correct 1000 ms 464 KB Output is correct
110 Correct 1036 ms 540 KB Output is correct
111 Correct 0 ms 212 KB Output is correct