oj.uz

Submission #1034400

# Submission time Handle Problem Language Result Execution time Memory
1034400 2024-07-25T13:20:05 Z Mr_Husanboy Rarest Insects (IOI22_insects) C++17
0 / 100
 11 ms 344 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(all(a));
  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> cnt(n);
  vector<int> type(n);
  vector<int> ind(n);
  int cur = 0;
  for(int i = 0; i < n; i ++){
    move_inside(i);
    if(press_button() == 1){
      type[cur] = i;
      ind[cur] = cur;
      cnt[cur] ++;
      cur ++;
      continue;
    }
    //cout << cur << endl;
    shuffle(ind, cur);
    int j = cur - 1;
    while(j - 1 > 0){
      move_outside(type[ind[j]]);
      if(press_button() == 1){
        move_inside(type[ind[j]]);
        break;
      }
      j --;
    }
    cnt[ind[j]] ++;
    while(j + 1 < cur){
      j ++;
      move_inside(type[ind[j]]);
    }
    //cout << i << ' ' << ind[j] << endl;
    move_outside(i);
  }
  int ans = n;
  for(int i = 0; i < cur; i ++){
    ans = min(ans, cnt[i]);
  }
  return ans;
}

Subtask #1
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 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 11 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

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 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 Incorrect 11 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #3
0 / 75.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 Incorrect 1 ms 344 KB Wrong answer.
7 Halted 0 ms 0 KB -