Submission #1024437

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024437		ZHIRDILBILDIZ	Cave (IOI13_cave)	C++14	100 / 100	248 ms	1064 KiB

cave

#include<bits/stdc++.h>
#include"cave.h"
using namespace std ;
void exploreCave(int N)
{
    vector<int> un_us, us;
    int S[N], D[N] ;
    for(int i = 0 ; i < N ; i++)
        un_us.push_back(i), D[i] = 0 ;
    for(int i = 0 ; i < N ; i++)
    {
        for(int j : un_us)
            S[j] = 0 ;
        int trycomb = tryCombination(S);
        if(trycomb == i)
        {
            int l = -1, r = un_us.size() ;
            while(l + 1 < r)
            {
                int mid = (l + r) >> 1 ;
                for(int j = 0 ; j <= mid ; j++)
                    S[un_us[j]] = 1 ;
                if(tryCombination(S) == i)l = mid ;
                else r = mid ;
                for(int j = 0 ; j <= mid ; j++)
                    S[un_us[j]] = 0 ;
            }
            us.push_back(un_us[r]) ;
            un_us.erase(r + un_us.begin()) ;
            D[us.back()] = i ;
            S[us.back()] = 1 ;
        }
        else
        {
            int l = -1, r = un_us.size() ;
            while(l + 1 < r)
            {
                int mid = (l + r) >> 1 ;
                for(int j = 0 ; j <= mid ; j++)
                    S[un_us[j]] = 1 ;
                if(tryCombination(S) == i)r = mid ;
                else l = mid ;
                for(int j = 0 ; j <= mid ; j++)
                    S[un_us[j]] = 0 ;
            }
            us.push_back(un_us[r]) ;
            un_us.erase(r + un_us.begin()) ;
            D[us.back()] = i ;
            S[us.back()] = 0 ;
        }
    }
    answer(S, D) ;
}

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