답안 #838472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
838472 2023-08-27T07:17:45 Z Trumling 드문 곤충 (IOI22_insects) C++17
61.06 / 100
103 ms 460 KB
#include "insects.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

struct Trum
{
  int l,r;
  vector<int> here;

};
int min_cardinality(int N) 
{
ll n=N;
vector<int>type(n,-1);
vector<int>count(n,1);
vector<int>v;
set<int>s;
  for(int i=0;i<N;i++)
    {
      move_inside(i);
      ll p=press_button();
      if(p!=1)
      move_outside(i);
      else
      {
       type[i]=i;
       s.insert(i);
       v.pb(i);
      }
    }
  Trum curr;
  for(int i=0;i<N;i++)
  if(type[i]==-1)
  curr.here.pb(i);

  
  queue<Trum>q;
  
  curr.l=0;
  curr.r=v.size()-1;

  q.push(curr);

  while(!q.empty())
  {
    curr=q.front();
    q.pop();

    if(curr.l==curr.r)
    {
      count[v[curr.l]]+=curr.here.size();
      continue;
    }

    if(!curr.here.size())
    continue;

    ll mid=(curr.l+curr.r)/2;

    for(int i=curr.l;i<=curr.r;i++)
    {
      if(i<=mid && s.find(v[i])==s.end())
      {
        move_inside(v[i]);
        s.insert(v[i]);
      }

      if(i>mid && s.find(v[i])!=s.end())
      {
        move_outside(v[i]);
        s.erase(v[i]);
      }
    }
    Trum l,r;
    l.l=curr.l;
    l.r=mid;

    r.l=mid+1;
    r.r=curr.r;
    for(auto x:curr.here)
    {
      move_inside(x);
      ll p=press_button();
      if(p!=1)
      l.here.pb(x);
      else
      r.here.pb(x);

      move_outside(x);
    }

    q.push(l);
    q.push(r);

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

  return ans;
}
# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 6 ms 308 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 6 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 7 ms 208 KB Output is correct
22 Correct 5 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 6 ms 308 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 6 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 7 ms 208 KB Output is correct
22 Correct 5 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 7 ms 360 KB Output is correct
25 Correct 44 ms 208 KB Output is correct
26 Correct 36 ms 208 KB Output is correct
27 Correct 13 ms 304 KB Output is correct
28 Correct 37 ms 336 KB Output is correct
29 Correct 22 ms 208 KB Output is correct
30 Correct 37 ms 208 KB Output is correct
31 Correct 19 ms 328 KB Output is correct
32 Correct 24 ms 208 KB Output is correct
33 Correct 26 ms 208 KB Output is correct
34 Correct 27 ms 208 KB Output is correct
35 Correct 34 ms 208 KB Output is correct
36 Correct 35 ms 304 KB Output is correct
37 Correct 42 ms 308 KB Output is correct
38 Correct 48 ms 316 KB Output is correct
39 Correct 50 ms 332 KB Output is correct
40 Correct 38 ms 328 KB Output is correct
41 Correct 28 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 10 ms 316 KB Output is correct
8 Correct 14 ms 336 KB Output is correct
9 Partially correct 86 ms 320 KB Output is partially correct
10 Partially correct 79 ms 332 KB Output is partially correct
11 Correct 25 ms 308 KB Output is correct
12 Partially correct 76 ms 328 KB Output is partially correct
13 Partially correct 47 ms 208 KB Output is partially correct
14 Partially correct 92 ms 332 KB Output is partially correct
15 Partially correct 42 ms 320 KB Output is partially correct
16 Partially correct 54 ms 452 KB Output is partially correct
17 Partially correct 62 ms 208 KB Output is partially correct
18 Partially correct 60 ms 320 KB Output is partially correct
19 Partially correct 74 ms 328 KB Output is partially correct
20 Partially correct 72 ms 312 KB Output is partially correct
21 Partially correct 86 ms 300 KB Output is partially correct
22 Partially correct 88 ms 332 KB Output is partially correct
23 Partially correct 66 ms 436 KB Output is partially correct
24 Partially correct 94 ms 376 KB Output is partially correct
25 Partially correct 82 ms 356 KB Output is partially correct
26 Partially correct 59 ms 372 KB Output is partially correct
27 Partially correct 63 ms 328 KB Output is partially correct
28 Partially correct 89 ms 328 KB Output is partially correct
29 Partially correct 70 ms 320 KB Output is partially correct
30 Partially correct 50 ms 332 KB Output is partially correct
31 Partially correct 87 ms 368 KB Output is partially correct
32 Partially correct 81 ms 304 KB Output is partially correct
33 Partially correct 103 ms 308 KB Output is partially correct
34 Partially correct 100 ms 336 KB Output is partially correct
35 Partially correct 88 ms 316 KB Output is partially correct
36 Partially correct 85 ms 324 KB Output is partially correct
37 Partially correct 90 ms 460 KB Output is partially correct
38 Partially correct 50 ms 336 KB Output is partially correct
39 Partially correct 91 ms 328 KB Output is partially correct
40 Partially correct 85 ms 336 KB Output is partially correct
41 Partially correct 91 ms 328 KB Output is partially correct
42 Partially correct 79 ms 320 KB Output is partially correct
43 Partially correct 19 ms 208 KB Output is partially correct
44 Partially correct 29 ms 328 KB Output is partially correct
45 Correct 24 ms 324 KB Output is correct
46 Partially correct 75 ms 328 KB Output is partially correct
47 Partially correct 71 ms 336 KB Output is partially correct
48 Partially correct 78 ms 336 KB Output is partially correct