oj.uz

답안 #1079549

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079549 2024-08-28T16:44:04 Z Lalic 드문 곤충 (IOI22_insects) C++17
0 / 100
 83 ms 456 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

int min_cardinality(int N) {
	queue<int> q;
	vector<int> aux;
	
	int tipos=0;
	for(int i=0;i<N;i++){
		move_inside(i);
		int curr=press_button();
		
		if(curr>=2) move_outside(i);
		else{
			tipos++;
			q.push(i);
			aux.pb(i);
		}
	}
	
	if(tipos==1) return N;
	
	while(!q.empty()){
		move_outside(q.front());
		q.pop();
	}
	
	if(tipos<=(8*N)/2000){
		int ans=N;
		
		for(auto u : aux){
			int ret=1;
			move_inside(u);
			
			for(int i=0;i<N;i++){
				if(i==u) continue;
				
				move_inside(i);
				int at=press_button();
				
				if(at==2) ret++;
				
				move_outside(i);
			}
			
			move_outside(u);
			
			ans=max(ans, ret);
		}
		
		return ans;
	}
	
	int low=1, high=(N/tipos)-1, best=N/tipos;
	while(low<=high){
		int mid=(low+high)>>1;
		
		while(!q.empty()){
			move_outside(q.front());
			q.pop();
		}
		
		int qnt=0;
		for(int i=0;i<N;i++){
			move_inside(i);
			int curr=press_button();
			
			if(curr>mid) move_outside(i);
			else{
				qnt++;
				q.push(i);
			}
		}
		
		if(qnt/mid==tipos){
			best=mid;
			low=mid+1;
		}
		else high=mid-1;
	}
	
	return best;
}

Subtask #1
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 Incorrect 0 ms 344 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 0 ms 344 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 344 KB Output is correct
6 Partially correct 1 ms 344 KB Output is partially correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 10 ms 456 KB Output is correct
9 Incorrect 83 ms 432 KB Wrong answer.
10 Halted 0 ms 0 KB -