oj.uz

Submission #1056705

# Submission time Handle Problem Language Result Execution time Memory
1056705 2024-08-13T10:40:44 Z vjudge1 Rarest Insects (IOI22_insects) C++17
61.89 / 100
 80 ms 1104 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

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

bool gasit = false;

set<int> Cur;

vi Perm;
void movein2(int i) {
    move_inside(Perm[i]);
}
void moveout2(int i) {
    move_outside(Perm[i]);
}

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]);
    }
    set<int> SC1;
    for(auto it : C1) SC1.insert(it);
    
    vi de_scos;

    for(auto it : Cur) {
        if(!SC1.count(it))
            de_scos.push_back(it);
    }

    for(auto it : de_scos) {
        Cur.erase(it);
        moveout2(it);
    }

    for(auto it : C1) {
        if(!Cur.count(it)) {
            movein2(it);
            Cur.insert(it);
        }
    }
    vi V1, V2;
    for(auto it : V) {
        movein2(it);
        if(press_button() == 2) V1.push_back(it);
        else V2.push_back(it);
        moveout2(it);
    }
//    for(auto it : C1) {
//        moveout2(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;
    Perm.clear();
    for(int i = 0; i < n; ++i)
        Perm.push_back(i);
    mt19937 rng(12344);
    shuffle(Perm.begin(), Perm.end(), rng);
    for(int i = 0; i < n; ++i) {
        movein2(i);
        if(press_button() == 1) {
            Cur.insert(i);
            Cul.push_back(i);
        } else {
            moveout2(i);
            Rest.push_back(i);
        }
    }
    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 500 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 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 440 KB Output is correct
15 Correct 3 ms 452 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 5 ms 440 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 2 ms 448 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 500 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 2 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 440 KB Output is correct
15 Correct 3 ms 452 KB Output is correct
16 Correct 4 ms 600 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 5 ms 440 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 2 ms 448 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 700 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 25 ms 460 KB Output is correct
26 Correct 25 ms 456 KB Output is correct
27 Correct 9 ms 464 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 13 ms 452 KB Output is correct
30 Correct 17 ms 460 KB Output is correct
31 Correct 11 ms 600 KB Output is correct
32 Correct 21 ms 604 KB Output is correct
33 Correct 20 ms 600 KB Output is correct
34 Correct 29 ms 608 KB Output is correct
35 Correct 20 ms 604 KB Output is correct
36 Correct 31 ms 1104 KB Output is correct
37 Correct 25 ms 460 KB Output is correct
38 Correct 43 ms 468 KB Output is correct
39 Correct 9 ms 472 KB Output is correct
40 Correct 15 ms 492 KB Output is correct
41 Correct 5 ms 468 KB Output is correct

Subtask #3
36.89 / 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 7 ms 464 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Partially correct 55 ms 720 KB Output is partially correct
10 Partially correct 70 ms 984 KB Output is partially correct
11 Correct 14 ms 456 KB Output is correct
12 Partially correct 46 ms 808 KB Output is partially correct
13 Partially correct 33 ms 592 KB Output is partially correct
14 Partially correct 68 ms 716 KB Output is partially correct
15 Partially correct 16 ms 344 KB Output is partially correct
16 Partially correct 30 ms 344 KB Output is partially correct
17 Partially correct 44 ms 960 KB Output is partially correct
18 Partially correct 41 ms 720 KB Output is partially correct
19 Partially correct 58 ms 736 KB Output is partially correct
20 Partially correct 37 ms 712 KB Output is partially correct
21 Partially correct 69 ms 768 KB Output is partially correct
22 Partially correct 63 ms 716 KB Output is partially correct
23 Partially correct 77 ms 700 KB Output is partially correct
24 Correct 17 ms 476 KB Output is correct
25 Correct 18 ms 768 KB Output is correct
26 Correct 8 ms 724 KB Output is correct
27 Partially correct 50 ms 844 KB Output is partially correct
28 Partially correct 80 ms 736 KB Output is partially correct
29 Partially correct 46 ms 724 KB Output is partially correct
30 Partially correct 60 ms 700 KB Output is partially correct
31 Partially correct 51 ms 512 KB Output is partially correct
32 Partially correct 56 ms 508 KB Output is partially correct
33 Partially correct 48 ms 704 KB Output is partially correct
34 Partially correct 79 ms 508 KB Output is partially correct
35 Partially correct 55 ms 500 KB Output is partially correct
36 Partially correct 63 ms 512 KB Output is partially correct
37 Partially correct 49 ms 716 KB Output is partially correct
38 Partially correct 47 ms 712 KB Output is partially correct
39 Partially correct 61 ms 724 KB Output is partially correct
40 Partially correct 73 ms 508 KB Output is partially correct
41 Partially correct 49 ms 508 KB Output is partially correct
42 Partially correct 73 ms 632 KB Output is partially correct
43 Partially correct 10 ms 344 KB Output is partially correct
44 Partially correct 22 ms 752 KB Output is partially correct
45 Correct 16 ms 600 KB Output is correct
46 Partially correct 46 ms 640 KB Output is partially correct
47 Partially correct 52 ms 488 KB Output is partially correct
48 Partially correct 53 ms 808 KB Output is partially correct