제출 #724240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
724240		Bobonbush	동굴 (IOI13_cave)	C++17	100 / 100	868 ms	588 KiB

cave

#include<cave.h>
#include <bits/stdc++.h>
#define foreach for
#define in :
using namespace std;
typedef long long ll;
const int MODULO = 1e9+7;
const ll INF = 1e18+1;
template<class X ,class Y>
    bool Minimize(X &x , Y y)
    {
        if(x > y)
        {
            x = y ;
            return true;
        }
        return false;
    }
template<class X ,class Y>
    bool Maximize(X &x , Y y )
    {
        if(x < y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X ,class Y>
    void Add(X &x , Y y)
    {
        x += y;
        if( x >= MODULO) x -= MODULO;
    }
template<class X ,class Y>
    void Sub(X &x , Y y )
    {
        x -= y ;
        if( x < 0 ) x += MODULO;
    }
void exploreCave(int n)
{
    int status[n] ;
    int related[n];
    for(int i = 0 ; i < n ; i++)
    {
        related[i] = 0;
        status[i] = 0;
    }
    vector<int>List;
    for(int i = 0 ; i < n ; i++)List.push_back(i);
    for(int i = 0 ; i < n ; i++)
    {
        foreach(int v in List)status[v] = 0;
        if(tryCombination(status) != i)foreach(int v in List)status[v] = 1;
        int l = 0 ;
        int r = (int)List.size()-1;
        while(l <= r)
        {
            int mid = (l+r) >> 1;
            for(int i = 0 ; i <= mid ; i++)
            {
                status[List[i]] ^= 1;
            }
            int x = tryCombination(status);
            for(int i = 0 ; i <= mid ;i++)
            {
                status[List[i]] ^= 1;
            }
            if(x == i)l = mid+1;
            else r = mid-1;
        }
        int pos = List[l];
        swap(List[l] , List.back());
        List.pop_back();
        status[pos] ^=1;
        related[pos] = i;
    }
    answer(status , related);
}

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