oj.uz

Submission #1058163

# Submission time Handle Problem Language Result Execution time Memory
1058163 2024-08-14T08:46:58 Z mychecksedad Rarest Insects (IOI22_insects) C++17
10 / 100
 195 ms 600 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;
  for(int i = 0; i < n; ++i){
    // if(!used[v[i]]){
      tot++;
      move_inside(v[i]);
      co++;
      int car = press_button();
      if(car > k){
        move_outside(v[i]);
        --co;
      }
    // }
  }
  if(co % uniq == 0 && co / uniq == k){
    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 > last_car){
      move_outside(v[i]);
      a.pop_back();
    }
    // cout << i << endl;
  }
  uniq = a.size();
  if(a.size() <= n){
    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 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)){
      ans = m;
      l = m + 1;
    }else{
      r = m - 1;
    }
  }
  return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:84:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   84 |   if(a.size() <= n){
      |      ~~~~~~~~~^~~~
insects.cpp:93:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   93 |   if(a.size() > n/2){
      |      ~~~~~~~~~^~~~~
insects.cpp:100:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |     int m = l+r>>1;
      |             ~^~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 14 ms 344 KB Output is correct
21 Correct 17 ms 344 KB Output is correct
22 Correct 13 ms 344 KB Output is correct
23 Correct 9 ms 460 KB Output is correct
24 Correct 7 ms 468 KB Output is correct
25 Correct 59 ms 344 KB Output is correct
26 Correct 75 ms 600 KB Output is correct
27 Correct 7 ms 468 KB Output is correct
28 Correct 8 ms 468 KB Output is correct
29 Correct 15 ms 344 KB Output is correct
30 Correct 71 ms 340 KB Output is correct
31 Correct 19 ms 344 KB Output is correct
32 Correct 22 ms 344 KB Output is correct
33 Correct 33 ms 344 KB Output is correct
34 Correct 28 ms 344 KB Output is correct
35 Correct 34 ms 344 KB Output is correct
36 Correct 48 ms 344 KB Output is correct
37 Correct 111 ms 344 KB Output is correct
38 Incorrect 195 ms 344 KB Too many queries.
39 Halted 0 ms 0 KB -

Subtask #3
0 / 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 Correct 0 ms 344 KB Output is correct
7 Correct 16 ms 480 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Incorrect 175 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -