Submission #631738

#TimeUsernameProblemLanguageResultExecution timeMemory
631738AmirElarbi드문 곤충 (IOI22_insects)C++17
0 / 100
1 ms208 KiB
#include "insects.h"
#include <bits/stdc++.h>
#define ve vector
#define vi ve<int>
#define ii pair<int,int>
#define ll long long
#define vvi ve<vi>
#define se second
#define fi first

using namespace std;
const int nax = 2e3+5;
const int MOD = 1e9+7;

int pref[nax];
int min_cardinality(int n) {
  int type  = 0;
  for (int i = 0; i < n; ++i)
  {
       move_inside(i);
       int a = press_button();
       if(a == 1)
        type++;
       else 
        move_outside(i);
      pref[i] = type;
  }
  for (int i = 0; i < n; ++i)
  {
    move_outside(i);
  }
  int l = 0,r = n, ans = 0;
  while(l< r){
    int md = (l+r)/2;
    int nb = 0;
    for (int i = 0; i < n; ++i)
    {
      move_inside(i);
      int a = press_button();
      if(a  > md){
        move_outside(i);
      } else nb++;
    }
    if(type*md == nb){
      l = md+1; ans = md; 
    } else {
      r = md;
    }
    for (int i = 0; i < n; ++i)
    {
      move_outside(i);
    }
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...