oj.uz

Submission #836303

# Submission time Handle Problem Language Result Execution time Memory
836303 2023-08-24T09:59:19 Z Trumling Rarest Insects (IOI22_insects) C++17
10 / 100
 82 ms 356 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(auto x:v)
      move_outside(x);

      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++)
            {
              if(s.find(v[j])==s.end())
              move_inside(v[j]);
              s.insert(v[j]);
            }
     
            ll p=press_button();
            
            
     
            if(p!=1)
            {
            r=mid;
            for(int j=(l+r)/2+1;j<=r;j++)
            {
              move_outside(v[j]);
              s.erase(v[j]);
            }
            
            }
            else
            l=mid+1;
            
          }

          for(auto itr=s.begin();itr!=s.end();itr++)
          move_outside(*itr);
          s.clear();

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 208 KB Output is correct
5 Correct 1 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 7 ms 208 KB Output is correct
9 Correct 6 ms 296 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 10 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 9 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 7 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 9 ms 296 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 7 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Correct 0 ms 208 KB Output is correct
5 Correct 1 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 7 ms 208 KB Output is correct
9 Correct 6 ms 296 KB Output is correct
10 Correct 4 ms 208 KB Output is correct
11 Correct 10 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 9 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 7 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 9 ms 296 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 7 ms 208 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 9 ms 356 KB Output is correct
25 Correct 41 ms 208 KB Output is correct
26 Correct 56 ms 208 KB Output is correct
27 Correct 16 ms 208 KB Output is correct
28 Incorrect 32 ms 304 KB Too many queries.
29 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 15 ms 308 KB Output is correct
8 Correct 13 ms 324 KB Output is correct
9 Incorrect 82 ms 296 KB Too many queries.
10 Halted 0 ms 0 KB -