Submission #729481

#	Time	Username	Problem	Language	Result	Execution time	Memory
729481		NeroZein	동굴 (IOI13_cave)	C++17	25 / 100	42 ms	400 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; 
  } 
  for (int i = 0; i < n; ++i) {
    int x = tryCombination(a); 
    a[i] = 1; 
    int y = tryCombination(a); 
    if ((y > x && x != -1) || y == -1) {
      continue;
    } else {
      a[i] = 0; 
    }
  }
  int d[n];
  for (int i = 0; i < n; ++i) {
    d[i] = 0; 
  }
  for (int i = 0; i < n; ++i) {
    a[i] ^= 1; 
    int x = tryCombination(a); 
    d[i] = x; 
    a[i] ^= 1; 
  }
  answer(a, d);
}

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