oj.uz

Submission #830897

# Submission time Handle Problem Language Result Execution time Memory
830897 2023-08-19T12:41:33 Z caganyanmaz Rarest Insects (IOI22_insects) C++17
53.16 / 100
 166 ms 456 KB 
#include <bits/stdc++.h>
#include "insects.h"
#define pb push_back
using namespace std;


#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif

constexpr static int BLOCK = 10;

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

bool check(int val)
{
	for (int i = 0; i < n; i++)
	{
		if (machine.find(i) != machine.end())
			continue;
		move_inside(i);
		addition.insert(i);
		if (press_button() > val)
		{
			move_outside(i);
			addition.erase(i);
		}
	}
	bool res = ( machine.size() + addition.size() ) == val * basis.size();
	if (res)
		for (int i : addition)
			machine.insert(i);
	else
		for (int i : addition)
			move_outside(i);
	addition.clear();
	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
			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);
	}
	return test_a();
	if (basis.size() > BLOCK)
		return test_a();
	else
		return test_b();
	
}

Compilation message

insects.cpp: In function 'int test_a()':
insects.cpp:51:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |   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

# Verdict Execution time Memory 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 5 ms 296 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 12 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 11 ms 296 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 3 ms 296 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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 5 ms 296 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 12 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 11 ms 296 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 3 ms 296 KB Output is correct
18 Correct 6 ms 300 KB Output is correct
19 Correct 4 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 26 ms 208 KB Output is correct
24 Correct 7 ms 332 KB Output is correct
25 Correct 24 ms 304 KB Output is correct
26 Correct 42 ms 276 KB Output is correct
27 Correct 62 ms 208 KB Output is correct
28 Correct 9 ms 328 KB Output is correct
29 Correct 78 ms 288 KB Output is correct
30 Correct 39 ms 208 KB Output is correct
31 Correct 21 ms 304 KB Output is correct
32 Correct 17 ms 304 KB Output is correct
33 Correct 23 ms 296 KB Output is correct
34 Correct 13 ms 336 KB Output is correct
35 Correct 19 ms 292 KB Output is correct
36 Correct 25 ms 328 KB Output is correct
37 Correct 13 ms 300 KB Output is correct
38 Correct 29 ms 296 KB Output is correct
39 Correct 15 ms 320 KB Output is correct
40 Correct 10 ms 336 KB Output is correct
41 Correct 9 ms 308 KB Output is correct

Subtask #3
28.16 / 75.0

# Verdict Execution time Memory 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 55 ms 328 KB Output is correct
8 Correct 16 ms 456 KB Output is correct
9 Correct 47 ms 332 KB Output is correct
10 Partially correct 52 ms 292 KB Output is partially correct
11 Partially correct 166 ms 208 KB Output is partially correct
12 Correct 24 ms 300 KB Output is correct
13 Partially correct 131 ms 280 KB Output is partially correct
14 Partially correct 105 ms 288 KB Output is partially correct
15 Partially correct 58 ms 288 KB Output is partially correct
16 Partially correct 44 ms 328 KB Output is partially correct
17 Partially correct 36 ms 412 KB Output is partially correct
18 Partially correct 27 ms 296 KB Output is partially correct
19 Partially correct 46 ms 328 KB Output is partially correct
20 Partially correct 52 ms 280 KB Output is partially correct
21 Partially correct 44 ms 300 KB Output is partially correct
22 Partially correct 84 ms 284 KB Output is partially correct
23 Partially correct 63 ms 304 KB Output is partially correct
24 Correct 45 ms 316 KB Output is correct
25 Correct 23 ms 380 KB Output is correct
26 Correct 12 ms 336 KB Output is correct
27 Correct 40 ms 292 KB Output is correct
28 Correct 50 ms 320 KB Output is correct
29 Partially correct 41 ms 300 KB Output is partially correct
30 Partially correct 32 ms 296 KB Output is partially correct
31 Partially correct 64 ms 328 KB Output is partially correct
32 Partially correct 52 ms 316 KB Output is partially correct
33 Partially correct 72 ms 288 KB Output is partially correct
34 Partially correct 64 ms 296 KB Output is partially correct
35 Partially correct 53 ms 424 KB Output is partially correct
36 Partially correct 54 ms 316 KB Output is partially correct
37 Partially correct 66 ms 284 KB Output is partially correct
38 Partially correct 61 ms 300 KB Output is partially correct
39 Correct 43 ms 424 KB Output is correct
40 Correct 34 ms 280 KB Output is correct
41 Partially correct 40 ms 304 KB Output is partially correct
42 Partially correct 35 ms 332 KB Output is partially correct
43 Partially correct 32 ms 300 KB Output is partially correct
44 Partially correct 94 ms 276 KB Output is partially correct
45 Correct 46 ms 316 KB Output is correct
46 Correct 26 ms 300 KB Output is correct
47 Correct 22 ms 340 KB Output is correct
48 Correct 25 ms 308 KB Output is correct