답안 #468952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468952 2021-08-30T09:29:03 Z Soumya1 동굴 (IOI13_cave) C++14
100 / 100
862 ms 460 KB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
  int pos[n], state[n];
  int s[n] = {0};
  // int cur = tryCombination(s);
  // if (cur == 0) {
  //   for (int i = 0; i < n; i++) {
  //     s[i] = 1;
  //     if (tryCombination(s) > 0) {
  //       pos[0] = i;
  //       state[i] = 1;
  //       break;
  //     }
  //     s[i] = 0;
  //   }
  // } else {
  //   for (int i = 0; i < n; i++) {
  //     s[i] = 1;
  //     if (tryCombination(s) == 0) {
  //       pos[0] = i;
  //       state[i] = 0;
  //       break;
  //     }
  //     s[i] = 0;
  //   }
  // }
  for (int i = 0; i < n; i++) {
    int cur = tryCombination(s);
    int l = 0, r = n - 1;
    if (cur == i) {
      while (l < r) {
        int m = (l + r) >> 1;
        int ss[n];
        for (int j = 0; j < n; j++) ss[j] = s[j];
        for (int j = 0; j <= m; j++) ss[j] ^= 1;
        for (int j = 0; j < i; j++) ss[pos[j]] = state[j];
        if (tryCombination(ss) != i) {
          r = m;
        } else {
          l = m + 1;
        }
      }
      pos[i] = l;
      state[i] = s[l] ^ 1;
      s[l] ^= 1;
    } else {
      while (l < r) {
        int m = (l + r) >> 1;
        int ss[n];
        for (int j = 0; j < n; j++) ss[j] = s[j];
        for (int j = 0; j <= m; j++) ss[j] ^= 1;
        for (int j = 0; j < i; j++) ss[pos[j]] = state[j];
        if (tryCombination(ss) == i) {
          r = m;
        } else {
          l = m + 1;
        }
      }
      pos[i] = l;
      state[i] = s[l];
    }
  }
  int d[n];
  for (int i = 0; i < n; i++) {
    d[pos[i]] = i;
    s[pos[i]] = state[i];
  }
  answer(s, d);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 500 ms 452 KB Output is correct
2 Correct 486 ms 412 KB Output is correct
3 Correct 761 ms 436 KB Output is correct
4 Correct 512 ms 452 KB Output is correct
5 Correct 813 ms 436 KB Output is correct
6 Correct 759 ms 436 KB Output is correct
7 Correct 819 ms 452 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 754 ms 440 KB Output is correct
13 Correct 788 ms 436 KB Output is correct
14 Correct 785 ms 436 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 822 ms 404 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 784 ms 404 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 830 ms 400 KB Output is correct
7 Correct 788 ms 404 KB Output is correct
8 Correct 839 ms 404 KB Output is correct
9 Correct 862 ms 404 KB Output is correct
10 Correct 842 ms 396 KB Output is correct
11 Correct 773 ms 400 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 115 ms 348 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 110 ms 332 KB Output is correct
24 Correct 109 ms 360 KB Output is correct
25 Correct 113 ms 344 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 114 ms 348 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 109 ms 344 KB Output is correct
31 Correct 108 ms 332 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 111 ms 348 KB Output is correct
36 Correct 112 ms 360 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 500 ms 452 KB Output is correct
2 Correct 486 ms 412 KB Output is correct
3 Correct 761 ms 436 KB Output is correct
4 Correct 512 ms 452 KB Output is correct
5 Correct 813 ms 436 KB Output is correct
6 Correct 759 ms 436 KB Output is correct
7 Correct 819 ms 452 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 754 ms 440 KB Output is correct
13 Correct 788 ms 436 KB Output is correct
14 Correct 785 ms 436 KB Output is correct
15 Correct 822 ms 404 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 784 ms 404 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 830 ms 400 KB Output is correct
21 Correct 788 ms 404 KB Output is correct
22 Correct 839 ms 404 KB Output is correct
23 Correct 862 ms 404 KB Output is correct
24 Correct 842 ms 396 KB Output is correct
25 Correct 773 ms 400 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 292 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 115 ms 348 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 110 ms 332 KB Output is correct
49 Correct 109 ms 360 KB Output is correct
50 Correct 113 ms 344 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 114 ms 348 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 109 ms 344 KB Output is correct
56 Correct 108 ms 332 KB Output is correct
57 Correct 1 ms 296 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 111 ms 348 KB Output is correct
61 Correct 112 ms 360 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 487 ms 452 KB Output is correct
64 Correct 496 ms 452 KB Output is correct
65 Correct 776 ms 436 KB Output is correct
66 Correct 515 ms 420 KB Output is correct
67 Correct 818 ms 452 KB Output is correct
68 Correct 765 ms 332 KB Output is correct
69 Correct 817 ms 440 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 751 ms 436 KB Output is correct
73 Correct 758 ms 436 KB Output is correct
74 Correct 754 ms 440 KB Output is correct
75 Correct 814 ms 440 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 829 ms 432 KB Output is correct
79 Correct 771 ms 436 KB Output is correct
80 Correct 837 ms 332 KB Output is correct
81 Correct 843 ms 436 KB Output is correct
82 Correct 851 ms 432 KB Output is correct
83 Correct 808 ms 460 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 107 ms 360 KB Output is correct
86 Correct 779 ms 436 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 112 ms 348 KB Output is correct
90 Correct 112 ms 344 KB Output is correct
91 Correct 110 ms 440 KB Output is correct
92 Correct 851 ms 436 KB Output is correct
93 Correct 826 ms 436 KB Output is correct
94 Correct 832 ms 440 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 778 ms 448 KB Output is correct
98 Correct 107 ms 332 KB Output is correct
99 Correct 757 ms 432 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 109 ms 356 KB Output is correct
102 Correct 123 ms 364 KB Output is correct
103 Correct 757 ms 436 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 296 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 111 ms 356 KB Output is correct
108 Correct 113 ms 356 KB Output is correct
109 Correct 835 ms 436 KB Output is correct
110 Correct 825 ms 460 KB Output is correct
111 Correct 1 ms 204 KB Output is correct