oj.uz

Submission #950384

# Submission time Handle Problem Language Result Execution time Memory
950384 2024-03-20T09:06:53 Z kilkuwu Cave (IOI13_cave) C++11
100 / 100
 258 ms 820 KB 
#ifdef LOCAL
int tryCombination(int S[]);
void answer(int S[], int D[]);
void exploreCave(int N);
#else 
#include "cave.h"
#endif

#ifdef LOCAL
#include "template\debug.hpp"
#else
#define dbg(...) ;
#define timer(...) ;
#endif

#include <bits/stdc++.h>

constexpr int mxN = 5000;
int s[mxN], d[mxN], ord[mxN];
int _n;

int ask_switched(int p) {
  for (int i = p; i < _n; i++) {
    s[ord[i]] ^= 1;
  }
  int res = tryCombination(s); 
  for (int i = p; i < _n; i++) {
    s[ord[i]] ^= 1;
  }
  if (res == -1) res = _n;
  return res;
}

/*

opened = 0 
2
0 0 
1 0 

 */

void exploreCave(int N) {
  _n = N;
  for (int i = 0; i < N; i++) ord[i] = i;
  for (int i = 0; i < N; i++) {
    int opened = tryCombination(s);
    if (opened == -1) opened = N;
    int is_open = opened > i; // opened >= i anyway
    if (is_open) {
      // find first switch to make it close
      int lb = i, rb = N - 1;
      while (lb < rb) {
        int mid = (lb + rb + 1) / 2;

        if (ask_switched(mid) <= i) {
          lb = mid;
        } else {
          rb = mid - 1;
        }
      }

      d[ord[lb]] = i;
      std::swap(ord[lb], ord[i]);
    } else {
      int lb = i, rb = N - 1;
      while (lb < rb) {
        int mid = (lb + rb + 1) / 2;

        if (ask_switched(mid) > i) {
          lb = mid;
        } else {
          rb = mid - 1;
        }
      }

      d[ord[lb]] = i;
      std::swap(ord[lb], ord[i]);
      
      // we gotta swap this 

      s[ord[i]] ^= 1;
    }
  }

  answer(s, d);
}

#ifdef LOCAL
#include <stdio.h>
#include <stdlib.h>

#define MAX_N 5000
#define MAX_CALLS 70000

#define fail(s, x...) do { \
  fprintf(stderr, s "\n", ## x); \
  exit(1); \
} while(0)

/* Symbol obfuscation */
#define N koala
#define realS kangaroo
#define realD possum
#define inv platypus
#define num_calls echidna

static int N;
static int realS[MAX_N];
static int realD[MAX_N];
static int inv[MAX_N];
static int num_calls;

void answer(int S[], int D[]) {
  int i;
  int correct = 1;
  for (i = 0; i < N; ++i)
    if (S[i] != realS[i] || D[i] != realD[i]) {
      correct = 0;
      break;
    }

  if (correct)
    printf("CORRECT\n");
  else
    printf("INCORRECT\n");

  for (i = 0; i < N; ++i) {
    if (i > 0)
      printf(" ");
    printf("%d", S[i]);
  }
  printf("\n");

  for (i = 0; i < N; ++i) {
    if (i > 0)
      printf(" ");
    printf("%d", D[i]);
  }
  printf("\n");

  exit(0);
}

int tryCombination(int S[]) {
  int i;

  if (num_calls >= MAX_CALLS) {
    printf("INCORRECT\nToo many calls to tryCombination().\n");
    exit(0);
  }
  ++num_calls;

  for (i = 0; i < N; ++i)
    if (S[inv[i]] != realS[inv[i]])
      return i;
  return -1;
}

int init() {
  int i;

  std::cin >> N;

  for (i = 0; i < N; ++i) {
    std::cin >> realS[i];
  }
  for (i = 0; i < N; ++i) {
    std::cin >> realD[i];
    inv[realD[i]] = i;
  }

  num_calls = 0;
  return N;
}

