oj.uz

답안 #836284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
836284 2023-08-24T09:44:52 Z Trumling 드문 곤충 (IOI22_insects) C++17
0 / 100
 1 ms 260 KB 
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 99999999999999



int min_cardinality(int N) 
{
  ll n=N;
  vector<int>type(n,-1);
  vector<int>count(n,1);

  ll ans=INF;
  set<int>s;
  vector<int>v;
  for(int i=0;i<N;i++)
    {
      move_inside(i);
      ll p=press_button();
      if(p!=1)
      move_outside(i);
      else
      {
      type[i]=i;
      v.pb(i);
      }
    }

  for(int i=0;i<N;i++)
    if(type[i]==-1)
    {
      ll l=0,r=v.size()-1;
      move_inside(i);
      while(l<r)
      {
        ll mid=(l+r)/2;

        for(int j=l;j<=mid;j++)
        move_inside(v[j]);

        ll p=press_button();
        
        for(int j=l;j<=mid;j++)
        move_outside(v[j]);

        if(p!=1)
        r=mid;
        else
        l=mid+1;
        
      }
      move_outside(i);
      
      count[l]++;
    }

  for(auto x:v)
  ans=min(ans,(ll)count[x]);
  
  return ans;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Incorrect 1 ms 208 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Incorrect 1 ms 208 KB Wrong answer.
5 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 260 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Incorrect 1 ms 208 KB Wrong answer.
7 Halted 0 ms 0 KB -