제출 #777589

#제출 시각아이디문제언어결과실행 시간메모리
777589AkibAzmainCave (IOI13_cave)C++17
12 / 100
8 ms360 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 ());
}
#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...