답안 #1056696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056696	2024-08-13T10:39:07 Z	vjudge1	드문 곤충 (IOI22_insects)	C++17	65.19 / 100	85 ms	868 KB

insects

#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;
    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

#	결과	실행 시간	메모리	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	440 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	3 ms	440 KB	Output is correct
14	Correct	2 ms	448 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	3 ms	444 KB	Output is correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	6 ms	344 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

#	결과	실행 시간	메모리	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	440 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	3 ms	440 KB	Output is correct
14	Correct	2 ms	448 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	3 ms	444 KB	Output is correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	6 ms	344 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	4 ms	600 KB	Output is correct
24	Correct	3 ms	468 KB	Output is correct
25	Correct	21 ms	460 KB	Output is correct
26	Correct	17 ms	464 KB	Output is correct
27	Correct	5 ms	456 KB	Output is correct
28	Correct	4 ms	344 KB	Output is correct
29	Correct	15 ms	344 KB	Output is correct
30	Correct	25 ms	600 KB	Output is correct
31	Correct	14 ms	604 KB	Output is correct
32	Correct	11 ms	592 KB	Output is correct
33	Correct	23 ms	700 KB	Output is correct
34	Correct	19 ms	460 KB	Output is correct
35	Correct	31 ms	596 KB	Output is correct
36	Correct	25 ms	448 KB	Output is correct
37	Correct	26 ms	592 KB	Output is correct
38	Correct	38 ms	728 KB	Output is correct
39	Correct	22 ms	460 KB	Output is correct
40	Correct	10 ms	464 KB	Output is correct
41	Correct	3 ms	448 KB	Output is correct

Subtask #3
40.19 / 75.0

#	결과	실행 시간	메모리	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	0 ms	344 KB	Output is correct
7	Correct	6 ms	596 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Partially correct	51 ms	592 KB	Output is partially correct
10	Partially correct	67 ms	600 KB	Output is partially correct
11	Correct	15 ms	344 KB	Output is correct
12	Partially correct	49 ms	600 KB	Output is partially correct
13	Partially correct	29 ms	488 KB	Output is partially correct
14	Partially correct	51 ms	712 KB	Output is partially correct
15	Partially correct	34 ms	440 KB	Output is partially correct
16	Partially correct	56 ms	848 KB	Output is partially correct
17	Partially correct	33 ms	712 KB	Output is partially correct
18	Partially correct	34 ms	496 KB	Output is partially correct
19	Partially correct	47 ms	600 KB	Output is partially correct
20	Partially correct	58 ms	592 KB	Output is partially correct
21	Partially correct	58 ms	748 KB	Output is partially correct
22	Partially correct	82 ms	684 KB	Output is partially correct
23	Partially correct	56 ms	712 KB	Output is partially correct
24	Correct	14 ms	344 KB	Output is correct
25	Correct	29 ms	712 KB	Output is correct
26	Correct	8 ms	344 KB	Output is correct
27	Partially correct	73 ms	460 KB	Output is partially correct
28	Partially correct	56 ms	708 KB	Output is partially correct
29	Partially correct	62 ms	744 KB	Output is partially correct
30	Partially correct	64 ms	868 KB	Output is partially correct
31	Partially correct	60 ms	500 KB	Output is partially correct
32	Partially correct	52 ms	720 KB	Output is partially correct
33	Partially correct	72 ms	620 KB	Output is partially correct
34	Partially correct	85 ms	724 KB	Output is partially correct
35	Partially correct	64 ms	848 KB	Output is partially correct
36	Partially correct	67 ms	868 KB	Output is partially correct
37	Partially correct	63 ms	736 KB	Output is partially correct
38	Partially correct	51 ms	612 KB	Output is partially correct
39	Partially correct	75 ms	592 KB	Output is partially correct
40	Partially correct	69 ms	504 KB	Output is partially correct
41	Partially correct	68 ms	720 KB	Output is partially correct
42	Partially correct	57 ms	756 KB	Output is partially correct
43	Partially correct	9 ms	600 KB	Output is partially correct
44	Partially correct	25 ms	472 KB	Output is partially correct
45	Correct	12 ms	600 KB	Output is correct
46	Partially correct	46 ms	820 KB	Output is partially correct
47	Correct	13 ms	504 KB	Output is correct
48	Partially correct	50 ms	824 KB	Output is partially correct

답안 #1056696

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 40.19 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
40.19 / 75.0