oj.uz

Submission #1034813

# Submission time Handle Problem Language Result Execution time Memory
1034813 2024-07-25T18:58:00 Z Mr_Husanboy Rarest Insects (IOI22_insects) C++17
25 / 100
 228 ms 940 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);

 
  auto check = [&](int m)->int{
    vector<int> rem;
    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);
      }
    }
    for(auto u : rem) move_outside(u);
    return dis + len(rem);
  };
  int cur = n / dis;
  while(cur > 1){
    int cnt = check(cur);
    //cout << cur << ' ' << cnt << endl;
    if(cnt == cur * dis){
      return cur;
    }else cur = cnt / dis;
  }
  return cur;
}

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 1 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 6 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 18 ms 600 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 440 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 12 ms 344 KB Output is correct
19 Correct 10 ms 600 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 444 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 1 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 6 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 18 ms 600 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 6 ms 440 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 12 ms 344 KB Output is correct
19 Correct 10 ms 600 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 444 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 9 ms 600 KB Output is correct
26 Correct 61 ms 448 KB Output is correct
27 Correct 55 ms 600 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 102 ms 344 KB Output is correct
30 Correct 214 ms 676 KB Output is correct
31 Correct 38 ms 444 KB Output is correct
32 Correct 77 ms 444 KB Output is correct
33 Correct 81 ms 344 KB Output is correct
34 Correct 57 ms 440 KB Output is correct
35 Correct 39 ms 344 KB Output is correct
36 Correct 78 ms 600 KB Output is correct
37 Correct 31 ms 448 KB Output is correct
38 Correct 33 ms 696 KB Output is correct
39 Correct 18 ms 344 KB Output is correct
40 Correct 5 ms 344 KB Output is correct
41 Correct 6 ms 344 KB Output is correct

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 Correct 1 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 18 ms 344 KB Output is correct
10 Partially correct 174 ms 940 KB Output is partially correct
11 Partially correct 120 ms 420 KB Output is partially correct
12 Correct 8 ms 344 KB Output is correct
13 Incorrect 228 ms 344 KB Too many queries.
14 Halted 0 ms 0 KB -