oj.uz

답안 #871264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871264 2023-11-10T10:36:10 Z Lib 드문 곤충 (IOI22_insects) C++17
53.16 / 100
 97 ms 1112 KB 
#include <bits/stdc++.h>
#include "insects.h"
//#include "stub.cpp"
using namespace std;
int l,r,mid;
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(RemainingInsects[i]);
		}
	}
	CurrentInMachine=0;
	for(int i=0;i<n;i++){
		CurrentInMachine+=InMachine[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());
			PrevIndexOut.push_back(PrevIndexIn.back());
			PrevIndexIn.pop_back();
		}
		RemainingInsects=PrevIndexOut;
		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
		RemainingInsects=PrevIndexOut;
		PrevIndexIn.clear();
		return 1;
	}
}
 
int min_cardinality(int N){
	//Remember to initialize as this is multitest
	for(int i=0;i<N;i++){
    InMachine[i]=0;
    }
    PrevIndexIn.clear();
    PrevIndexOut.clear();
    RemainingInsects.clear();
	n=N;
	l=1;
	//Phase 1: Determining the amount of different types of insects
	TypeCount=0;
	for(int i=0;i<n;i++){
		move_inside(i);
		InMachine[i]=1;
		if(press_button()>1){
			move_outside(i);
			InMachine[i]=0;
		}else{
			TypeCount++;
		}
	}
	for(int i=0;i<n;i++){
			if(!InMachine[i]){
				RemainingInsects.push_back(i);
			}
		}
	r=(n/TypeCount);
	//Phase 2: Binary search for the answer
	while(r-l>=1){
		mid=(l+r+1)/2;
		if(PossibleMincount(mid)){
			l=mid;
		}else{
			r=mid-1;
		}
	}
	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:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 3 ms 600 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 436 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 3 ms 596 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 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 3 ms 600 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 436 KB Output is correct
16 Correct 3 ms 600 KB Output is correct
17 Correct 3 ms 600 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 3 ms 596 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 344 KB Output is correct
23 Correct 18 ms 704 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 12 ms 696 KB Output is correct
26 Correct 18 ms 600 KB Output is correct
27 Correct 53 ms 604 KB Output is correct
28 Correct 5 ms 448 KB Output is correct
29 Correct 41 ms 448 KB Output is correct
30 Correct 27 ms 600 KB Output is correct
31 Correct 18 ms 444 KB Output is correct
32 Correct 15 ms 856 KB Output is correct
33 Correct 15 ms 700 KB Output is correct
34 Correct 15 ms 848 KB Output is correct
35 Correct 15 ms 600 KB Output is correct
36 Correct 16 ms 856 KB Output is correct
37 Correct 14 ms 600 KB Output is correct
38 Correct 14 ms 696 KB Output is correct
39 Correct 12 ms 600 KB Output is correct
40 Correct 7 ms 600 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
28.16 / 75.0

# 결과 실행 시간 메모리 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 596 KB Output is correct
7 Correct 27 ms 436 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 30 ms 600 KB Output is correct
10 Partially correct 39 ms 436 KB Output is partially correct
11 Partially correct 94 ms 456 KB Output is partially correct
12 Correct 16 ms 692 KB Output is correct
13 Partially correct 97 ms 444 KB Output is partially correct
14 Partially correct 54 ms 452 KB Output is partially correct
15 Partially correct 29 ms 444 KB Output is partially correct
16 Partially correct 28 ms 848 KB Output is partially correct
17 Partially correct 28 ms 848 KB Output is partially correct
18 Partially correct 29 ms 848 KB Output is partially correct
19 Partially correct 29 ms 432 KB Output is partially correct
20 Partially correct 32 ms 684 KB Output is partially correct
21 Partially correct 36 ms 940 KB Output is partially correct
22 Partially correct 42 ms 692 KB Output is partially correct
23 Partially correct 36 ms 456 KB Output is partially correct
24 Correct 24 ms 592 KB Output is correct
25 Correct 11 ms 608 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 30 ms 340 KB Output is correct
28 Correct 26 ms 600 KB Output is correct
29 Partially correct 28 ms 452 KB Output is partially correct
30 Partially correct 29 ms 592 KB Output is partially correct
31 Partially correct 35 ms 712 KB Output is partially correct
32 Partially correct 36 ms 1104 KB Output is partially correct
33 Partially correct 43 ms 600 KB Output is partially correct
34 Partially correct 45 ms 692 KB Output is partially correct
35 Partially correct 28 ms 596 KB Output is partially correct
36 Partially correct 22 ms 848 KB Output is partially correct
37 Partially correct 37 ms 436 KB Output is partially correct
38 Partially correct 37 ms 692 KB Output is partially correct
39 Correct 26 ms 432 KB Output is correct
40 Correct 24 ms 448 KB Output is correct
41 Partially correct 31 ms 688 KB Output is partially correct
42 Partially correct 34 ms 448 KB Output is partially correct
43 Partially correct 14 ms 856 KB Output is partially correct
44 Partially correct 78 ms 680 KB Output is partially correct
45 Correct 27 ms 696 KB Output is correct
46 Correct 16 ms 696 KB Output is correct
47 Correct 14 ms 848 KB Output is correct
48 Correct 13 ms 1112 KB Output is correct