제출 #965295

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
965295	2024-04-18 09:49:27	IBory	동굴 (IOI13_cave)	C++17	12 / 100	241 ms	624 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX = 5005;
int C[MAX], S[MAX], D[MAX];
void exploreCave(int N) {
  for (int n = 0; n < N; ++n) {
    memset(C, 0x3f, sizeof(C));
    vector<int> cand;
    for (int p = 0; p < n; ++p) C[D[p]] = S[D[p]];
    for (int i = 0; i < N; ++i) {
      if (1e9 < C[i]) {
        cand.push_back(i);
        C[i] = 0;
      }
    }
    
    int init = tryCombination(C) != n;
    if (cand.size() == 1) {
      D[n] = cand[0];
      S[D[n]] = !init;
      break;
    }
    int l = -1, r = cand.size() - 1;
    while (l + 1 < r) {
      int mid = (l + r) >> 1;
      for (int i = 0; i <= mid; ++i) C[cand[i]] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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