oj.uz

답안 #830696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830696 2023-08-19T09:31:58 Z caganyanmaz 드문 곤충 (IOI22_insects) C++17
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
#include "insects.h"
#define pb push_back
using namespace std;

//#include "../debug.h"
#define debug(x...) void(42)


constexpr static int BLOCK = 50;

int n;
set<int> basis;

bool check(int val)
{
	vector<int> ci;
	int counter = basis.size();
	for (int i = 0; i < n; i++)
	{
		if (basis.find(i) != basis.end())
			continue;
		move_inside(i);
		counter++;
		if (press_button() > val)
		{
			move_outside(i);
			counter--;
		}
	}
	return counter >= val * basis.size();
}

int test_a()
{
	int l = -1, r = 5 + (n / basis.size());
	while (r - l > 1)
	{
		int m = l+r>>1;
		if(check(m))
			l = m;
		else
			r = m;
	}
	return l;
}
vector<int> bs;
set<int> machine;

int get_min(int l, int r, vector<int>& v)
{
	if (r - l == 1)
	{
		debug(l, v);
		return v.size()+1;
	}
	int m = l+r>>1;
	for (int i = 0; i < n; i++)
	{
		if (i >= l && i < m)
		{
			if (machine.find(bs[i]) != machine.end())
				continue;
			machine.insert(bs[i]);
			move_inside(bs[i]);
		}
		if (i < l || i >= m)
		{
			if (machine.find(bs[i]) == machine.end())
				continue;
			machine.erase(bs[i]);
			move_outside(bs[i]);
		
		}
	}
	vector<int> lv, rv;
	for (int i : v)
	{
		move_inside(i);
		if (press_button() > 1)
			lv.pb(i);
		else
			rv.pb(i);
		move_outside(i);
	}
	int lres = get_min(l, m, lv);
	int rres = get_min(m, r, rv);
	return min(lres, rres);

}

int test_b()
{
	for (int i : basis)
	{
		bs.pb(i);
		machine.insert(i);
	}
	vector<int> v;
	for (int i = 0; i < n; i++)
		if (basis.find(i) == basis.end())
			v.pb(i);
	return get_min(0, bs.size(), v);
}

int min_cardinality(int N)
{
	n = N;
	for (int i = 0; i < n; i++)
	{
		move_inside(i);
		if (press_button() > 1)
			move_outside(i);
		else
			basis.insert(i);
	}	
	if (basis.size() > BLOCK)
		return test_a();
	else
		return test_b();
	
}

Compilation message

insects.cpp: In function 'bool check(int)':
insects.cpp:31:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  return counter >= val * basis.size();
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
insects.cpp: In function 'int test_a()':
insects.cpp:39:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |   int m = l+r>>1;
      |           ~^~
insects.cpp: In function 'int get_min(int, int, std::vector<int>&)':
insects.cpp:57:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |  int m = l+r>>1;
      |          ~^~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 208 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 208 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Incorrect 0 ms 208 KB Wrong answer.
7 Halted 0 ms 0 KB -