Submission #339074

#	Time	Username	Problem	Language	Result	Execution time	Memory
339074		markussie	Cave (IOI13_cave)	C++17	13 / 100	139 ms	492 KiB

cave

#include "cave.h"
#include <vector>
#include <algorithm>

using namespace std;

const int mxn = 5e3;

void exploreCave(int n)
{
  vector<int> to(n, -1);
  vector<int> pos(n, -1);

  for(int i = 0; i < n; ++i)
    {
      vector<int> attemp(n, 0);
      for(int j = 0; j < n; ++j)
	if(pos[j] != -1)
	  attemp[j] = pos[j];
      int opened = tryCombination(attemp.data());
      int type = -1;
      if(opened == -1)
	{
	  pos = attemp;
	  break;
	}
      else
	type = opened == i;
      
      int l = 0, r = n;
      while(r - l > 1)
	{
	  int mid = (l + r) / 2;
	  for(int j = l; j < r; ++j)
	    if(pos[j] != -1)
	      attemp[j] = pos[j];
	    else
	      attemp[j] = type ^ (j >= mid);

	  opened = tryCombination(attemp.data());
	  if(opened == -1)
	    {
	      pos = attemp;
	      break;
	    }
	  if(opened == i)
	    l = mid;
	  else
	    r = mid;
	}
      pos[l] = type;
      to[l] = i;
     }
  
  for(int i = 0; i < n; ++i)
    {
      if(to[i] == -1)
	{
	  pos[i] = pos[i] ^ 1;
	  to[i] = tryCombination(pos.data());
	  pos[i] = pos[i] ^ 1;
	}
    }
  answer(pos.data(), to.data());
}

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