oj.uz

Submission #968702

# Submission time Handle Problem Language Result Execution time Memory
968702 2024-04-23T21:20:30 Z __Davit__ Cave (IOI13_cave) C++17
0 / 100
 14 ms 348 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

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

    answer(a, b);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 348 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -