oj.uz

Submission #1034452

# Submission time Handle Problem Language Result Execution time Memory
1034452 2024-07-25T13:56:09 Z Mr_Husanboy Rarest Insects (IOI22_insects) C++17
10 / 100
 256 ms 600 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 dis = 0;
  vector<int> v;
  vector<int> done(n);
  for(int i = 0; i < n; i ++){
    move_inside(i);
    if(press_button() == 2){
      move_outside(i);
      continue;
    }
    v.push_back(i);
  }
  dis = len(v);
  int lim = sqrt(n) + 1;
  if(true){
    for(auto u : v){
      move_outside(u);
      done[u] = 1;
    }
    int ans = n;
    for(auto u : v){
      int cnt = 1;
      move_inside(u);
      for(int i = 0; i < n; i ++){
        if(done[i]) continue;
        move_inside(i);
        if(press_button() == 2){
          done[i] = 1;
          cnt ++;
        }
        move_outside(i);
      }
      move_outside(u);
      ans = min(ans, cnt);
    }
    return ans;
  }
  int ans = 1;
  while(true){
    for(auto u : v){
      move_inside(u);
      done[u] = 1;
    }

    v.clear();
    for(int i = 0; i < n;  i++){
      if(done[i]) continue;
      move_inside(i);
      if(press_button() == 2){
        move_outside(i); continue;
      }
      v.push_back(i);
    }
    if(len(v) != dis){
      break;
    }
    ans ++;
  } 

  return ans;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:44:7: warning: unused variable 'lim' [-Wunused-variable]
   44 |   int lim = sqrt(n) + 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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 5 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 5 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 10 ms 344 KB Output is correct
19 Correct 10 ms 344 KB Output is correct
20 Correct 11 ms 344 KB Output is correct
21 Correct 29 ms 344 KB Output is correct
22 Correct 16 ms 344 KB Output is correct

Subtask #2
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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 5 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 5 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 10 ms 344 KB Output is correct
19 Correct 10 ms 344 KB Output is correct
20 Correct 11 ms 344 KB Output is correct
21 Correct 29 ms 344 KB Output is correct
22 Correct 16 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 6 ms 600 KB Output is correct
25 Correct 88 ms 344 KB Output is correct
26 Correct 98 ms 344 KB Output is correct
27 Correct 11 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 17 ms 344 KB Output is correct
30 Correct 106 ms 344 KB Output is correct
31 Correct 15 ms 344 KB Output is correct
32 Correct 38 ms 344 KB Output is correct
33 Correct 36 ms 344 KB Output is correct
34 Correct 36 ms 344 KB Output is correct
35 Correct 68 ms 344 KB Output is correct
36 Correct 56 ms 344 KB Output is correct
37 Correct 161 ms 344 KB Output is correct
38 Incorrect 234 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 0 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 0 ms 344 KB Output is correct
7 Correct 14 ms 344 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Incorrect 256 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -