Submission #858676

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
858676	2023-10-09T04:28:14 Z	NatdanaiHS	Rarest Insects (IOI22_insects)	C++17	10 / 100	192 ms	392 KB

insects

  #include "insects.h"
  #include <bits/stdc++.h>
  using namespace std;
  //move_inside
  //move_outside
  //press_button
  vector<bool> flag(2020,false);
  int ans=1,snow=1;
  bool updatemin(int need,int N){
    int cnt=0;
    for(int i=0;i<N;i++){
      if(flag[i])continue;
      cnt++;
      move_inside(i);
      flag[i]=true;
      if(press_button()==need)continue;
      else{
        move_outside(i);
        flag[i]=false,cnt--;
      }
    }
    return cnt==snow;
  }
  int min_cardinality(int N) {
    flag[0]=true;
    move_inside(0);
    //Prime Set
    for(int i=1;i<N;i++){
      move_inside(i);
      if(press_button()!=1)move_outside(i);
      else snow++,flag[i]=true;
    }
    //find ans
    while(updatemin(ans+1,N)&&ans<=2000)ans++;

    return ans;
  }

Subtask #1

10.0 / 10.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	0 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	96 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	19 ms	344 KB	Output is correct
15	Correct	10 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct

Subtask #2

0 / 15.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	0 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	96 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	19 ms	344 KB	Output is correct
15	Correct	10 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Incorrect	180 ms	344 KB	Too many queries.
24	Halted	0 ms	0 KB	-

Subtask #3

0 / 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	0 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	Incorrect	192 ms	392 KB	Too many queries.
8	Halted	0 ms	0 KB	-