Submission #777594

#TimeUsernameProblemLanguageResultExecution timeMemory
777594AkibAzmainCave (IOI13_cave)C++17
13 / 100
12 ms432 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void
exploreCave (int n)
{
  //// subtask 1
  // vector < int > a (n), b (n);
  // for (int i = tryCombination (a.data ()); i != -1; i = tryCombination (a.data ()))
  //   a[i] = !a[i];
  // for (int i = 0; i < n; ++i) b[i] = i;
  // answer (a.data (), b.data ());
  //// subtask 2
  vector < int > a (n), b (n);
  for (int i = 0; i < n; ++i)
    {
      a[i] = 1;
      b[i] = tryCombination (&a[0]);
      a[i] = 0;
    }
  answer (&a[0], &b[0]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...