oj.uz

Submission #627652

# Submission time Handle Problem Language Result Execution time Memory
627652 2022-08-12T18:06:26 Z sofapuden Rarest Insects (IOI22_insects) C++17
0 / 100
 29 ms 300 KB 
#include "insects.h"
#include<bits/stdc++.h>

using namespace std;

int min_cardinality(int n) {
	int am = 1;
	move_inside(0);
	vector<int> st(n,0);
	st[0] = 1;
	int sz = 1;
	for(int i = 1; i < n; ++i){
		move_inside(i);
		if(press_button() != 1)move_outside(i);
		else am++, st[i] = 1, sz++;
	}
	int l = 2, r = n/am, cur = 1;
	vector<int> per(n);
	iota(per.begin(),per.end(),0);
	srand(time(0));
	while(l <= r){
		int m = (l+r)>>1;
		vector<int> rem;
		random_shuffle(per.begin(),per.end());
		for(int x = 0; x < n; ++x){
			int i = per[x];
			if(st[i])continue;
			sz++;
			move_inside(i);
			if(press_button() > m){
				rem.push_back(i);
				sz--;
				move_outside(i);
			}
			if(sz == am*m){
				for(int j = i+1; j < n; ++j){
					if(st[per[j]])continue;
					rem.push_back(per[j]);
				}
				break;
			}
		}
		if(sz == am*m){
			for(int i = 0; i < n; ++i)st[i] = 1;
			for(auto x : rem)st[x] = 0;
			cur = m;
			l = m + 1;
		}
		else{
			r = m - 1;
			if(l <= r){
				for(auto x : rem)st[x] = 1;
				for(int i = 0; i < n; ++i){
					if(!st[i]){move_outside(i);sz--;}
				}
			}
		}
	}
	return cur;
}

Subtask #1
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 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 Incorrect 3 ms 208 KB Wrong answer.
7 Halted 0 ms 0 KB -

Subtask #2
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 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 Incorrect 3 ms 208 KB Wrong answer.
7 Halted 0 ms 0 KB -

Subtask #3
0 / 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 276 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Incorrect 29 ms 300 KB Wrong answer.
8 Halted 0 ms 0 KB -