답안 #1075190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1075190	2024-08-25T19:33:03 Z	Zicrus	드문 곤충 (IOI22_insects)	C++17	69.26 / 100	92 ms	708 KB

insects

#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
 
typedef long long ll;
 
int n;
vector<bool> in;
unordered_set<int> s;
int cnt;
 
int add(int i) {
    if (in[i]) return 0;
    move_inside(i);
    cnt++;
    in[i] = true;
    return 1;
}
 
int remove(int i) {
    if (!in[i]) return 0;
    move_outside(i);
    cnt--;
    in[i] = false;
    return 1;
}
 
int min_cardinality(int N) {
    n = N;
    cnt = 0;
    mt19937 mt(time(0));
    in = vector<bool>(n);
    for (int i = 0; i < n; i++) {
        add(i);
    }
    int mx = press_button();
    int prevSz = cnt;
    while (mx > 1) {
        int cur = mx;
        while (cur == mx) {
            int i = mt()%n;
            while (!remove(i)) i = mt()%n;
            int j = mt()%n;
            while (!remove(j)) j = mt()%n;
            cur = press_button();
            if (cur == mx) {
                s.insert(i);
                s.insert(j);
            }
            else {
                add(j);
                cur = press_button();
                if (cur == mx) {
                    s.insert(i);
                    remove(j);
                }
                cur = mx-1;
            }
        }
        vector<int> s0;
        for (auto &e : s) {
            s0.push_back(e);
        }
        shuffle(s0.begin(), s0.end(), mt);
        for (int i = 0; i < s0.size(); i++) {
            if (i == s0.size()-1) {
                if (add(s0[i])) {
                    cur = press_button();
                    if (cur == mx) remove(s0[i]);
                }
                continue;
            }

            add(s0[i]);
            add(s0[i+1]);
            cur = press_button();
            if (cur == mx) {
                remove(s0[i+1]);
                cur = press_button();
                if (cur == mx) {
                    remove(s0[i]);
                }
                else {
                    i++;
                }
            }
        }
        if (cnt * mx % (mx-1) == 0 && cnt * mx / (mx-1) == prevSz) {
            break;
        }
        s.clear();
        prevSz = cnt;
        mx--;
    }
    return mx;
} 
 
#ifdef TEST
#include "grader.cpp"
#endif

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:65:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (int i = 0; i < s0.size(); i++) {
      |                         ~~^~~~~~~~~~~
insects.cpp:66:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |             if (i == s0.size()-1) {
      |                 ~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	340 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	3 ms	440 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	3 ms	344 KB	Output is correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	3 ms	596 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	5 ms	344 KB	Output is correct
22	Correct	3 ms	444 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	340 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	3 ms	440 KB	Output is correct
12	Correct	3 ms	344 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	3 ms	344 KB	Output is correct
17	Correct	3 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	3 ms	596 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	5 ms	344 KB	Output is correct
22	Correct	3 ms	444 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	3 ms	344 KB	Output is correct
26	Correct	26 ms	592 KB	Output is correct
27	Correct	12 ms	344 KB	Output is correct
28	Correct	33 ms	668 KB	Output is correct
29	Correct	23 ms	344 KB	Output is correct
30	Correct	31 ms	344 KB	Output is correct
31	Correct	3 ms	340 KB	Output is correct
32	Correct	3 ms	344 KB	Output is correct
33	Correct	5 ms	344 KB	Output is correct
34	Correct	9 ms	344 KB	Output is correct
35	Correct	8 ms	344 KB	Output is correct
36	Correct	10 ms	344 KB	Output is correct
37	Correct	15 ms	344 KB	Output is correct
38	Correct	31 ms	600 KB	Output is correct
39	Correct	34 ms	596 KB	Output is correct
40	Correct	19 ms	344 KB	Output is correct
41	Correct	27 ms	460 KB	Output is correct

Subtask #3
44.26 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 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	1 ms	344 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	2 ms	440 KB	Output is correct
10	Partially correct	45 ms	584 KB	Output is partially correct
11	Correct	15 ms	344 KB	Output is correct
12	Partially correct	66 ms	436 KB	Output is partially correct
13	Partially correct	27 ms	344 KB	Output is partially correct
14	Partially correct	67 ms	344 KB	Output is partially correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	4 ms	344 KB	Output is correct
17	Correct	5 ms	344 KB	Output is correct
18	Correct	11 ms	344 KB	Output is correct
19	Correct	10 ms	344 KB	Output is correct
20	Correct	15 ms	444 KB	Output is correct
21	Partially correct	51 ms	424 KB	Output is partially correct
22	Partially correct	51 ms	444 KB	Output is partially correct
23	Partially correct	72 ms	460 KB	Output is partially correct
24	Partially correct	92 ms	708 KB	Output is partially correct
25	Partially correct	83 ms	588 KB	Output is partially correct
26	Partially correct	45 ms	588 KB	Output is partially correct
27	Correct	3 ms	344 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	3 ms	344 KB	Output is correct
30	Correct	4 ms	344 KB	Output is correct
31	Partially correct	45 ms	452 KB	Output is partially correct
32	Partially correct	40 ms	344 KB	Output is partially correct
33	Partially correct	65 ms	344 KB	Output is partially correct
34	Partially correct	65 ms	440 KB	Output is partially correct
35	Correct	4 ms	344 KB	Output is correct
36	Correct	6 ms	452 KB	Output is correct
37	Partially correct	41 ms	460 KB	Output is partially correct
38	Partially correct	29 ms	344 KB	Output is partially correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	7 ms	588 KB	Output is correct
41	Correct	7 ms	344 KB	Output is correct
42	Correct	4 ms	588 KB	Output is correct
43	Correct	7 ms	344 KB	Output is correct
44	Correct	32 ms	344 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Partially correct	62 ms	676 KB	Output is partially correct
47	Partially correct	48 ms	432 KB	Output is partially correct
48	Partially correct	74 ms	672 KB	Output is partially correct

답안 #1075190

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 44.26 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
44.26 / 75.0