Submission #992966

#	Time	Username	Problem	Language	Result	Execution time	Memory
992966		lacito	Cave (IOI13_cave)	C++14	0 / 100	46 ms	344 KiB

cave

#include"cave.h"
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
//#define f first
//#define s second
using namespace std;

void exploreCave(int n)
{
    int s[n],d[n];
    for (int i=0; n>i; i++)
    {
        s[i] = 0;
        d[i] = -1;
    }
    for (int i=0; n>i; i++)
    {
        if (tryCombination(s) != i)
        {
            for (int j=0; n>j; j++)
            {
                if (d[j] != -1)
                    continue;
                s[j] ^= 1;
            }
        }
        int l = 0 , r = n - 1;
        int mid = (l + r) / 2;
        int f = s[i];
        while (l < r)
        {
            mid = (l + r) / 2;
            for (int j=l; mid>=j; j++)
            {
                if (d[j] != -1)
                    continue;
                s[j] ^= 1;
            }
            int l1=l;
            if (tryCombination(s) != i)
            {
                r = mid;
                f ^= 1;
            }
            else
            {
                l = mid + 1;
            }
            for (int j=l1; mid>=j; j++)
            {
                if (d[j] != -1)
                    continue;
                s[j] ^= 1;
            }
        }
        s[i] = f;
        d[l] = i;
    }
    answer(s , d);
}

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