Submission #826841

# Submission time Handle Problem Language Result Execution time Memory
826841 2023-08-16T05:22:30 Z ttamx Rarest Insects (IOI22_insects) C++17
0 / 100
4 ms 304 KB
#include "insects.h"
#include<bits/stdc++.h>

using namespace std;

int min_cardinality(int n){
	vector<int> single,cur;
	for(int i=0;i<n;i++){
		move_inside(i);
		if(press_button()>1){
			cur.emplace_back(i);
			move_outside(i);
		}else{
			single.emplace_back(i);
		}
	}
	for(auto i:single)move_outside(i);
	int k=single.size();
	int l=1,r=n/k;
	k--;
	int cnt=0;
	while(l<r){
		int m=(l+r+1)/2;
		vector<int> vl,vr;
		shuffle(cur.begin(),cur.end(),mt19937_64(time(nullptr)));
		for(auto i:cur){
			if(vl.size()+cnt==k*m){
				vr.emplace_back(i);
				continue;
			}
			move_inside(i);
			if(press_button()>m){
				vr.emplace_back(i);
				move_outside(i);
			}else{
				vl.emplace_back(i);
			}
		}
		if(vl.size()+cnt==k*m){
			l=m;
			cnt+=vl.size();
			cur=vr;
		}else{
			r=m-1;
			for(auto i:vl)move_outside(i);
			cur=vl;
		}
	}
	return l;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:27:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |    if(vl.size()+cnt==k*m){
      |       ~~~~~~~~~~~~~^~~~~
insects.cpp:39:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |   if(vl.size()+cnt==k*m){
      |      ~~~~~~~~~~~~~^~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Incorrect 4 ms 208 KB Wrong answer.
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Incorrect 4 ms 208 KB Wrong answer.
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Incorrect 0 ms 208 KB Wrong answer.
6 Halted 0 ms 0 KB -