Submission #1034379

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1034379	2024-07-25T12:57:28 Z	Mr_Husanboy	Rarest Insects (IOI22_insects)	C++17	10 / 100	47 ms	596 KB

insects

#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();}


int min_cardinality(int n) {
  vector<int> cnt(n);
  vector<int> type(n);
  int cur = 0;
  for(int i = 0; i < n; i ++){
    move_inside(i);
    if(press_button() == 1){
      type[cur] = i;
      //cout << i << ' ' << cur << endl;
      cnt[cur] ++;
      cur ++;
      continue;
    }
    int l = -1, r = cur - 1;
    int j = cur - 1;
    while(r - l > 1){
      int m = (l + r) / 2;
      while(j < m){
        j ++;
        move_inside(type[j]);
      }
      while(j > m){
        move_outside(type[j]);
        j --;
      }

      if(press_button() == 2){
        r = m;
      }else l = m;
    }
    while(j + 1 < cur){
      j ++;
      move_inside(type[j]);
    }
    move_outside(i);
    cnt[r] ++;
    //cout << i << '-' << r << endl;
  }
  int ans = n;
  for(int i = 0; i < cur; i ++){
    ans = min(ans, cnt[i]);
  }
  return ans;
}

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	356 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	Correct	4 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	2 ms	596 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct
14	Correct	5 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	6 ms	344 KB	Output is correct
19	Correct	6 ms	344 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	5 ms	344 KB	Output is correct
22	Correct	3 ms	596 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	0 ms	356 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	Correct	4 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	2 ms	596 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct
14	Correct	5 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	6 ms	344 KB	Output is correct
19	Correct	6 ms	344 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	5 ms	344 KB	Output is correct
22	Correct	3 ms	596 KB	Output is correct
23	Correct	4 ms	344 KB	Output is correct
24	Correct	5 ms	344 KB	Output is correct
25	Correct	32 ms	344 KB	Output is correct
26	Correct	32 ms	344 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Incorrect	23 ms	344 KB	Too many queries.
29	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	Correct	0 ms	344 KB	Output is correct
7	Correct	10 ms	344 KB	Output is correct
8	Correct	12 ms	344 KB	Output is correct
9	Incorrect	47 ms	344 KB	Too many queries.
10	Halted	0 ms	0 KB	-