oj.uz

Submission #927044

# Submission time Handle Problem Language Result Execution time Memory
927044 2024-02-14T07:36:00 Z Art_ogo Cave (IOI13_cave) C++17
0 / 100
 199 ms 544 KB 
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int S[N];
    int D[N];
    bool ok[N];
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++)
            if(!ok[j])
                S[j] = 0;
        int ans = tryCombination(S);
        if(ans == i)
            for(int j = 0; j < N; j++)
                if(!ok[j])
                    S[j] = 1;
        int l = 0, r = N - 1;
        while(l < r){
            int mid = (l + r) >> 1;
            for(int j = l; j <= mid; j++)
                if(!ok[j])
                    S[j] = 1 - S[j];
            ans = tryCombination(S);
            if(ans == i)
                r = mid;
            else l = mid + 1;
            for(int j = l; j <= mid; j++)
                if(!ok[j])
                    S[j] = 1 - S[j];
        }
        ok[l] = 1;
        D[l] = i;
    }
    answer(S, D);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 528 KB Output is correct
2 Correct 124 ms 344 KB Output is correct
3 Correct 186 ms 348 KB Output is correct
4 Correct 126 ms 532 KB Output is correct
5 Correct 199 ms 544 KB Output is correct
6 Correct 151 ms 348 KB Output is correct
7 Correct 190 ms 540 KB Output is correct
8 Incorrect 0 ms 348 KB Answer is wrong
9 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 540 KB Output is correct
2 Incorrect 0 ms 348 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 528 KB Output is correct
2 Correct 124 ms 344 KB Output is correct
3 Correct 186 ms 348 KB Output is correct
4 Correct 126 ms 532 KB Output is correct
5 Correct 199 ms 544 KB Output is correct
6 Correct 151 ms 348 KB Output is correct
7 Correct 190 ms 540 KB Output is correct
8 Incorrect 0 ms 348 KB Answer is wrong
9 Halted 0 ms 0 KB -