Submission #418426

#	Time	Username	Problem	Language	Result	Execution time	Memory
418426		iulia13	Cave (IOI13_cave)	C++14	100 / 100	317 ms	568 KiB

cave

#include <iostream>
#include "cave.h"
using namespace std;
const int N = 5005;
int s[N];
int fixat[N];
int button[N];
int door[N];
int S[N], D[N];
int nn;
void exploreCave(int n)
{
    int i;
    nn = n;
    for (int curr = 0; curr < n; curr++)
    {
        int key = 1;
        for (i = 0; i < n; i++)
        {
            if (fixat[i])
                s[i] = fixat[i] - 1;
            else
                s[i] = 1;
        }
        if (tryCombination(s) == curr)
        {
            for (i = 0; i < n; i++)
            {
                if (fixat[i])
                    s[i] = fixat[i] - 1;
                else
                    s[i] = 0;
            }
            key = 0;
        }
        int st = 0, dr = n - 1;
        while(st <= dr)
        {
            if (st == dr)
            {
                fixat[st] = s[st] + 1;
                button[st] = s[st];
                door[st] = curr;
                break;
            }
            int mid = (st + dr) / 2;
            for (i = st; i <= mid; i++)
                if (!fixat[i])
                    s[i] = 1 - key;
            if (tryCombination(s) == curr)
            {
                for (i = st; i <= mid; i++)
                    if (!fixat[i])
                        s[i] = key;
                dr = mid;
            }
            else
                st = mid + 1;
        }
    }
    answer(button, door);
}

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