Submission #1034783

# Submission time Handle Problem Language Result Execution time Memory
1034783 2024-07-25T18:06:32 Z Mr_Husanboy Rarest Insects (IOI22_insects) C++17
47.51 / 100
159 ms 1184 KB
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
const int mod = 1000002022;

vector<int> state, p;
int n, m; 
vector<vector<int>> g;
template<typename T>
int len(T &a){return a.size();}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

void shuffle(vector<int> &a, int n){
  if(n == 1) return;
  random_shuffle(a.begin(), a.begin() + n);
  for(int i = 0; i < n; i ++){
    int aa = rng() % n, bb = rng() % n;
    while(bb == aa) bb = rng() % n;
    swap(a[aa], a[bb]);
  }
}


int min_cardinality(int n) {
  int l = 1, r = n + 1;

  vector<int> v;
  vector<int> done(n);
  for(int i = 0; i < n; i ++){
    move_inside(i);
    if(press_button() == 2){
      move_outside(i);
    }else v.push_back(i), done[i] = 1;
  }

  auto check = [&](int m)->bool{
    vector<int> rem;
    for(int i = 0; i < n; i ++){
      if(done[i]) continue;
      move_inside(i);
      if(press_button() <= m){
        rem.push_back(i);
      }else{
        move_outside(i);
      }
    }
    for(auto u : rem) move_outside(u);
    //cout << m << ' ' << len(v) + len(rem) << endl;
    return len(v) + len(rem) < len(v) * m;
  };

  while(r - l > 1){
    int m = (l + r) / 2;
    if(check(m)){
      r = m;
    }else l = m;
  }
  return l;
}
# 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 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 11 ms 344 KB Output is correct
7 Correct 2 ms 436 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 10 ms 600 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 436 KB Output is correct
18 Correct 8 ms 440 KB Output is correct
19 Correct 10 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 3 ms 444 KB Output is correct
# 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 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 11 ms 344 KB Output is correct
7 Correct 2 ms 436 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 10 ms 600 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 436 KB Output is correct
18 Correct 8 ms 440 KB Output is correct
19 Correct 10 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 3 ms 444 KB Output is correct
23 Correct 54 ms 440 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 43 ms 444 KB Output is correct
26 Correct 49 ms 432 KB Output is correct
27 Correct 59 ms 344 KB Output is correct
28 Correct 27 ms 448 KB Output is correct
29 Correct 56 ms 408 KB Output is correct
30 Correct 54 ms 444 KB Output is correct
31 Correct 59 ms 444 KB Output is correct
32 Correct 73 ms 440 KB Output is correct
33 Correct 54 ms 444 KB Output is correct
34 Correct 60 ms 344 KB Output is correct
35 Correct 53 ms 600 KB Output is correct
36 Correct 52 ms 440 KB Output is correct
37 Correct 62 ms 600 KB Output is correct
38 Correct 74 ms 444 KB Output is correct
39 Correct 47 ms 344 KB Output is correct
40 Correct 26 ms 344 KB Output is correct
41 Correct 40 ms 344 KB Output is correct
# 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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Partially correct 1 ms 344 KB Output is partially correct
7 Partially correct 152 ms 444 KB Output is partially correct
8 Correct 8 ms 344 KB Output is correct
9 Partially correct 159 ms 680 KB Output is partially correct
10 Partially correct 134 ms 848 KB Output is partially correct
11 Partially correct 141 ms 424 KB Output is partially correct
12 Partially correct 66 ms 452 KB Output is partially correct
13 Partially correct 143 ms 344 KB Output is partially correct
14 Partially correct 128 ms 676 KB Output is partially correct
15 Partially correct 156 ms 684 KB Output is partially correct
16 Partially correct 141 ms 692 KB Output is partially correct
17 Partially correct 122 ms 924 KB Output is partially correct
18 Partially correct 113 ms 856 KB Output is partially correct
19 Partially correct 115 ms 688 KB Output is partially correct
20 Partially correct 116 ms 1184 KB Output is partially correct
21 Partially correct 110 ms 684 KB Output is partially correct
22 Partially correct 131 ms 656 KB Output is partially correct
23 Partially correct 116 ms 812 KB Output is partially correct
24 Partially correct 107 ms 668 KB Output is partially correct
25 Partially correct 73 ms 684 KB Output is partially correct
26 Partially correct 48 ms 600 KB Output is partially correct
27 Partially correct 123 ms 932 KB Output is partially correct
28 Partially correct 129 ms 568 KB Output is partially correct
29 Partially correct 119 ms 896 KB Output is partially correct
30 Partially correct 119 ms 688 KB Output is partially correct
31 Partially correct 139 ms 1072 KB Output is partially correct
32 Partially correct 128 ms 692 KB Output is partially correct
33 Partially correct 122 ms 656 KB Output is partially correct
34 Partially correct 132 ms 664 KB Output is partially correct
35 Partially correct 155 ms 636 KB Output is partially correct
36 Partially correct 119 ms 932 KB Output is partially correct
37 Partially correct 127 ms 688 KB Output is partially correct
38 Partially correct 143 ms 900 KB Output is partially correct
39 Partially correct 142 ms 628 KB Output is partially correct
40 Partially correct 134 ms 924 KB Output is partially correct
41 Partially correct 116 ms 932 KB Output is partially correct
42 Partially correct 145 ms 892 KB Output is partially correct
43 Partially correct 20 ms 600 KB Output is partially correct
44 Partially correct 117 ms 600 KB Output is partially correct
45 Partially correct 138 ms 836 KB Output is partially correct
46 Partially correct 64 ms 344 KB Output is partially correct
47 Partially correct 85 ms 592 KB Output is partially correct
48 Partially correct 66 ms 600 KB Output is partially correct