oj.uz

Submission #1075192

# Submission time Handle Problem Language Result Execution time Memory
1075192 2024-08-25T19:34:02 Z Zicrus Rarest Insects (IOI22_insects) C++17
64.64 / 100
 85 ms 940 KB 
#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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 440 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 2 ms 436 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 440 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 2 ms 436 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 2 ms 344 KB Output is correct
26 Correct 23 ms 440 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 20 ms 436 KB Output is correct
29 Correct 16 ms 344 KB Output is correct
30 Correct 28 ms 436 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 4 ms 436 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 12 ms 344 KB Output is correct
37 Correct 21 ms 344 KB Output is correct
38 Correct 34 ms 344 KB Output is correct
39 Correct 36 ms 344 KB Output is correct
40 Correct 35 ms 600 KB Output is correct
41 Correct 16 ms 608 KB Output is correct

Subtask #3
39.64 / 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 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 3 ms 344 KB Output is correct
10 Partially correct 54 ms 448 KB Output is partially correct
11 Correct 18 ms 344 KB Output is correct
12 Partially correct 55 ms 672 KB Output is partially correct
13 Partially correct 46 ms 436 KB Output is partially correct
14 Partially correct 76 ms 452 KB Output is partially correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 436 KB Output is correct
17 Correct 7 ms 588 KB Output is correct
18 Correct 13 ms 344 KB Output is correct
19 Correct 10 ms 444 KB Output is correct
20 Correct 16 ms 440 KB Output is correct
21 Partially correct 45 ms 444 KB Output is partially correct
22 Partially correct 64 ms 580 KB Output is partially correct
23 Partially correct 85 ms 580 KB Output is partially correct
24 Partially correct 80 ms 460 KB Output is partially correct
25 Partially correct 80 ms 476 KB Output is partially correct
26 Partially correct 76 ms 504 KB Output is partially correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 7 ms 436 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Partially correct 42 ms 436 KB Output is partially correct
32 Partially correct 44 ms 344 KB Output is partially correct
33 Partially correct 60 ms 344 KB Output is partially correct
34 Partially correct 77 ms 344 KB Output is partially correct
35 Correct 4 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Partially correct 36 ms 344 KB Output is partially correct
38 Partially correct 59 ms 460 KB Output is partially correct
39 Correct 6 ms 436 KB Output is correct
40 Correct 10 ms 344 KB Output is correct
41 Correct 4 ms 344 KB Output is correct
42 Correct 3 ms 344 KB Output is correct
43 Correct 8 ms 344 KB Output is correct
44 Correct 28 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Partially correct 61 ms 668 KB Output is partially correct
47 Partially correct 69 ms 940 KB Output is partially correct
48 Partially correct 51 ms 344 KB Output is partially correct