oj.uz

Submission #628864

# Submission time Handle Problem Language Result Execution time Memory
628864 2022-08-13T18:42:25 Z welleyth Rarest Insects (IOI22_insects) C++17
60.31 / 100
 142 ms 436 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int CNTQ[3] = {};
int getQ(){
    return max(CNTQ[0],max(CNTQ[1],CNTQ[2]));
}

int min_cardinality(int N) {
//    for(int i = 0; i < 50; i++){
//        cout << i+1 << " " << i+1 << " ";
//    }
//    cout << "\n";
//    return 0;
    int col[N];
    for(int i = 0; i < N; i++) col[i] = 0;
    int c = 0;
    int mn = N;
    int pos[N+1];
    bool was[N];
    int pref[N+1];
    for(int i = 0; i <= N; i++) pos[i] = -1;
    for(int i = 0; i < N; i++) was[i] = false;
    for(int i = 0; i < N; i++) pref[i] = -1;
    bool in[N];
    vector<int> order;
    for(int i = 0; i < N; i++){
        move_inside(i);
        if(press_button() == 1){
            was[i] = 1;
            order.push_back(i);
        } else {
            move_outside(i);
        }
    }
    sort(order.begin(),order.end());
    c = order.size();
    if(c > N/26)
        shuffle(order.begin(),order.end(),rnd);
    for(int i = 0; i < order.size(); i++){
        col[order[i]] = i;
        pos[col[order[i]]] = order[i];
        in[i] = 1;
    }
    if(2*c > N){
        return 1;
    }
//    cerr << "ok\n";
//    for(int i = 0; i < c; i++){
//        cerr << "pos[i] = " << pos[i] << "\n";
//    }
    for(int bt = 0; (1 << bt) < c; bt++){
        for(int i = 0; i < c; i++){
            if(pos[i] == -1)
                continue;
            if(i >> bt & 1 && !in[i]){
                in[i] = 1;
                move_inside(pos[i]);
            }
            if((i >> bt & 1) == 0 && in[i]){
                move_outside(pos[i]);
                in[i] = 0;
            }
        }
        for(int i = 0; i < N; i++){
            if(was[i])
                continue;
            move_inside(i);
            int szIn = press_button();
            assert(szIn < 3);
            if(szIn == 2){
                col[i] |= (1 << bt);
            }
            move_outside(i);
        }
        map<int,int> cnt;
        for(int i = 0; i < N; i++){
            if(col[i] >= (1 << bt))
                continue;
            cnt[col[i]]++;
        }
//        cerr << "col: ";
//        for(int i = 0; i < N; i++){
//            cerr << col[i] << " ";
//        }
//        cerr << "\n";
        for(auto&[x,y] : cnt)
            mn = min(mn,y);
        if(mn == 1)
            return 1;
    }
    map<int,int> cnt;
    for(int i = 0; i < N; i++){
        cnt[col[i]]++;
    }
    for(auto&[x,y] : cnt)
        mn = min(mn,y);
    return mn;
}
/**
6
5 8 9 5 9 9

1 2 3 0 0 0

40
1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20

100
1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50

10
1 0 2 0 3 0 4 0 5 0

1
1

**/

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:41:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i = 0; i < order.size(); i++){
      |                    ~~^~~~~~~~~~~~~~
insects.cpp:22:9: warning: variable 'pref' set but not used [-Wunused-but-set-variable]
   22 |     int pref[N+1];
      |         ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 10 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 8 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 12 ms 208 KB Output is correct
20 Correct 5 ms 300 KB Output is correct
21 Correct 6 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 8 ms 320 KB Output is correct
25 Correct 38 ms 208 KB Output is correct
26 Correct 53 ms 208 KB Output is correct
27 Correct 16 ms 208 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 36 ms 208 KB Output is correct
30 Correct 44 ms 208 KB Output is correct
31 Correct 54 ms 208 KB Output is correct
32 Correct 17 ms 208 KB Output is correct
33 Correct 51 ms 208 KB Output is correct
34 Correct 36 ms 208 KB Output is correct
35 Correct 42 ms 208 KB Output is correct
36 Correct 53 ms 208 KB Output is correct
37 Correct 63 ms 296 KB Output is correct
38 Correct 60 ms 292 KB Output is correct
39 Correct 67 ms 296 KB Output is correct
40 Correct 51 ms 304 KB Output is correct
41 Correct 11 ms 208 KB Output is correct

Subtask #3
35.31 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 15 ms 208 KB Output is correct
8 Correct 20 ms 332 KB Output is correct
9 Partially correct 81 ms 312 KB Output is partially correct
10 Partially correct 135 ms 320 KB Output is partially correct
11 Correct 35 ms 208 KB Output is correct
12 Correct 23 ms 324 KB Output is correct
13 Partially correct 78 ms 208 KB Output is partially correct
14 Partially correct 112 ms 304 KB Output is partially correct
15 Partially correct 88 ms 208 KB Output is partially correct
16 Partially correct 73 ms 208 KB Output is partially correct
17 Partially correct 68 ms 208 KB Output is partially correct
18 Partially correct 72 ms 208 KB Output is partially correct
19 Partially correct 71 ms 208 KB Output is partially correct
20 Partially correct 89 ms 208 KB Output is partially correct
21 Partially correct 102 ms 308 KB Output is partially correct
22 Partially correct 86 ms 308 KB Output is partially correct
23 Partially correct 129 ms 316 KB Output is partially correct
24 Partially correct 109 ms 328 KB Output is partially correct
25 Partially correct 93 ms 316 KB Output is partially correct
26 Correct 16 ms 336 KB Output is correct
27 Partially correct 110 ms 308 KB Output is partially correct
28 Partially correct 108 ms 308 KB Output is partially correct
29 Partially correct 124 ms 208 KB Output is partially correct
30 Partially correct 116 ms 208 KB Output is partially correct
31 Partially correct 66 ms 304 KB Output is partially correct
32 Partially correct 124 ms 312 KB Output is partially correct
33 Partially correct 68 ms 304 KB Output is partially correct
34 Partially correct 129 ms 308 KB Output is partially correct
35 Partially correct 128 ms 208 KB Output is partially correct
36 Partially correct 108 ms 304 KB Output is partially correct
37 Partially correct 135 ms 308 KB Output is partially correct
38 Partially correct 115 ms 320 KB Output is partially correct
39 Partially correct 142 ms 436 KB Output is partially correct
40 Partially correct 74 ms 308 KB Output is partially correct
41 Partially correct 124 ms 312 KB Output is partially correct
42 Partially correct 125 ms 312 KB Output is partially correct
43 Partially correct 10 ms 208 KB Output is partially correct
44 Partially correct 67 ms 208 KB Output is partially correct
45 Correct 27 ms 208 KB Output is correct
46 Correct 37 ms 208 KB Output is correct
47 Correct 29 ms 336 KB Output is correct
48 Correct 31 ms 312 KB Output is correct