oj.uz

답안 #871231

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871231 2023-11-10T09:51:12 Z Lib 드문 곤충 (IOI22_insects) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
#include "insects.h"
//#include "stub.cpp"
using namespace std;
 
vector <int> PrevIndexIn,PrevIndexOut,RemainingInsects;
int InMachine[2003];
int n;
int TypeCount=0;
int CurrentInMachine=0;
 
int PossibleMincount(int cnt){
	PrevIndexIn.clear();
	PrevIndexOut.clear();
	//Pushing insects inside the machine, keeping track of the ones being putted inside for this iteration of binary searching
	for(int i=0;i<RemainingInsects.size();i++){
		move_inside(RemainingInsects[i]);
		InMachine[RemainingInsects[i]]=1;
		PrevIndexIn.push_back(RemainingInsects[i]);
		if(press_button()>cnt){
			PrevIndexIn.pop_back();
			PrevIndexOut.push_back(RemainingInsects[i]);
			InMachine[RemainingInsects[i]]=0;
			move_outside(i);
		}
	}
	CurrentInMachine=0;
	for(int i=0;i<RemainingInsects.size();i++){
		CurrentInMachine+=InMachine[RemainingInsects[i]];
	}
	RemainingInsects.clear();
	if(CurrentInMachine<cnt*TypeCount){
		//There clearly exist a type of insect with cardinality less than cnt, so the answer is less than cnt. Removing insects from last iteration.
		while(!PrevIndexIn.empty()){
			InMachine[PrevIndexIn.back()]=0;
			move_outside(PrevIndexIn.back());
			PrevIndexIn.pop_back();
		}
		for(int i=0;i<n;i++){
			if(!InMachine[i]){
				RemainingInsects.push_back(i);
			}
		}
		return 0;
	}else if(CurrentInMachine==cnt*TypeCount){
		//As every type of insects has at least cnt insects, the answer is at least cnt. Just return true
		for(int i=0;i<n;i++){
			if(!InMachine[i]){
				RemainingInsects.push_back(i);
			}
		}
		return 1;
	}
}
 
int min_cardinality(int N){
	//Remember to initialize as this is multitest
	for(int i=0;i<N;i++){
    InMachine[i]=0;
    }
	int l,r,mid;
	n=N;
	l=1;
	//Phase 1: Determining the amount of different types of insects
	for(int i=0;i<n;i++){
		move_inside(i);
		InMachine[i]=1;
		PrevIndexIn.push_back(i);
		if(press_button()>1){
			move_outside(i);
			InMachine[i]=0;
			PrevIndexIn.pop_back();
			PrevIndexOut.push_back(i);
		}
	}
	for(int i=0;i<n;i++){
			if(!InMachine[i]){
				RemainingInsects.push_back(i);
			}
		}
	TypeCount=PrevIndexIn.size();
	r=(n/TypeCount);
	
	//Phase 2: Binary search for the answer
	while(r-l>1){
		mid=(l+r)/2;
		if(PossibleMincount(mid)){
			l=mid;
		}else{
			r=mid-1;
		}
	}
	if(PossibleMincount(r)){
		return r;
	}else{
		return l;
	}
}

Compilation message

insects.cpp: In function 'int PossibleMincount(int)':
insects.cpp:16:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i=0;i<RemainingInsects.size();i++){
      |              ~^~~~~~~~~~~~~~~~~~~~~~~~
insects.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i=0;i<RemainingInsects.size();i++){
      |              ~^~~~~~~~~~~~~~~~~~~~~~~~
insects.cpp:54:1: warning: control reaches end of non-void function [-Wreturn-type]
   54 | }
      | ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong answer.
3 Halted 0 ms 0 KB -