제출 #796232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796232		ln_e	드문 곤충 (IOI22_insects)	C++17	10 / 100	333 ms	536 KiB

insects

    #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
    #include "insects.h"
    using ll=long long;
    using ld=long double;
    int const INF=1000000005;
    ll const LINF=1000000000000000005;
    ll const mod=1000000007;
    ld const PI=3.14159265359;
    ll const MAX_N=3e5+5;
    ld const EPS=0.00000001;
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #define f first
    #define s second
    #define pb push_back
    #define mp make_pair
    #define endl '\n'
    #define sz(a) (int)a.size()
    #define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    using namespace std;
    int min_cardinality(int N) {
      vector<ll>v;
     v.pb(0);
     move_inside(0);
     for(ll i=1;i<N;i++){
      move_inside(i);
      ll x=press_button();
      if(x>1){
        move_outside(i);
      }else {
        v.pb(i);
      }
     }
     map<ll,ll>viz;
     for(auto it : v){
      viz[it]=1;
      move_outside(it);
     }
     set<ll>possible;
     for(ll i=0;i<N;i++)
     {
      if(viz[i]==0){
        possible.insert(i);
      }
    }
    int ans=INF;
    for(ll i=0;i<v.size();i++)
    {
      int res=1;
      move_inside(v[i]);
      vector<ll>remove;
      for(auto it : possible){
        move_inside(it);
        ll x=press_button();
        if(x>=2){
          res++;
          remove.pb(it);
        }
        move_outside(it);
      }
      for(auto it : remove){
        possible.erase(possible.find(it));
      }
      //move_outside(v[i]);
      ans=min(ans,res);
    }
    return ans;
  }

컴파일 시 표준 에러 (stderr) 메시지

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:47:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(ll i=0;i<v.size();i++)
      |                ~^~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 75