oj.uz

Submission #1058250

# Submission time Handle Problem Language Result Execution time Memory
1058250 2024-08-14T09:06:42 Z mychecksedad Rarest Insects (IOI22_insects) C++17
47.5 / 100
 118 ms 952 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define en cout << '\n'
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
const int N = 1e5+10;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int r(int l, int r){
  return uniform_int_distribution<int>(l, r)(rng);
}
vector<bool> used(N);
vector<int> v;
int n;
int test(int x){
  move_inside(x);
  int last_car = 1;
  vector<int> in;
  in.pb(x);
  for(int i =0 ; i < n; ++i){
    if(!used[v[i]]){
      move_inside(v[i]);
      int car = press_button();
      if(car == last_car){
        move_outside(v[i]);
      }else{
        in.pb(v[i]);
        used[v[i]] = 1;
        last_car++;
      }
    }
  }
  for(int x: in) move_outside(x);
    // cout << x << ' ' << last_car << '\n';
  return last_car;
}
int uniq;
bool is_big(int k){
  int co = 0, tot = 0;
  vi in;
  for(int i = 0; i < n; ++i){
    // if(!used[v[i]]){
      tot++;
      move_inside(v[i]);
      co++;
      int car = press_button();
      in.pb(v[i]);
      if(car > k){
        move_outside(v[i]);
        in.pop_back();
        --co;
      }
      // cout << car << ' ' << v[i] << ' ' << k << '\n';
    // }
  }
  for(int x: in) move_outside(x);
  // cout << co << ' ' << uniq << ' ' << k << '\n';
  if(k * uniq == co){
    return 1;
  }
  return 0;
}
int min_cardinality(int nn) { n=nn;
  
  for(int i = 0; i < n; ++i) v.pb(i);
  for(int i = 1; i < n; ++i) swap(v[i], v[r(0, i)]); 

  int last_car = 1;
  move_inside(v[0]);
  vector<int> a;
  a.pb(v[0]);
  for(int i = 1; i < n; ++i){
    move_inside(v[i]);
    v.pb(v[i]);
    int car = press_button();
    a.pb(v[i]);
    if(car > 1){
      move_outside(v[i]);
      a.pop_back();
    }
    // cout << i << endl;
  }
  uniq = a.size();
  if(a.size() <= 0){
    int ans = n;
    for(int c: a) used[c] = 1;
    for(int c: a) move_outside(c);
    for(int c: a){
      ans = min(ans, test(c));
    }
    return ans;
  }
  // if(a.size() > n/2){
  //   return 1;
  // }
  // for(int c: a) used[c] = 1;
  // for(int x: a) cout << x << ' ';
  // cout << "wtf";
  for(int c: a) move_outside(c);
  int l = 1, r = n / a.size(); int ans = r;
  while(l <= r){
    int m = l+r>>1;
    if(is_big(m)){
      // cout << m << ' ';
      ans = m;
      l = m + 1;
    }else{
      r = m - 1;
    }
  }
  return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:108:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  108 |     int m = l+r>>1;
      |             ~^~
insects.cpp:74:7: warning: unused variable 'last_car' [-Wunused-variable]
   74 |   int last_car = 1;
      |       ^~~~~~~~

Subtask #1
10.0 / 10.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 7 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.0 / 15.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 7 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 4 ms 344 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 35 ms 344 KB Output is correct
24 Correct 9 ms 344 KB Output is correct
25 Correct 26 ms 600 KB Output is correct
26 Correct 23 ms 592 KB Output is correct
27 Correct 50 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 41 ms 344 KB Output is correct
30 Correct 21 ms 344 KB Output is correct
31 Correct 50 ms 344 KB Output is correct
32 Correct 33 ms 468 KB Output is correct
33 Correct 33 ms 592 KB Output is correct
34 Correct 30 ms 592 KB Output is correct
35 Correct 37 ms 344 KB Output is correct
36 Correct 26 ms 468 KB Output is correct
37 Correct 25 ms 344 KB Output is correct
38 Correct 16 ms 344 KB Output is correct
39 Correct 14 ms 344 KB Output is correct
40 Correct 10 ms 588 KB Output is correct
41 Correct 10 ms 952 KB Output is correct

Subtask #3
22.5 / 75.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 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 Partially correct 118 ms 864 KB Output is partially correct
8 Correct 16 ms 344 KB Output is correct
9 Partially correct 69 ms 612 KB Output is partially correct
10 Partially correct 57 ms 584 KB Output is partially correct
11 Partially correct 107 ms 344 KB Output is partially correct
12 Correct 27 ms 460 KB Output is correct
13 Partially correct 101 ms 344 KB Output is partially correct
14 Partially correct 49 ms 600 KB Output is partially correct
15 Partially correct 86 ms 716 KB Output is partially correct
16 Partially correct 86 ms 712 KB Output is partially correct
17 Partially correct 82 ms 812 KB Output is partially correct
18 Partially correct 80 ms 836 KB Output is partially correct
19 Partially correct 80 ms 708 KB Output is partially correct
20 Partially correct 70 ms 704 KB Output is partially correct
21 Partially correct 62 ms 716 KB Output is partially correct
22 Partially correct 34 ms 464 KB Output is partially correct
23 Partially correct 44 ms 344 KB Output is partially correct
24 Correct 24 ms 456 KB Output is correct
25 Correct 17 ms 344 KB Output is correct
26 Correct 15 ms 588 KB Output is correct
27 Partially correct 57 ms 724 KB Output is partially correct
28 Partially correct 61 ms 716 KB Output is partially correct
29 Partially correct 75 ms 712 KB Output is partially correct
30 Partially correct 67 ms 700 KB Output is partially correct
31 Partially correct 52 ms 716 KB Output is partially correct
32 Partially correct 51 ms 480 KB Output is partially correct
33 Partially correct 39 ms 716 KB Output is partially correct
34 Partially correct 41 ms 464 KB Output is partially correct
35 Partially correct 59 ms 708 KB Output is partially correct
36 Partially correct 83 ms 576 KB Output is partially correct
37 Partially correct 63 ms 724 KB Output is partially correct
38 Partially correct 71 ms 696 KB Output is partially correct
39 Partially correct 49 ms 708 KB Output is partially correct
40 Partially correct 54 ms 592 KB Output is partially correct
41 Partially correct 69 ms 708 KB Output is partially correct
42 Partially correct 56 ms 728 KB Output is partially correct
43 Partially correct 18 ms 600 KB Output is partially correct
44 Partially correct 69 ms 600 KB Output is partially correct
45 Partially correct 118 ms 708 KB Output is partially correct
46 Correct 42 ms 472 KB Output is correct
47 Correct 26 ms 344 KB Output is correct
48 Correct 21 ms 344 KB Output is correct