oj.uz

답안 #1042686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042686 2024-08-03T09:41:29 Z Nurislam 드문 곤충 (IOI22_insects) C++17
0 / 100
 7 ms 344 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

template <class F, class _S>
bool chmin(F &u, const _S &v){
	bool flag = false;
	if ( u > v ){
		u = v; flag |= true;
	}
	return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
	bool flag = false;
	if ( u < v ){
		u = v; flag |= true;
	}
	return flag;
}
int min_cardinality(int n) {
	vector<int> v;
	int k = 0;
	for(int i = 0; i < n; i++){
		move_inside(i);
		if(press_button() == 1){
			k++;
		}else {
			move_outside(i);
			v.pb(i);
		}
	}
	//~ for(auto i:v)cout << i << ' ';
	//~ cout << '\n';
	int l = 1, r = 2000, ans = 1;
	int cnt = k;
	while(l <= r){
		int m = (l+r)>>1;
		vector<int> up, dn;
		
		for(int i:v){
			move_inside(i);
			if(press_button() <= m){
				dn.pb(i);
			}else{
				up.pb(i);
				move_outside(i);
			}
		}
		
		if(k*m == (int)dn.size() + cnt){
			ans = m;
			l = m+1;
			v = up;
			cnt += dn.size();
		}else{
			r = m-1;
			v = dn;
		}
		
	}
	return ans;
}

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 1 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 7 ms 344 KB Wrong answer.
9 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 1 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 7 ms 344 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

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