oj.uz

Submission #668680

# Submission time Handle Problem Language Result Execution time Memory
668680 2022-12-04T12:28:43 Z hoanghq2004 Rarest Insects (IOI22_insects) C++17
95.4 / 100
 80 ms 420 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "insects.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;


//
//static inline constexpr int kMaxQueries = 40000;
//
//static int N;
//// Insect types are compressed to colors in the range [0, N).
//static std::vector<int> color;
//static std::vector<bool> in_box;
//
//static std::vector<int> color_occurrences;
//static std::multiset<int> max_occurrences;
//
//static std::vector<int> op_counter(3, 0);
//
//static inline void protocol_violation(std::string message) {
//  printf("Protocol Violation: %s\n", message.c_str());
//  exit(0);
//}
//
//void move_inside(int i) {
//  if (i < 0 || i >= N) {
//    protocol_violation("invalid parameter");
//  }
//  ++op_counter[0];
//  if (op_counter[0] > kMaxQueries) {
//    protocol_violation("too many calls");
//  }
//  if (!in_box[i]) {
//    in_box[i] = true;
//    max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
//    ++color_occurrences[color[i]];
//    max_occurrences.insert(color_occurrences[color[i]]);
//  }
//}
//
//void move_outside(int i) {
//  if (i < 0 || i >= N) {
//    protocol_violation("invalid parameter");
//  }
//  ++op_counter[1];
//  if (op_counter[1] > kMaxQueries) {
//    protocol_violation("too many calls");
//  }
//  if (in_box[i]) {
//    in_box[i] = false;
//    max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
//    --color_occurrences[color[i]];
//    max_occurrences.insert(color_occurrences[color[i]]);
//  }
//}
//
//int press_button() {
//  ++op_counter[2];
//  if (op_counter[2] > kMaxQueries) {
//    protocol_violation("too many calls");
//  }
//  return *(max_occurrences.rbegin());
//}

int min_cardinality(int n) {
    vector <int> used(n);
    for (int i = 0; i < n; ++i) {
        move_inside(i);
        if (press_button() == 1) used[i] = 1;
        else move_outside(i);
    }
    int cnt = 0;
    for (int i = 0; i < n; ++i) if (used[i]) move_outside(i), ++cnt, used[i] = 0;
    int k = 1;
    int cur = 0;
    for (int lg = 13; lg >= 0; --lg) {
        if (k + (1 << lg) > n / cnt) continue;
        int _k = k + (1 << lg);
        vector <int> a;
        for (int i = 0; i < n; ++i) {
            if (used[i]) continue;
            move_inside(i);
            if (press_button() > _k) move_outside(i);
            else used[i] = 1, a.push_back(i), ++cur;
        }
        if (cur == cnt * _k) {
            k = _k;
            continue;
        }
        for (int i = 0; i < n; ++i) {
            auto iter = lower_bound(a.begin(), a.end(), i);
            if (iter == a.end() || *iter != i) used[i] = 1;
        }
        for (auto i: a) move_outside(i), used[i] = 0, --cur;
    }
    return k;
}
//
//
//int main() {
//  assert(1 == scanf("%d", &N));
//  color.resize(N);
//  in_box.assign(N, false);
//
//  std::map<int, int> type_to_color;
//  for (int i = 0; i < N; ++i) {
//    int Ti;
//    assert(1 == scanf("%d", &Ti));
//    if (type_to_color.find(Ti) == type_to_color.end()) {
//      int new_color = type_to_color.size();
//      type_to_color[Ti] = new_color;
//      max_occurrences.insert(0);
//    }
//    color[i] = type_to_color[Ti];
//  }
//
//  color_occurrences.assign(type_to_color.size(), 0);
//
//  int answer = min_cardinality(N);
//  int Q = *std::max_element(op_counter.begin(), op_counter.end());
//  printf("%d\n", answer);
//  printf("%d\n", Q);
//  return 0;
//}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 5 ms 300 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 6 ms 300 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 5 ms 300 KB Output is correct
15 Correct 4 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 6 ms 300 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 24 ms 300 KB Output is correct
24 Correct 12 ms 208 KB Output is correct
25 Correct 19 ms 300 KB Output is correct
26 Correct 27 ms 208 KB Output is correct
27 Correct 17 ms 332 KB Output is correct
28 Correct 8 ms 208 KB Output is correct
29 Correct 30 ms 280 KB Output is correct
30 Correct 22 ms 336 KB Output is correct
31 Correct 23 ms 208 KB Output is correct
32 Correct 32 ms 208 KB Output is correct
33 Correct 28 ms 208 KB Output is correct
34 Correct 23 ms 208 KB Output is correct
35 Correct 34 ms 208 KB Output is correct
36 Correct 29 ms 288 KB Output is correct
37 Correct 35 ms 208 KB Output is correct
38 Correct 25 ms 284 KB Output is correct
39 Correct 38 ms 412 KB Output is correct
40 Correct 18 ms 288 KB Output is correct
41 Correct 8 ms 208 KB Output is correct

Subtask #3
70.4 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 43 ms 284 KB Output is correct
8 Correct 23 ms 284 KB Output is correct
9 Correct 43 ms 284 KB Output is correct
10 Partially correct 51 ms 304 KB Output is partially correct
11 Correct 39 ms 288 KB Output is correct
12 Correct 34 ms 416 KB Output is correct
13 Partially correct 53 ms 328 KB Output is partially correct
14 Partially correct 65 ms 208 KB Output is partially correct
15 Correct 47 ms 288 KB Output is correct
16 Correct 58 ms 292 KB Output is correct
17 Correct 48 ms 300 KB Output is correct
18 Correct 47 ms 300 KB Output is correct
19 Partially correct 67 ms 288 KB Output is partially correct
20 Correct 39 ms 296 KB Output is correct
21 Partially correct 64 ms 288 KB Output is partially correct
22 Partially correct 68 ms 300 KB Output is partially correct
23 Partially correct 54 ms 304 KB Output is partially correct
24 Correct 32 ms 288 KB Output is correct
25 Correct 31 ms 284 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 40 ms 208 KB Output is correct
28 Correct 46 ms 208 KB Output is correct
29 Partially correct 80 ms 208 KB Output is partially correct
30 Partially correct 78 ms 300 KB Output is partially correct
31 Partially correct 62 ms 208 KB Output is partially correct
32 Partially correct 39 ms 284 KB Output is partially correct
33 Partially correct 72 ms 296 KB Output is partially correct
34 Partially correct 77 ms 296 KB Output is partially correct
35 Partially correct 79 ms 304 KB Output is partially correct
36 Partially correct 58 ms 208 KB Output is partially correct
37 Partially correct 72 ms 288 KB Output is partially correct
38 Partially correct 68 ms 300 KB Output is partially correct
39 Correct 50 ms 296 KB Output is correct
40 Correct 60 ms 300 KB Output is correct
41 Correct 31 ms 300 KB Output is correct
42 Correct 31 ms 300 KB Output is correct
43 Correct 11 ms 208 KB Output is correct
44 Correct 48 ms 288 KB Output is correct
45 Correct 38 ms 420 KB Output is correct
46 Correct 40 ms 292 KB Output is correct
47 Correct 26 ms 288 KB Output is correct
48 Correct 37 ms 292 KB Output is correct