oj.uz

Submission #837433

# Submission time Handle Problem Language Result Execution time Memory
837433 2023-08-25T10:48:30 Z NothingXD Rarest Insects (IOI22_insects) C++17
55.39 / 100
 122 ms 536 KB 
#include "insects.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out(){cerr<<endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 2e3 + 10;
const int lg = 20;
int l[maxn], r[maxn], cnt[maxn];
vector<int> a, b;
vector<int> idx[maxn];

bool check_empty(int x){
	for (int i = x; i < a.size(); i++){
		if (!idx[i].empty()) return false;
	}
	return true;
}

int min_cardinality(int N) {
	int n = N;
	vector<int> A;
	for (int i = 0; i < n; i++) A.push_back(i);
	for (auto i: A){
		move_inside(i);
		if (press_button() == 2){
			move_outside(i);
			l[b.size()] = -1;
			r[b.size()] = a.size();
			b.push_back(i);
			continue;
		}
		//debug(i);
		a.push_back(i);
	}
	for (int i = 0; i < a.size(); i++){
		move_outside(a[i]);
	}
	for (int i = 0; i < b.size(); i++){
		if (l[i] + 1 < r[i]){
			int mid = (l[i] + r[i]) >> 1;
			idx[mid].push_back(i);
		}
	}
	//debug(a.size(), b.size());
	while(!check_empty(0)){
		int j;
		for (j = 0; !check_empty(j) && j < a.size(); j++){
			move_inside(a[j]);
			for (auto x: idx[j]){
				move_inside(b[x]);
			//	debug(j, x, b[x], press_button());
				if (press_button() == 2) r[x] = j;
				else l[x] = j;
				if (l[x] + 1 < r[x]){
					int mid = (l[x] + r[x]) >> 1;
					idx[mid].push_back(x);
				}
				move_outside(b[x]);
			}
			idx[j].clear();
		}
		//for (int i = 0; i < b.size(); i++) debug(i, l[i], r[i]);
		for (int i = 0; i < j; i++){
			move_outside(a[i]);
		}
	}

	for (int i = 0; i < b.size(); i++){
		cnt[r[i]]++;
	}
	int ans = n;
	for (int i = 0; i < a.size(); i++){
		ans = min(ans, cnt[i]);
	//	debug(cnt[i]);
	}
	return ans+1;
}

Compilation message

insects.cpp: In function 'bool check_empty(int)':
insects.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int i = x; i < a.size(); i++){
      |                  ~~^~~~~~~~~~
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:52:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for (int i = 0; i < a.size(); i++){
      |                  ~~^~~~~~~~~~
insects.cpp:55:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for (int i = 0; i < b.size(); i++){
      |                  ~~^~~~~~~~~~
insects.cpp:64:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |   for (j = 0; !check_empty(j) && j < a.size(); j++){
      |                                  ~~^~~~~~~~~~
insects.cpp:85:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |  for (int i = 0; i < b.size(); i++){
      |                  ~~^~~~~~~~~~
insects.cpp:89:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |  for (int i = 0; i < a.size(); i++){
      |                  ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 6 ms 336 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 7 ms 336 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 4 ms 336 KB Output is correct
16 Correct 5 ms 336 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 9 ms 336 KB Output is correct
19 Correct 10 ms 336 KB Output is correct
20 Correct 9 ms 336 KB Output is correct
21 Correct 6 ms 388 KB Output is correct
22 Correct 5 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 6 ms 336 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 7 ms 336 KB Output is correct
14 Correct 6 ms 336 KB Output is correct
15 Correct 4 ms 336 KB Output is correct
16 Correct 5 ms 336 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 9 ms 336 KB Output is correct
19 Correct 10 ms 336 KB Output is correct
20 Correct 9 ms 336 KB Output is correct
21 Correct 6 ms 388 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 17 ms 416 KB Output is correct
24 Correct 6 ms 336 KB Output is correct
25 Correct 47 ms 380 KB Output is correct
26 Correct 37 ms 376 KB Output is correct
27 Correct 19 ms 336 KB Output is correct
28 Correct 39 ms 424 KB Output is correct
29 Correct 28 ms 368 KB Output is correct
30 Correct 50 ms 372 KB Output is correct
31 Correct 31 ms 380 KB Output is correct
32 Correct 23 ms 336 KB Output is correct
33 Correct 24 ms 376 KB Output is correct
34 Correct 21 ms 368 KB Output is correct
35 Correct 38 ms 376 KB Output is correct
36 Correct 42 ms 368 KB Output is correct
37 Correct 53 ms 380 KB Output is correct
38 Correct 40 ms 372 KB Output is correct
39 Correct 54 ms 380 KB Output is correct
40 Correct 36 ms 368 KB Output is correct
41 Correct 36 ms 376 KB Output is correct

Subtask #3
30.39 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 33 ms 372 KB Output is correct
8 Correct 12 ms 372 KB Output is correct
9 Partially correct 72 ms 400 KB Output is partially correct
10 Partially correct 75 ms 376 KB Output is partially correct
11 Correct 22 ms 336 KB Output is correct
12 Partially correct 61 ms 400 KB Output is partially correct
13 Partially correct 41 ms 388 KB Output is partially correct
14 Partially correct 101 ms 420 KB Output is partially correct
15 Partially correct 41 ms 388 KB Output is partially correct
16 Partially correct 52 ms 384 KB Output is partially correct
17 Partially correct 72 ms 408 KB Output is partially correct
18 Partially correct 57 ms 528 KB Output is partially correct
19 Partially correct 76 ms 400 KB Output is partially correct
20 Partially correct 86 ms 400 KB Output is partially correct
21 Partially correct 83 ms 416 KB Output is partially correct
22 Partially correct 88 ms 424 KB Output is partially correct
23 Partially correct 99 ms 504 KB Output is partially correct
24 Partially correct 75 ms 484 KB Output is partially correct
25 Partially correct 55 ms 536 KB Output is partially correct
26 Partially correct 38 ms 408 KB Output is partially correct
27 Partially correct 75 ms 408 KB Output is partially correct
28 Partially correct 84 ms 404 KB Output is partially correct
29 Partially correct 65 ms 424 KB Output is partially correct
30 Partially correct 101 ms 380 KB Output is partially correct
31 Partially correct 106 ms 416 KB Output is partially correct
32 Partially correct 64 ms 408 KB Output is partially correct
33 Partially correct 122 ms 424 KB Output is partially correct
34 Partially correct 90 ms 424 KB Output is partially correct
35 Partially correct 97 ms 416 KB Output is partially correct
36 Partially correct 96 ms 416 KB Output is partially correct
37 Partially correct 83 ms 524 KB Output is partially correct
38 Partially correct 85 ms 404 KB Output is partially correct
39 Partially correct 110 ms 416 KB Output is partially correct
40 Partially correct 92 ms 412 KB Output is partially correct
41 Partially correct 92 ms 416 KB Output is partially correct
42 Partially correct 116 ms 464 KB Output is partially correct
43 Partially correct 10 ms 336 KB Output is partially correct
44 Partially correct 39 ms 336 KB Output is partially correct
45 Correct 47 ms 380 KB Output is correct
46 Correct 32 ms 368 KB Output is correct
47 Partially correct 59 ms 384 KB Output is partially correct
48 Partially correct 50 ms 500 KB Output is partially correct