Submission #456193

#	Time	Username	Problem	Language	Result	Execution time	Memory
456193		fuad27	Cave (IOI13_cave)	C++14	34 / 100	44 ms	384 KiB

cave

    #include "cave.h"
	#include<bits/stdc++.h>
	using namespace std;
    void exploreCave(int N) {
      int S[N], D[N]; int l = 0;
      for (int i = 0; i < N; i++) S[i] = 0;
      while (l != -1) {
        l = tryCombination(S);
        for (int i = 0; i < N; i++) {
          S[i] = (S[i] - 1)*(S[i] - 1);
          int a = tryCombination(S);
          if (a > l || a == -1) {
            l = a;
            break;
          }
          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