Submission #390859

#	Time	Username	Problem	Language	Result	Execution time	Memory
390859		jampm	Cave (IOI13_cave)	C++17	34 / 100	61 ms	452 KiB

cave

#include "cave.h"

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

//Sub-Tarea 5 (?)

void exploreCave(int N) {
  int S[N], D[N]; int last = 0; bool vis[N];
  for (int i = 0; i < N; i++) { 
    S[i] = 0; vis[i] = false;
  }
  last = tryCombination(S);
  while (last != -1) {
    for (int i = 0; i < N; i++) {
      if (vis[i]) continue;
      S[i] = (S[i] - 1)*(S[i] - 1);
      int aux = tryCombination(S);
      if (aux > last || aux == -1) {
        last = aux;
        break;
      }
      if (aux < last) vis[i] = false;
      S[i] = (S[i] - 1)*(S[i] - 1);
    }
  }
  for (int i = 0; i < N; i++) {
    S[i] = (S[i] - 1)*(S[i] - 1);
    D[i] = tryCombination(S);
    S[i] = (S[i] - 1)*(S[i] - 1);
  }
  answer(S, D);
}

• Subtask 1: 0 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24