oj.uz

답안 #859031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859031 2023-10-09T14:47:19 Z NatdanaiHS 드문 곤충 (IOI22_insects) C++17
25 / 100
 217 ms 596 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<45&&false){
      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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 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 5 ms 344 KB Output is correct
9 Correct 3 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 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 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 5 ms 344 KB Output is correct
9 Correct 3 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 2 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 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 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 12 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 40 ms 344 KB Output is correct
26 Correct 38 ms 344 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 15 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 64 ms 344 KB Output is correct
32 Correct 46 ms 344 KB Output is correct
33 Correct 68 ms 344 KB Output is correct
34 Correct 47 ms 344 KB Output is correct
35 Correct 35 ms 344 KB Output is correct
36 Correct 38 ms 344 KB Output is correct
37 Correct 30 ms 344 KB Output is correct
38 Correct 17 ms 344 KB Output is correct
39 Correct 9 ms 344 KB Output is correct
40 Correct 10 ms 340 KB Output is correct
41 Correct 5 ms 344 KB Output is correct

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 9 ms 340 KB Output is correct
9 Partially correct 72 ms 344 KB Output is partially correct
10 Partially correct 88 ms 344 KB Output is partially correct
11 Correct 22 ms 596 KB Output is correct
12 Correct 19 ms 344 KB Output is correct
13 Correct 28 ms 344 KB Output is correct
14 Correct 19 ms 344 KB Output is correct
15 Partially correct 156 ms 344 KB Output is partially correct
16 Partially correct 148 ms 344 KB Output is partially correct
17 Partially correct 124 ms 344 KB Output is partially correct
18 Partially correct 157 ms 344 KB Output is partially correct
19 Partially correct 139 ms 344 KB Output is partially correct
20 Partially correct 124 ms 344 KB Output is partially correct
21 Partially correct 79 ms 344 KB Output is partially correct
22 Partially correct 49 ms 344 KB Output is partially correct
23 Correct 16 ms 344 KB Output is correct
24 Correct 16 ms 344 KB Output is correct
25 Correct 13 ms 344 KB Output is correct
26 Correct 12 ms 344 KB Output is correct
27 Partially correct 62 ms 344 KB Output is partially correct
28 Correct 21 ms 344 KB Output is correct
29 Partially correct 97 ms 344 KB Output is partially correct
30 Incorrect 217 ms 344 KB Too many queries.
31 Halted 0 ms 0 KB -