oj.uz

Submission #1056202

# Submission time Handle Problem Language Result Execution time Memory
1056202 2024-08-13T08:13:28 Z vjudge1 Rarest Insects (IOI22_insects) C++17
64.45 / 100
 104 ms 972 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using ii = pair<int, int>;

bool gasit = false;

vector<ii> cauta(vi Cul, vi V) {
    vector<ii> Re;
    if(gasit) return Re;
    if(V.empty()) {
        gasit = true;
        return vector<ii>();
    }
    if(Cul.size() == 1) {
        for(auto it : V) Re.push_back({it, Cul[0]});
        return Re;
    }
    vi C1, C2;
    for(int i = 0; i < int(Cul.size()) / 2; ++i) {
        C1.push_back(Cul[i]);
    }
    for(int i = int(Cul.size()) / 2; i < int(Cul.size()); ++i) {
        C2.push_back(Cul[i]);
    }
    for(auto it : C1) {
        move_inside(it);
    }
    vi V1, V2;
    for(auto it : V) {
        move_inside(it);
        if(press_button() == 2) V1.push_back(it);
        else V2.push_back(it);
        move_outside(it);
    }
    for(auto it : C1) {
        move_outside(it);
    }

    auto Re1 = cauta(C1, V1), Re2 = cauta(C2, V2);
    for(auto it : Re1) Re.push_back(it);
    for(auto it : Re2) Re.push_back(it);
    return Re;
}

int min_cardinality(int n) {
    vi Cul, Rest;
    for(int i = 0; i < n; ++i) {
        move_inside(i);
        if(press_button() == 1) {
            Cul.push_back(i);
        } else {
            move_outside(i);
            Rest.push_back(i);
        }
    }
    for(auto it : Cul) move_outside(it);
    if(Cul.size() > Rest.size()) return 1;
    auto Per = cauta(Cul, Rest);
    if(gasit) return 1;
    map<int, int> Fr;
    for(auto it : Cul) ++Fr[it];
    for(auto [p, cul] : Per) ++Fr[cul];
    int mi = n;
    for(auto [cul, fr] : Fr) mi = min(mi, fr);
    return mi;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 452 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 436 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 4 ms 440 KB Output is correct
25 Correct 22 ms 688 KB Output is correct
26 Correct 30 ms 672 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 4 ms 440 KB Output is correct
29 Correct 12 ms 452 KB Output is correct
30 Correct 28 ms 684 KB Output is correct
31 Correct 12 ms 344 KB Output is correct
32 Correct 25 ms 672 KB Output is correct
33 Correct 17 ms 700 KB Output is correct
34 Correct 19 ms 620 KB Output is correct
35 Correct 17 ms 452 KB Output is correct
36 Correct 24 ms 668 KB Output is correct
37 Correct 32 ms 592 KB Output is correct
38 Correct 27 ms 344 KB Output is correct
39 Correct 12 ms 344 KB Output is correct
40 Correct 11 ms 440 KB Output is correct
41 Correct 4 ms 344 KB Output is correct

Subtask #3
39.45 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 10 ms 432 KB Output is correct
8 Correct 10 ms 600 KB Output is correct
9 Partially correct 62 ms 700 KB Output is partially correct
10 Partially correct 55 ms 492 KB Output is partially correct
11 Correct 14 ms 452 KB Output is correct
12 Partially correct 51 ms 616 KB Output is partially correct
13 Partially correct 30 ms 592 KB Output is partially correct
14 Partially correct 70 ms 708 KB Output is partially correct
15 Partially correct 30 ms 588 KB Output is partially correct
16 Partially correct 36 ms 592 KB Output is partially correct
17 Partially correct 59 ms 624 KB Output is partially correct
18 Partially correct 35 ms 344 KB Output is partially correct
19 Partially correct 43 ms 456 KB Output is partially correct
20 Partially correct 59 ms 600 KB Output is partially correct
21 Partially correct 71 ms 680 KB Output is partially correct
22 Partially correct 61 ms 696 KB Output is partially correct
23 Partially correct 52 ms 744 KB Output is partially correct
24 Correct 18 ms 696 KB Output is correct
25 Correct 21 ms 696 KB Output is correct
26 Correct 16 ms 344 KB Output is correct
27 Partially correct 75 ms 600 KB Output is partially correct
28 Partially correct 62 ms 480 KB Output is partially correct
29 Partially correct 54 ms 600 KB Output is partially correct
30 Partially correct 44 ms 592 KB Output is partially correct
31 Partially correct 50 ms 680 KB Output is partially correct
32 Partially correct 59 ms 728 KB Output is partially correct
33 Partially correct 72 ms 964 KB Output is partially correct
34 Partially correct 79 ms 704 KB Output is partially correct
35 Partially correct 76 ms 848 KB Output is partially correct
36 Partially correct 57 ms 592 KB Output is partially correct
37 Partially correct 53 ms 600 KB Output is partially correct
38 Partially correct 68 ms 940 KB Output is partially correct
39 Partially correct 73 ms 848 KB Output is partially correct
40 Partially correct 88 ms 708 KB Output is partially correct
41 Partially correct 67 ms 868 KB Output is partially correct
42 Partially correct 104 ms 924 KB Output is partially correct
43 Partially correct 6 ms 596 KB Output is partially correct
44 Partially correct 40 ms 448 KB Output is partially correct
45 Correct 14 ms 592 KB Output is correct
46 Partially correct 50 ms 972 KB Output is partially correct
47 Correct 7 ms 588 KB Output is correct
48 Partially correct 56 ms 840 KB Output is partially correct