제출 #629612

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
629612	2022-08-14 18:38:36	dacin21	드문 곤충 (IOI22_insects)	C++17	99.77 / 100	74 ms	1208 KiB

insects

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
    #include "insects.h"
    #include "bits/stdc++.h"
     
    #define SZ(s) ((int) s.size())
    using namespace std;
     
    #ifndef RR
    #define DEBUG(X)
    #endif
     
    /*
    int min_cardinality(int n) {
        int res = n + 1;  // final result
     
        // used(i) = true if we already counted species of i
        std::vector<bool> used(n, false);
        for (int i = 0; i < n; ++i) {
            if (!used[i]) {
                // set containing all insects of this species
                std::set<int> same_species {i};
                move_inside(i);
     
                for (int j = i + 1; j < n; ++j) {
                    if (!used[j]) {
                        move_inside(j);
                        if (press_button() == 1 + SZ(same_species)) {
                            same_species.insert(j);
                        } else {
                            move_outside(j);
                        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 74.77 / 75