oj.uz

Submission #954451

# Submission time Handle Problem Language Result Execution time Memory
954451 2024-03-28T00:25:57 Z __Davit__ Cave (IOI13_cave) C++17
13 / 100
 24 ms 604 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
}

void exploreCave(int N) {
    int a[N];
    for (int i = 0; i < N; i++)a[i] = 0;
    int x = tryCombination(a);
    while (x != -1) {
        int ina = 0, inb = N - 1, ans;
        while (ina <= inb) {
            int mid = (ina + inb) >> 1;
            for (int i = 0; i <= mid; i++)a[i] ^= 1;
            int y = tryCombination(a);
            if (x != y) {
                inb = mid - 1;
                ans = mid;
            } else {
                ina = mid + 1;
            }
            for (int i = 0; i <= mid; i++)a[i] ^= 1;
        }
        a[ans] ^= 1;
        x = tryCombination(a);
    }


    int b[N];
    for (int i = 0; i < N; i++) {
        a[i] ^= 1;
        int x = tryCombination(a);
        a[i] ^= 1;
        b[i] = x;
    }
    answer(a, b);
}

Compilation message

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:27:16: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   27 |         a[ans] ^= 1;
      |         ~~~~~~~^~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 344 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 9 ms 528 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 8 ms 348 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 344 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -