oj.uz

Submission #859029

# Submission time Handle Problem Language Result Execution time Memory
859029 2023-10-09T14:42:54 Z NatdanaiHS Rarest Insects (IOI22_insects) C++17
25 / 100
 184 ms 920 KB 
  #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(cnt==snow)return true;
      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
    if(snow<=sqrt(N)){
      for(int i=0;i<N;i++){
        if(flag[i]){
          flag[i]=false;
          move_outside(i);
        }
      }
      ans=N;
      
      for(int i=0;i<N;i++){
        if(flag[i])continue;
        stack<int> C;
        int now=1;
        C.push(i);
        move_inside(i);
        for(int j=i+1;j<N;j++){
          if(flag[j])continue;
          move_inside(j);
          C.push(j);
          if(press_button()>now)now++;
          else{
            move_outside(j);
            C.pop();
          }
        }
        ans=min(ans,now);
        while(C.size()){
          flag[C.top()]=true;
        	move_outside(C.top());
          C.pop();
        }
      }
    }
    else 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 2 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 7 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 7 ms 596 KB Output is correct
14 Correct 4 ms 500 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
15.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 2 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 7 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 7 ms 596 KB Output is correct
14 Correct 4 ms 500 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 9 ms 600 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 85 ms 344 KB Output is correct
26 Correct 73 ms 344 KB Output is correct
27 Correct 10 ms 440 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 69 ms 344 KB Output is correct
31 Correct 16 ms 344 KB Output is correct
32 Correct 27 ms 344 KB Output is correct
33 Correct 26 ms 344 KB Output is correct
34 Correct 36 ms 344 KB Output is correct
35 Correct 39 ms 344 KB Output is correct
36 Correct 55 ms 344 KB Output is correct
37 Correct 24 ms 344 KB Output is correct
38 Correct 15 ms 344 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 6 ms 344 KB Output is correct

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 Correct 17 ms 920 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Incorrect 184 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -