oj.uz

답안 #830870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830870 2023-08-19T12:00:38 Z caganyanmaz 드문 곤충 (IOI22_insects) C++17
25 / 100
 116 ms 460 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 = 100;

int n;
set<int> basis;
set<int> machine;

bool check(int val)
{
	vector<int> ci;
	for (int i = 0; i < n; i++)
	{
		if (basis.find(i) != machine.end())
			continue;
		move_inside(i);
		machine.insert(i);
		ci.pb(i);
		if (press_button() > val)
		{
			ci.pop_back();
			move_outside(i);
			machine.erase(i);
		}
	}
	bool res = ci.size() == (val - 1) * basis.size();
	for (int i : ci)
		move_outside(i);
	return res;
}

int test_a()
{
	int l = 1, r = 1 + (n / basis.size());
	debug(l, r);
	while (r - l > 1)
	{
		int m = l+r>>1;
		debug(m);
		if(check(m))
		{
			l = m;
		}
		else
		{
			for (int i : machine)
				if (basis.find(i) == basis.end())
					machine.erase(i);
			r = m;
		}
	}
	debug(l);
	return l;
}
vector<int> bs;

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 = l; i < m; i++)
	{
		if (machine.find(bs[i]) != machine.end())
			continue;
		machine.insert(bs[i]);
		move_inside(bs[i]);
	}
	for (int i = m; i < r; i++)
	{
		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()
{
	
	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);
	}	
	for (int i : basis)
	{
		bs.pb(i);
		machine.insert(i);
	}
	if (basis.size() > BLOCK)
		return test_a();
	else
		return test_b();
	
}

Compilation message

insects.cpp: In function 'int test_a()':
insects.cpp:44:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |   int m = l+r>>1;
      |           ~^~
insects.cpp: In function 'int get_min(int, int, std::vector<int>&)':
insects.cpp:70:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |  int m = l+r>>1;
      |          ~^~

Subtask #1
10.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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 3 ms 304 KB Output is correct
11 Correct 8 ms 316 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 6 ms 300 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 4 ms 296 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 3 ms 304 KB Output is correct
11 Correct 8 ms 316 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 7 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 6 ms 300 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 4 ms 296 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 7 ms 300 KB Output is correct
24 Correct 9 ms 316 KB Output is correct
25 Correct 51 ms 288 KB Output is correct
26 Correct 38 ms 296 KB Output is correct
27 Correct 11 ms 300 KB Output is correct
28 Correct 9 ms 304 KB Output is correct
29 Correct 27 ms 208 KB Output is correct
30 Correct 36 ms 288 KB Output is correct
31 Correct 23 ms 292 KB Output is correct
32 Correct 19 ms 304 KB Output is correct
33 Correct 29 ms 288 KB Output is correct
34 Correct 33 ms 304 KB Output is correct
35 Correct 32 ms 208 KB Output is correct
36 Correct 38 ms 292 KB Output is correct
37 Correct 33 ms 296 KB Output is correct
38 Correct 54 ms 336 KB Output is correct
39 Correct 7 ms 408 KB Output is correct
40 Correct 9 ms 304 KB Output is correct
41 Correct 8 ms 312 KB Output is correct

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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 15 ms 280 KB Output is correct
8 Correct 14 ms 460 KB Output is correct
9 Partially correct 106 ms 416 KB Output is partially correct
10 Partially correct 102 ms 308 KB Output is partially correct
11 Correct 25 ms 292 KB Output is correct
12 Correct 20 ms 300 KB Output is correct
13 Partially correct 24 ms 320 KB Output is partially correct
14 Partially correct 74 ms 304 KB Output is partially correct
15 Partially correct 43 ms 292 KB Output is partially correct
16 Partially correct 45 ms 296 KB Output is partially correct
17 Partially correct 56 ms 420 KB Output is partially correct
18 Partially correct 60 ms 304 KB Output is partially correct
19 Partially correct 67 ms 288 KB Output is partially correct
20 Partially correct 80 ms 308 KB Output is partially correct
21 Partially correct 110 ms 312 KB Output is partially correct
22 Partially correct 96 ms 208 KB Output is partially correct
23 Correct 13 ms 208 KB Output is correct
24 Correct 14 ms 444 KB Output is correct
25 Correct 16 ms 328 KB Output is correct
26 Correct 18 ms 332 KB Output is correct
27 Partially correct 111 ms 300 KB Output is partially correct
28 Partially correct 60 ms 416 KB Output is partially correct
29 Partially correct 73 ms 288 KB Output is partially correct
30 Partially correct 79 ms 312 KB Output is partially correct
31 Partially correct 106 ms 284 KB Output is partially correct
32 Partially correct 116 ms 308 KB Output is partially correct
33 Incorrect 18 ms 284 KB Wrong answer.
34 Halted 0 ms 0 KB -