oj.uz

Submission #628877

# Submission time Handle Problem Language Result Execution time Memory
628877 2022-08-13T18:49:31 Z dqhungdl Rarest Insects (IOI22_insects) C++17
0 / 100
 1 ms 208 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

//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> P(N, -1);
    int rs = 1e9;
    for (int i = 0; i < N; i++)
        if (P[i] == -1) {
            P[i] = i;
            move_inside(i);
            int cnt = 1;
            for (int j = i + 1; j < N; j++)
                if (P[j] == -1) {
                    move_inside(j);
                    if (cnt + 1 == press_button()) {
                        cnt++;
                        P[j] = i;
                    } else
                        move_outside(j);
                }
            rs = min(rs, cnt);
        }
    return rs;
}

/*********************************************************************************/
//int main() {
//    freopen("../_input", "r", stdin);
//    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
0 / 10.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 0 ms 208 KB Output is correct
4 Incorrect 0 ms 208 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.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 0 ms 208 KB Output is correct
4 Incorrect 0 ms 208 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #3
0 / 75.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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Incorrect 1 ms 208 KB Wrong answer.
7 Halted 0 ms 0 KB -