Submission #757583

#	Time	Username	Problem	Language	Result	Execution time	Memory
757583		KALARRY	Cave (IOI13_cave)	C++14	0 / 100	1 ms	340 KiB

cave

//chockolateman

#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

void exploreCave(int N)
{
    int seq[N];
    int ans[N];
    for(int i =0 ; i < N ; i++)
        seq[i] = 0;
    bool used[N];
    for(int i = 0  ; i < N ; i++)
        used[i] = false;
    for(int i = 0 ; i < N ; i++)
    {
        int res = tryCombination(seq);
        if(res>i||res==-1)
        {
            for(int i = 0 ; i < N ; i++)
                if(!used[i])
                {
                    if(seq[i])
                        seq[i] = 0;
                    else
                        seq[i] = 1;
                }            
        }
        int low = 0;
        int high  = N-1;
        while(high > low)
        {
            int mid = (low+high)/2;
            for(int i = 0 ; i <= mid; i++)
            {
                if(!used[i])
                {
                    if(seq[i])
                        seq[i] = 0;
                    else
                        seq[i] = 1;
                }
            }
            res = tryCombination(seq);
            if(res>i||res==-1)
                high = mid;
            else
                low = mid;
            for(int i = 0 ; i <= mid; i++)
            {
                if(!used[i])
                {
                    if(seq[i])
                        seq[i] = 0;
                    else
                        seq[i] = 1;
                }
            }
        }
        if(seq[low])
            seq[low] = 0;
        else
            seq[low] = 1;
        used[low] = true;
        ans[i] = low;
        answer(seq,ans);
    }
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24