제출 #1178338

#제출 시각아이디문제언어결과실행 시간메모리
1178338vyaduct동굴 (IOI13_cave)C++20
0 / 100
13 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
#include "cave.h"

void exploreCave(int N) {
  int S[N], D[N];
  for (int i=0;i<N;i++){
    S[i] = 0;
    D[i] = i;
  }
  
  bool id=true;
  for (int i=0;i<N;i++){
    int ans = tryCombination(S);
    if (ans == i) S[i] = 1;
    else if (ans != i && ans != i+1 && ans != -1) {
      id = false;
      fill(S, S+N, 0);
      break;
    }
  }

  if (!id){
    for (int i=0;i<N;i++){
      S[i] = 1;
      D[i] = tryCombination(S);
      S[i] = 0;
    }
  }
  answer(S, D);
}
#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...