oj.uz

Submission #652137

# Submission time Handle Problem Language Result Execution time Memory
652137 2022-10-21T12:30:00 Z dXqwq Rarest Insects (IOI22_insects) C++17
100 / 100
 69 ms 304 KB 
#include<bits/stdc++.h>
#ifdef local
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int N);
#else
#include"insects.h"
#endif
using namespace std;
bool vis[2003],flg[2003],fix[2003];
int d,cnt;
void clear(int n)
{
	for(int i=0; i<n; ++i)
		if(vis[i]&&!fix[i])
			vis[i]=0,--cnt,move_outside(i);
	return ;
}
int min_cardinality(int n)
{
	for(int i=0; i<n; ++i)
	{
		vis[i]=1,++cnt,move_inside(i);
		if(press_button()>1)
			vis[i]=0,--cnt,move_outside(i);
		else ++d;
	}
	int l=2,r=n/d,res=1,lst=1;
	memset(flg,1,sizeof(flg));
	while(l<=r)
	{
		int mid=(l+r+rand()%2)>>1;
		if(mid<lst)
		{
			for(int i=0; i<n; ++i) flg[i]&=vis[i];
			clear(n);
		}
		else
		{
			for(int i=0; i<n; ++i) fix[i]|=vis[i];
		}
		for(int i=0; i<n; ++i) if(!vis[i]&&flg[i])
		{
			vis[i]=1,++cnt,move_inside(i);
			if(press_button()>mid)
				vis[i]=0,--cnt,move_outside(i);
			if(cnt==d*mid) break;
		}
		if(cnt==d*mid) res=mid,l=mid+1;
		else r=mid-1;
		lst=mid;
	}
	return res;
}
#ifdef local
#include <cassert>
#include <cstdio>

#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <vector>

static inline constexpr int kMaxQueries = 40000;

static int N;
// Insect types are compressed to colors in the range [0, N).
static std::vector<int> color;
static std::vector<bool> in_box;

static std::vector<int> color_occurrences;
static std::multiset<int> max_occurrences;

static std::vector<int> op_counter(3, 0);

static inline void protocol_violation(std::string message) {
  printf("Protocol Violation: %s\n", message.c_str());
  exit(0);
}

void move_inside(int i) {
  if (i < 0 || i >= N) {
    protocol_violation("invalid parameter");
  }
  ++op_counter[0];
  if (op_counter[0] > kMaxQueries) {
    protocol_violation("too many calls");
  }
  if (!in_box[i]) {
    in_box[i] = true;
    max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
    ++color_occurrences[color[i]];
    max_occurrences.insert(color_occurrences[color[i]]);
  }
}

void move_outside(int i) {
  if (i < 0 || i >= N) {
    protocol_violation("invalid parameter");
  }
  ++op_counter[1];
  if (op_counter[1] > kMaxQueries) {
    protocol_violation("too many calls");
  }
  if (in_box[i]) {
    in_box[i] = false;
    max_occurrences.erase(max_occurrences.find(color_occurrences[color[i]]));
    --color_occurrences[color[i]];
    max_occurrences.insert(color_occurrences[color[i]]);
  }
}

int press_button() {
  ++op_counter[2];
  if (op_counter[2] > kMaxQueries) {
    protocol_violation("too many calls");
  }
  return *(max_occurrences.rbegin());
}

int main() {
  assert(1 == scanf("%d", &N));
  color.resize(N);
  in_box.assign(N, false);

  std::map<int, int> type_to_color;
  map<int,int> mp;
  for (int i = 0; i < N; ++i) {
    int Ti;
    assert(1 == scanf("%d", &Ti));
    ++mp[Ti];
    if (type_to_color.find(Ti) == type_to_color.end()) {
      int new_color = type_to_color.size();
      type_to_color[Ti] = new_color;
      max_occurrences.insert(0);
    }
    color[i] = type_to_color[Ti];
  }
  int std=N;
  for(auto i:mp) std=min(std,i.second);
  color_occurrences.assign(type_to_color.size(), 0);

  int answer = min_cardinality(N);
  int Q = *std::max_element(op_counter.begin(), op_counter.end());
  printf("%d %d\n", answer,std);
  printf("%d\n", Q);
  return 0;
}
#endif

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 280 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 4 ms 208 KB Output is correct
8 Correct 6 ms 208 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 280 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 14 ms 208 KB Output is correct
24 Correct 11 ms 260 KB Output is correct
25 Correct 24 ms 208 KB Output is correct
26 Correct 24 ms 208 KB Output is correct
27 Correct 26 ms 208 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 27 ms 208 KB Output is correct
30 Correct 25 ms 208 KB Output is correct
31 Correct 28 ms 208 KB Output is correct
32 Correct 23 ms 208 KB Output is correct
33 Correct 34 ms 208 KB Output is correct
34 Correct 23 ms 208 KB Output is correct
35 Correct 22 ms 208 KB Output is correct
36 Correct 29 ms 208 KB Output is correct
37 Correct 25 ms 208 KB Output is correct
38 Correct 32 ms 208 KB Output is correct
39 Correct 20 ms 208 KB Output is correct
40 Correct 13 ms 208 KB Output is correct
41 Correct 9 ms 208 KB Output is correct

Subtask #3
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 41 ms 208 KB Output is correct
8 Correct 15 ms 208 KB Output is correct
9 Correct 46 ms 208 KB Output is correct
10 Correct 62 ms 292 KB Output is correct
11 Correct 59 ms 208 KB Output is correct
12 Correct 33 ms 208 KB Output is correct
13 Correct 57 ms 208 KB Output is correct
14 Correct 60 ms 208 KB Output is correct
15 Correct 36 ms 208 KB Output is correct
16 Correct 55 ms 208 KB Output is correct
17 Correct 57 ms 208 KB Output is correct
18 Correct 27 ms 208 KB Output is correct
19 Correct 35 ms 208 KB Output is correct
20 Correct 46 ms 208 KB Output is correct
21 Correct 60 ms 208 KB Output is correct
22 Correct 67 ms 208 KB Output is correct
23 Correct 37 ms 208 KB Output is correct
24 Correct 48 ms 208 KB Output is correct
25 Correct 17 ms 208 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 55 ms 208 KB Output is correct
28 Correct 41 ms 208 KB Output is correct
29 Correct 50 ms 208 KB Output is correct
30 Correct 43 ms 208 KB Output is correct
31 Correct 27 ms 208 KB Output is correct
32 Correct 69 ms 288 KB Output is correct
33 Correct 24 ms 288 KB Output is correct
34 Correct 59 ms 304 KB Output is correct
35 Correct 26 ms 208 KB Output is correct
36 Correct 50 ms 208 KB Output is correct
37 Correct 45 ms 304 KB Output is correct
38 Correct 41 ms 284 KB Output is correct
39 Correct 39 ms 208 KB Output is correct
40 Correct 44 ms 208 KB Output is correct
41 Correct 34 ms 208 KB Output is correct
42 Correct 50 ms 208 KB Output is correct
43 Correct 14 ms 208 KB Output is correct
44 Correct 38 ms 208 KB Output is correct
45 Correct 35 ms 208 KB Output is correct
46 Correct 27 ms 208 KB Output is correct
47 Correct 28 ms 208 KB Output is correct
48 Correct 28 ms 208 KB Output is correct