제출 #729468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
729468		NeroZein	동굴 (IOI13_cave)	C++17	13 / 100	17 ms	428 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std; 
 
const int N = 5005;
 
bool vis[N];
 
void exploreCave(int N_) {
  int n;
  n = N_;
  int a[n]; 
  for (int i = 0; i < n; ++i) {
    a[i] = 0; 
  } 
  int x = tryCombination(a); 
  while (x != -1) {
    //cout << x << '\n';
    //for (int i = 0; i < n; ++i) {
      //cout << a[i] << ' ';
    //}
    //cout << '\n'; 
    //for (int i = 0; i < n; ++i) {
      //if (vis[i]) continue; 
      //a[i] ^= 1; 
      //int y = tryCombination(a); 
      //if (y > x || y == -1) {
        //vis[i] = true; 
        //if (i == 0) {
          //cout << x << '\n'; 
          //cout << "ZZZ" << '\n';
          //exit(0);
        //}
        //x = y; 
        //break;
      //}
      //else if (y < x) {
        //vis[i] = true;
        //if (i == 0) {
          //cout << "ZZZZ55" << '\n';
          //exit(0);
        //}
        //a[i] ^= 1; 
        //break;
      //} else {
        //a[i] ^= 1; 
      //}
    //}
    
  }
  int d[n];
  for (int i = 0; i < n; ++i) {
    d[i] = 0; 
  }
  for (int i = 0; i < n; ++i) {
    a[i] ^= 1; 
    x = tryCombination(a); 
    d[i] = x; 
    a[i] ^= 1; 
  }
  answer(a, d);
}

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