Submission #1034828

# Submission time Handle Problem Language Result Execution time Memory
1034828 2024-07-25T19:15:50 Z Mr_Husanboy Rarest Insects (IOI22_insects) C++17
50.03 / 100
135 ms 948 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) {
 
  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;
  }
  if(len(v) == 1){
    return n;
  }
  int dis = len(v);
  int l = 1, r = n / dis + 1;

 
  auto check = [&](int m)->bool{
    vector<int> rem;
    vector<int> rem2;
    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);
        rem2.push_back(i);
      }
    }
    // if(dis + len(rem) == dis * m){
      for(auto u : rem) move_outside(u);
    // }else{
    //   for(auto u : rem) move_outside(u);
    //   // for(auto u : rem2) done[u] = 1;
    // }
    return dis + len(rem) == dis * m;
  };

  while(r - l > 1){
    int m = (l + r) / 2;
    if(check(m)){
      l = m;
    }else r = 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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 436 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 6 ms 440 KB Output is correct
15 Correct 6 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 4 ms 440 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 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 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 5 ms 344 KB Output is correct
9 Correct 4 ms 436 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 6 ms 440 KB Output is correct
15 Correct 6 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 4 ms 440 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 600 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 344 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 44 ms 440 KB Output is correct
26 Correct 30 ms 340 KB Output is correct
27 Correct 55 ms 428 KB Output is correct
28 Correct 5 ms 444 KB Output is correct
29 Correct 58 ms 444 KB Output is correct
30 Correct 32 ms 344 KB Output is correct
31 Correct 48 ms 344 KB Output is correct
32 Correct 43 ms 424 KB Output is correct
33 Correct 38 ms 344 KB Output is correct
34 Correct 47 ms 448 KB Output is correct
35 Correct 30 ms 344 KB Output is correct
36 Correct 42 ms 692 KB Output is correct
37 Correct 33 ms 600 KB Output is correct
38 Correct 24 ms 436 KB Output is correct
39 Correct 17 ms 676 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 7 ms 448 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 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Partially correct 85 ms 696 KB Output is partially correct
10 Partially correct 61 ms 444 KB Output is partially correct
11 Partially correct 122 ms 440 KB Output is partially correct
12 Correct 10 ms 344 KB Output is correct
13 Partially correct 109 ms 440 KB Output is partially correct
14 Partially correct 64 ms 600 KB Output is partially correct
15 Partially correct 102 ms 908 KB Output is partially correct
16 Partially correct 120 ms 424 KB Output is partially correct
17 Partially correct 106 ms 688 KB Output is partially correct
18 Partially correct 109 ms 592 KB Output is partially correct
19 Partially correct 120 ms 684 KB Output is partially correct
20 Partially correct 80 ms 680 KB Output is partially correct
21 Partially correct 78 ms 668 KB Output is partially correct
22 Partially correct 69 ms 344 KB Output is partially correct
23 Partially correct 36 ms 436 KB Output is partially correct
24 Correct 19 ms 596 KB Output is correct
25 Correct 12 ms 592 KB Output is correct
26 Correct 8 ms 452 KB Output is correct
27 Partially correct 73 ms 436 KB Output is partially correct
28 Partially correct 64 ms 676 KB Output is partially correct
29 Partially correct 96 ms 344 KB Output is partially correct
30 Partially correct 104 ms 680 KB Output is partially correct
31 Partially correct 58 ms 948 KB Output is partially correct
32 Partially correct 76 ms 692 KB Output is partially correct
33 Partially correct 48 ms 600 KB Output is partially correct
34 Partially correct 49 ms 604 KB Output is partially correct
35 Partially correct 86 ms 688 KB Output is partially correct
36 Partially correct 103 ms 596 KB Output is partially correct
37 Partially correct 77 ms 684 KB Output is partially correct
38 Partially correct 83 ms 440 KB Output is partially correct
39 Partially correct 46 ms 688 KB Output is partially correct
40 Partially correct 58 ms 600 KB Output is partially correct
41 Partially correct 80 ms 444 KB Output is partially correct
42 Partially correct 87 ms 600 KB Output is partially correct
43 Partially correct 18 ms 344 KB Output is partially correct
44 Partially correct 102 ms 436 KB Output is partially correct
45 Partially correct 135 ms 772 KB Output is partially correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 17 ms 592 KB Output is correct
48 Correct 10 ms 344 KB Output is correct