Submission #1142390

#TimeUsernameProblemLanguageResultExecution timeMemory
1142390vyaductCave (IOI13_cave)C++20
0 / 100
1 ms328 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

// Max Call tryComb() 70'000

// int tryCombination(int S[])
// void answer(int S[], int D[]);

void exploreCave(int N) {
  int S[N], D[N];
  memset(S, 0, N * sizeof(int));
  for (int i=0;i<N;i++){
    D[i] = i;
    S[i] = 0;
    int ans = tryCombination(S);
    if (ans == -1) S[i] = 1;
    else 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...