oj.uz

Submission #291184

# Submission time Handle Problem Language Result Execution time Memory
291184 2020-09-04T20:30:44 Z Ruba_K Cave (IOI13_cave) C++14
0 / 100
 524 ms 504 KB 
#include "cave.h"
#include<bits/stdc++.h>
using namespace std ;

void exploreCave(int N) {
    int constant[N] , arr[N] , pos[N];
    memset(constant , 0 , sizeof constant);

    for(int i = 0 ; i < N ; i ++)
        arr[i] = i % 2 ;


    for(int i = 0 ; i < N ; i ++){
        int ret = tryCombination(arr);
        if(ret != i){
            for(int j = 0 ; j < N ; j ++){
                if(constant[j])continue ;
                arr[j] = (arr[j] + 1 ) % 2 ;
            }
        }
        int l = 0 , r = N - 1 , md ;
        while(l < r){
            md = (l + r) / 2 ;

            int check[N];
            for(int j = 0 ; j < N ; j ++){
                if(constant[j])continue ;

                check[j] = (j >= l && j <= md ? arr[j] : arr[j] ^ 1);
            }
            ret = tryCombination(check);
            if(ret == i)r = md ;
            else l = md + 1 ;
        }
        constant[l] = 1 ;
        arr[l] ^= 1 ;
        pos[l] = i ;

    }
    answer(arr , pos);

}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 256 KB Answer is wrong
5 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Incorrect 0 ms 256 KB Answer is wrong
5 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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