Submission #1351142

#TimeUsernameProblemLanguageResultExecution timeMemory
1351142cpismayilmmdv985Cave (IOI13_cave)C++20
46 / 100
4 ms520 KiB
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;

void exploreCave(int N) {
   int S[N], D[N];
   for (int i = 0; i < N; i++)   S[i] = 0, D[i] = -1;
   vector<int> guest(N, -1);
   while (true) {
      bool flag = true;
      for (int i = 0; i < N; i++)   if (D[i] == -1) {
         flag = false;
         break;
      }
      if (flag)   break;
      int curr = tryCombination(S);
      // cout << curr << '\n';
      // for (int i = 0; i < N; i++)   cerr << S[i] << ' ';
      // cout << '\n';
      // for (int i = 0; i < N; i++)   cerr << D[i] << ' ';
      // cout << "\n\n";
      for (int i = 0; i < N; i++) {
         if (D[i] != -1)   continue;
         if (curr == -1) {
            S[i] = 1;
            int X = tryCombination(S);
            D[i] = X, S[i] = 0, guest[i] = -1;
            continue;
         }
         if (guest[i] != -1 && guest[i] > curr) continue;
         S[i] = 1;
         int X = tryCombination(S); 
         if (X == -1)   D[i] = curr, curr = -1, guest[i] = -1;
         else {
            if (X > curr)        D[i] = curr, curr = X, S[i] = 1, guest[i] = -1;
            else if (X < curr)   D[i] = X, S[i] = 0, guest[i] = -1;
            else                 S[i] = 0, guest[i] = curr;
         }
      }
   }
   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...