Submission #1060725

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1060725	2024-08-15T21:21:50 Z	AdamGS	Rarest Insects (IOI22_insects)	C++17	99.16 / 100	43 ms	1120 KB

insects

#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>V, usun, Q;
int n;
int solve(int l, int r, vector<int>czy) {
	if(l==r) return l;
	int mid=(l+r+1)/2;
	vector<int>P;
	rep(i, n) if(czy[i]) {
		move_inside(Q[i]);
		if(press_button()==mid+1) move_outside(Q[i]);
		else P.pb(i);
	}
	bool ok=true;
	vector<int>A, B;
	rep(j, V.size()) if(!usun[j]) {
		int i=V[j];
		move_inside(Q[i]);
		if(press_button()<=mid) {
			ok=false;
			A.pb(j);
		} else B.pb(j);
		move_outside(Q[i]);
	}
	if(ok) {
		for(auto i : P) czy[i]=0;
		return solve(mid, r, czy);
	}
	for(auto i : B) usun[i]=1;
	rep(i, n) czy[i]=0;
	for(auto i : P) czy[i]=1;
	for(auto i : P) move_outside(Q[i]);
	return solve(l, mid-1, czy);
}
int min_cardinality(int _n) {
	n=_n;
	rep(i, n) Q.pb(i);
	mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
	rep(i, n) swap(Q[i], Q[rng()%(i+1)]);
	rep(i, n) {
		move_inside(Q[i]);
		if(press_button()==1) V.pb(i);
		else move_outside(Q[i]);
	}
	for(auto i : V) move_outside(Q[i]);
	vector<int>czy(n, 1);
	for(auto i : V) czy[i]=0;
	rep(i, V.size()) usun.pb(0);
	return solve(0, (n-V.size())/V.size(), czy)+1;
}

Compilation message

insects.cpp: In function 'int solve(int, int, std::vector<int>)':
insects.cpp:4:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
insects.cpp:22:2: note: in expansion of macro 'rep'
   22 |  rep(j, V.size()) if(!usun[j]) {
      |  ^~~
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:4:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
insects.cpp:54:2: note: in expansion of macro 'rep'
   54 |  rep(i, V.size()) usun.pb(0);
      |  ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	3 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	4 ms	440 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	3 ms	600 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	4 ms	444 KB	Output is correct
14	Correct	3 ms	344 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	3 ms	344 KB	Output is correct
17	Correct	4 ms	600 KB	Output is correct
18	Correct	3 ms	344 KB	Output is correct
19	Correct	3 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	16 ms	448 KB	Output is correct
24	Correct	5 ms	344 KB	Output is correct
25	Correct	10 ms	600 KB	Output is correct
26	Correct	13 ms	592 KB	Output is correct
27	Correct	9 ms	452 KB	Output is correct
28	Correct	4 ms	344 KB	Output is correct
29	Correct	13 ms	452 KB	Output is correct
30	Correct	18 ms	696 KB	Output is correct
31	Correct	10 ms	596 KB	Output is correct
32	Correct	13 ms	344 KB	Output is correct
33	Correct	11 ms	704 KB	Output is correct
34	Correct	17 ms	600 KB	Output is correct
35	Correct	9 ms	444 KB	Output is correct
36	Correct	14 ms	600 KB	Output is correct
37	Correct	12 ms	592 KB	Output is correct
38	Correct	10 ms	344 KB	Output is correct
39	Correct	14 ms	344 KB	Output is correct
40	Correct	9 ms	448 KB	Output is correct
41	Correct	5 ms	344 KB	Output is correct

Subtask #3
74.16 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	31 ms	680 KB	Output is correct
8	Correct	7 ms	596 KB	Output is correct
9	Partially correct	40 ms	700 KB	Output is partially correct
10	Correct	36 ms	1120 KB	Output is correct
11	Correct	27 ms	588 KB	Output is correct
12	Correct	24 ms	600 KB	Output is correct
13	Correct	30 ms	448 KB	Output is correct
14	Correct	22 ms	468 KB	Output is correct
15	Correct	41 ms	452 KB	Output is correct
16	Partially correct	31 ms	592 KB	Output is partially correct
17	Correct	37 ms	704 KB	Output is correct
18	Correct	41 ms	684 KB	Output is correct
19	Partially correct	31 ms	600 KB	Output is partially correct
20	Correct	41 ms	592 KB	Output is correct
21	Correct	27 ms	468 KB	Output is correct
22	Correct	31 ms	612 KB	Output is correct
23	Correct	28 ms	468 KB	Output is correct
24	Correct	40 ms	480 KB	Output is correct
25	Correct	16 ms	464 KB	Output is correct
26	Correct	10 ms	600 KB	Output is correct
27	Partially correct	28 ms	700 KB	Output is partially correct
28	Partially correct	23 ms	600 KB	Output is partially correct
29	Partially correct	42 ms	424 KB	Output is partially correct
30	Partially correct	30 ms	592 KB	Output is partially correct
31	Correct	33 ms	448 KB	Output is correct
32	Correct	28 ms	704 KB	Output is correct
33	Correct	32 ms	448 KB	Output is correct
34	Correct	26 ms	460 KB	Output is correct
35	Partially correct	43 ms	592 KB	Output is partially correct
36	Partially correct	24 ms	488 KB	Output is partially correct
37	Correct	31 ms	600 KB	Output is correct
38	Correct	23 ms	700 KB	Output is correct
39	Correct	26 ms	592 KB	Output is correct
40	Correct	31 ms	592 KB	Output is correct
41	Partially correct	27 ms	708 KB	Output is partially correct
42	Partially correct	38 ms	464 KB	Output is partially correct
43	Correct	7 ms	600 KB	Output is correct
44	Correct	22 ms	460 KB	Output is correct
45	Correct	29 ms	960 KB	Output is correct
46	Correct	13 ms	344 KB	Output is correct
47	Correct	32 ms	344 KB	Output is correct
48	Correct	13 ms	588 KB	Output is correct

Submission #1060725

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 74.16 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
74.16 / 75.0