int main() {
  int n;
  n = init();
  exploreCave(n);
  printf("incorrect\nyour solution did not call answer().\n");
  return 0;
}
#endif

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 344 KB Output is correct
2 Correct 142 ms 560 KB Output is correct
3 Correct 210 ms 568 KB Output is correct
4 Correct 144 ms 552 KB Output is correct
5 Correct 242 ms 600 KB Output is correct
6 Correct 258 ms 552 KB Output is correct
7 Correct 226 ms 560 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 214 ms 812 KB Output is correct
13 Correct 211 ms 348 KB Output is correct
14 Correct 211 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 592 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 201 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 229 ms 808 KB Output is correct
7 Correct 174 ms 560 KB Output is correct
8 Correct 181 ms 568 KB Output is correct
9 Correct 191 ms 344 KB Output is correct
10 Correct 175 ms 564 KB Output is correct
11 Correct 170 ms 560 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 21 ms 520 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 23 ms 348 KB Output is correct
24 Correct 28 ms 344 KB Output is correct
25 Correct 23 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 35 ms 512 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 21 ms 516 KB Output is correct
31 Correct 21 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 29 ms 496 KB Output is correct
36 Correct 29 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 344 KB Output is correct
2 Correct 142 ms 560 KB Output is correct
3 Correct 210 ms 568 KB Output is correct
4 Correct 144 ms 552 KB Output is correct
5 Correct 242 ms 600 KB Output is correct
6 Correct 258 ms 552 KB Output is correct
7 Correct 226 ms 560 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 214 ms 812 KB Output is correct
13 Correct 211 ms 348 KB Output is correct
14 Correct 211 ms 348 KB Output is correct
15 Correct 229 ms 592 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 201 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 229 ms 808 KB Output is correct
21 Correct 174 ms 560 KB Output is correct
22 Correct 181 ms 568 KB Output is correct
23 Correct 191 ms 344 KB Output is correct
24 Correct 175 ms 564 KB Output is correct
25 Correct 170 ms 560 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 21 ms 520 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 23 ms 348 KB Output is correct
49 Correct 28 ms 344 KB Output is correct
50 Correct 23 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 35 ms 512 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 21 ms 516 KB Output is correct
56 Correct 21 ms 348 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 29 ms 496 KB Output is correct
61 Correct 29 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 152 ms 348 KB Output is correct
64 Correct 136 ms 344 KB Output is correct
65 Correct 218 ms 556 KB Output is correct
66 Correct 139 ms 348 KB Output is correct
67 Correct 229 ms 344 KB Output is correct
68 Correct 211 ms 820 KB Output is correct
69 Correct 222 ms 344 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 216 ms 556 KB Output is correct
73 Correct 208 ms 348 KB Output is correct
74 Correct 234 ms 348 KB Output is correct
75 Correct 202 ms 596 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 249 ms 568 KB Output is correct
79 Correct 176 ms 808 KB Output is correct
80 Correct 170 ms 348 KB Output is correct
81 Correct 168 ms 348 KB Output is correct
82 Correct 188 ms 560 KB Output is correct
83 Correct 172 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 22 ms 520 KB Output is correct
86 Correct 145 ms 564 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 23 ms 348 KB Output is correct
90 Correct 23 ms 348 KB Output is correct
91 Correct 23 ms 348 KB Output is correct
92 Correct 165 ms 344 KB Output is correct
93 Correct 202 ms 568 KB Output is correct
94 Correct 178 ms 344 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 150 ms 568 KB Output is correct
98 Correct 32 ms 348 KB Output is correct
99 Correct 218 ms 564 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 21 ms 512 KB Output is correct
102 Correct 21 ms 348 KB Output is correct
103 Correct 164 ms 552 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 0 ms 448 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 23 ms 348 KB Output is correct
108 Correct 23 ms 516 KB Output is correct
109 Correct 162 ms 564 KB Output is correct
110 Correct 163 ms 568 KB Output is correct
111 Correct 1 ms 344 KB Output is correct