Submission #988418

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
988418	2024-05-24T16:20:47 Z	cnn008	Rarest Insects (IOI22_insects)	C++17	10 / 100	98 ms	600 KB

insects

#include "bits/stdc++.h"
using namespace std;

#include "insects.h";

#ifdef N_N_C
#include "debug.h"
#else
#define cebug(...) "Arya"
#endif

#define ll long long

const int N=1e5+5;
const int mod=1e9+7;
int vis[205],type;
int min_cardinality(int n){
	for(int i=0; i<n; i++){
		if(!vis[i]){
			vis[i]=++type;
			move_inside(i);
			for(int j=i+1; j<n; j++){
				move_inside(j);
				int val=press_button();
				if(val==2) vis[j]=type;
				move_outside(j);
			}
			move_outside(i);
		}
	}
	map <int,int> mp;
	for(int i=0; i<n; i++) mp[vis[i]]++;
	int ans=INT_MAX;
	for(auto [x,y]:mp) ans=min(ans,y);
	return ans;
}
/**  /\_/\
*   (= ._.)
*   / >💖 \>💕
**/

Compilation message

insects.cpp:4:21: warning: extra tokens at end of #include directive
    4 | #include "insects.h";
      |                     ^
insects.cpp:37:9: warning: "/*" within comment [-Wcomment]
   37 | /**  /\_/\
      |

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	344 KB	Output is correct
7	Correct	98 ms	412 KB	Output is correct
8	Correct	12 ms	344 KB	Output is correct
9	Correct	11 ms	344 KB	Output is correct
10	Correct	3 ms	344 KB	Output is correct
11	Correct	41 ms	412 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	11 ms	344 KB	Output is correct
14	Correct	4 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	10 ms	344 KB	Output is correct
18	Correct	10 ms	344 KB	Output is correct
19	Correct	17 ms	344 KB	Output is correct
20	Correct	35 ms	412 KB	Output is correct
21	Correct	58 ms	408 KB	Output is correct
22	Correct	85 ms	412 KB	Output is correct

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	344 KB	Output is correct
7	Correct	98 ms	412 KB	Output is correct
8	Correct	12 ms	344 KB	Output is correct
9	Correct	11 ms	344 KB	Output is correct
10	Correct	3 ms	344 KB	Output is correct
11	Correct	41 ms	412 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	11 ms	344 KB	Output is correct
14	Correct	4 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	10 ms	344 KB	Output is correct
18	Correct	10 ms	344 KB	Output is correct
19	Correct	17 ms	344 KB	Output is correct
20	Correct	35 ms	412 KB	Output is correct
21	Correct	58 ms	408 KB	Output is correct
22	Correct	85 ms	412 KB	Output is correct
23	Runtime error	2 ms	600 KB	Execution killed with signal 11
24	Halted	0 ms	0 KB	-

Subtask #3

0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Runtime error	2 ms	600 KB	Execution killed with signal 11
8	Halted	0 ms	0 KB	-