oj.uz

Submission #787650

# Submission time Handle Problem Language Result Execution time Memory
787650 2023-07-19T10:41:03 Z That_Salamander Cave (IOI13_cave) C++17
100 / 100
 299 ms 848 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <cstring>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <random>
#include <cassert>

#include "cave.h"

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

void exploreCave(int n) {
    vector<int> zero(n);

    vector<pair<int, int>> known;
    set<int> unknown;

    FOR(i, n) {
        unknown.insert(i);
    }

    FOR(i, n) {
        int res = tryCombination(zero.data());
        bool openOnZero = res == -1 || res >= i + 1;

        vector<int> currTest(n, !openOnZero);

        for (auto p: known) {
            currTest[p.first] = p.second;
        }

        vector<int> frontier(unknown.begin(), unknown.end());

        int l = 0;
        int r = frontier.size() - 1;

        while (r > l) {
            int m = (l + r) / 2;

            for (int j = l; j <= m; j++) {
                currTest[frontier[j]] = openOnZero;
            }

            bool didClose = tryCombination(currTest.data()) == i;

            for (int j = l; j <= m; j++) {
                currTest[frontier[j]] = !openOnZero;
            }

            if (didClose) {
                r = m;
            } else {
                l = m + 1;
            }
        }

        int d = frontier[l];

        unknown.erase(d);
        zero[d] = !openOnZero;
        known.push_back({d, !openOnZero});

        //cout << "Door " << i << " is opened by switch " << d << " which is set to " << !openOnZero << endl;
    }

    vector<int> d(n);

    FOR(i, n) {
        d[known[i].first] = i;
    }

    answer(zero.data(), d.data());
}

#ifdef LOCAL_TEST
#define MAX_N 5000
#define MAX_CALLS 70000

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;
  for (i = 0; i < N; ++i)
    if (S[i] != realS[i] || D[i] != realD[i]) {
      printf("INCORRECT\nWrong answer:");
      if (S[i] != realS[i])
        printf("S[%d] != realS[%d]\n", i, i);
      else
        printf("D[%d] != realD[%d]\n", i, i);
      exit(0);
    }

  printf("CORRECT\n");
}

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;

  assert(scanf("%d", &N) == 1);

  for (i = 0; i < N; ++i) {
    assert(scanf("%d", &realS[i]) == 1);
  }
  for (i = 0; i < N; ++i) {
    assert(scanf("%d", &realD[i]) == 1);
    inv[realD[i]] = i;
  }

  num_calls = 0;
  return N;*/

  N = 5000;
  FOR(i, N) {
    realS[i] = rand() % 2;
  }

  vector<int> d(N);
    FOR(i, N) {
        d[i] = i;
    }

    random_device rd;
    mt19937 g(rd());

    shuffle(d.begin(), d.end(), g);

    FOR(i, N) {
        realD[d[i]] = i;
        inv[i] = d[i];
    }

    num_calls = 0;

    /*cout << "N = " << N << endl;
    FOR(i, N) {
        cout << realS[i] << " ";
    }
    cout << endl;
    FOR(i, N) {
        cout << realD[i] << " ";
    }
    cout << endl;*/

    return N;
}

int main() {
    FOR(i, 100) {
        int N;
        N = init();
        exploreCave(N);

        cout << "Done in " << num_calls << " calls!" << endl;
    }
}
#endif

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 604 KB Output is correct
2 Correct 135 ms 604 KB Output is correct
3 Correct 229 ms 664 KB Output is correct
4 Correct 137 ms 596 KB Output is correct
5 Correct 206 ms 568 KB Output is correct
6 Correct 218 ms 576 KB Output is correct
7 Correct 222 ms 704 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 198 ms 664 KB Output is correct
13 Correct 228 ms 668 KB Output is correct
14 Correct 217 ms 660 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 664 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 289 ms 724 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 218 ms 660 KB Output is correct
7 Correct 217 ms 664 KB Output is correct
8 Correct 274 ms 768 KB Output is correct
9 Correct 268 ms 720 KB Output is correct
10 Correct 296 ms 764 KB Output is correct
11 Correct 229 ms 664 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 30 ms 460 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 34 ms 476 KB Output is correct
24 Correct 35 ms 496 KB Output is correct
25 Correct 35 ms 476 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 308 KB Output is correct
28 Correct 35 ms 444 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 31 ms 340 KB Output is correct
31 Correct 30 ms 444 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 34 ms 484 KB Output is correct
36 Correct 35 ms 448 KB Output is correct
37 Correct 1 ms 304 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 604 KB Output is correct
2 Correct 135 ms 604 KB Output is correct
3 Correct 229 ms 664 KB Output is correct
4 Correct 137 ms 596 KB Output is correct
5 Correct 206 ms 568 KB Output is correct
6 Correct 218 ms 576 KB Output is correct
7 Correct 222 ms 704 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 198 ms 664 KB Output is correct
13 Correct 228 ms 668 KB Output is correct
14 Correct 217 ms 660 KB Output is correct
15 Correct 207 ms 664 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 289 ms 724 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 218 ms 660 KB Output is correct
21 Correct 217 ms 664 KB Output is correct
22 Correct 274 ms 768 KB Output is correct
23 Correct 268 ms 720 KB Output is correct
24 Correct 296 ms 764 KB Output is correct
25 Correct 229 ms 664 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 300 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 30 ms 460 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 34 ms 476 KB Output is correct
49 Correct 35 ms 496 KB Output is correct
50 Correct 35 ms 476 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 308 KB Output is correct
53 Correct 35 ms 444 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 31 ms 340 KB Output is correct
56 Correct 30 ms 444 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 34 ms 484 KB Output is correct
61 Correct 35 ms 448 KB Output is correct
62 Correct 1 ms 304 KB Output is correct
63 Correct 144 ms 604 KB Output is correct
64 Correct 132 ms 608 KB Output is correct
65 Correct 195 ms 572 KB Output is correct
66 Correct 143 ms 604 KB Output is correct
67 Correct 206 ms 664 KB Output is correct
68 Correct 204 ms 668 KB Output is correct
69 Correct 256 ms 668 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 203 ms 668 KB Output is correct
73 Correct 202 ms 660 KB Output is correct
74 Correct 210 ms 660 KB Output is correct
75 Correct 239 ms 696 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 230 ms 596 KB Output is correct
79 Correct 214 ms 664 KB Output is correct
80 Correct 280 ms 728 KB Output is correct
81 Correct 299 ms 684 KB Output is correct
82 Correct 275 ms 776 KB Output is correct
83 Correct 206 ms 596 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 31 ms 480 KB Output is correct
86 Correct 206 ms 660 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 36 ms 480 KB Output is correct
90 Correct 35 ms 468 KB Output is correct
91 Correct 35 ms 480 KB Output is correct
92 Correct 240 ms 688 KB Output is correct
93 Correct 258 ms 716 KB Output is correct
94 Correct 271 ms 728 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 241 ms 848 KB Output is correct
98 Correct 32 ms 340 KB Output is correct
99 Correct 196 ms 660 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 38 ms 340 KB Output is correct
102 Correct 42 ms 456 KB Output is correct
103 Correct 201 ms 596 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 300 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 52 ms 476 KB Output is correct
108 Correct 34 ms 468 KB Output is correct
109 Correct 277 ms 700 KB Output is correct
110 Correct 267 ms 728 KB Output is correct
111 Correct 0 ms 212 KB Output is correct