oj.uz

Submission #819377

# Submission time Handle Problem Language Result Execution time Memory
819377 2023-08-10T09:54:36 Z andrei_boaca Rarest Insects (IOI22_insects) C++17
96.41 / 100
 67 ms 432 KB 
#include "insects.h"
#include <bits/stdc++.h>
//#include "stub.cpp"
using namespace std;
int cul[2005];
int n;
vector<int> spec;
struct date
{
    int nod,l,r;
};
vector<date> need;
bool comp(date a, date b)
{
    return a.l<b.l;
}
bool use[2005];
int f[2005];
int min_cardinality(int N)
{
    n=N;
    cul[0]=1;
    spec.push_back(0);
    move_inside(0);
    int nr=1;
    for(int i=1;i<n;i++)
    {
        move_inside(i);
        int cnt=press_button();
        if(cnt>=2)
            move_outside(i);
        else
        {
            nr++;
            cul[i]=nr;
            spec.push_back(i);
        }
    }
    int D=nr;
    int B=n/D;
    int loga=0;
    for(int i=0;i<20;i++)
        if((1<<i)<=B)
            loga=i;
    int I=0;
    int b=0;
    vector<int> v;
    for(int i=0;i<n;i++)
        v.push_back(i);
    for(int i=loga;i>=0;i--)
    {
        b+=(1<<i);
        random_shuffle(v.begin(),v.end());
        vector<int> added;
        for(int j:v)
            if(!use[j])
            {
                use[j]=1;
                I++;
                move_inside(j);
                added.push_back(j);
                if(press_button()>b)
                {
                    added.pop_back();
                    move_outside(j);
                    use[j]=0;
                    I--;
                }
                if(I==b*D)
                    break;
            }
        if(I<b*D)
        {
            b-=(1<<i);
            for(int j=0;j<n;j++)
                if(!use[j])
                    use[j]=1;
            for(int j:added)
            {
                use[j]=0;
                move_outside(j);
                I--;
            }
        }
    }
    return b;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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 1 ms 208 KB Output is correct
6 Correct 4 ms 312 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 5 ms 316 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 4 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 312 KB Output is correct
14 Correct 5 ms 312 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 308 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 5 ms 208 KB Output is correct
22 Correct 4 ms 312 KB Output is correct
23 Correct 10 ms 308 KB Output is correct
24 Correct 15 ms 320 KB Output is correct
25 Correct 12 ms 316 KB Output is correct
26 Correct 26 ms 316 KB Output is correct
27 Correct 15 ms 208 KB Output is correct
28 Correct 12 ms 208 KB Output is correct
29 Correct 23 ms 288 KB Output is correct
30 Correct 27 ms 312 KB Output is correct
31 Correct 20 ms 208 KB Output is correct
32 Correct 17 ms 208 KB Output is correct
33 Correct 20 ms 208 KB Output is correct
34 Correct 23 ms 208 KB Output is correct
35 Correct 17 ms 288 KB Output is correct
36 Correct 28 ms 208 KB Output is correct
37 Correct 11 ms 312 KB Output is correct
38 Correct 29 ms 208 KB Output is correct
39 Correct 25 ms 320 KB Output is correct
40 Correct 19 ms 208 KB Output is correct
41 Correct 12 ms 316 KB Output is correct

Subtask #3
71.41 / 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 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 41 ms 288 KB Output is correct
8 Correct 30 ms 308 KB Output is correct
9 Correct 23 ms 432 KB Output is correct
10 Partially correct 42 ms 336 KB Output is partially correct
11 Correct 34 ms 316 KB Output is correct
12 Correct 33 ms 388 KB Output is correct
13 Partially correct 38 ms 288 KB Output is partially correct
14 Partially correct 40 ms 348 KB Output is partially correct
15 Correct 41 ms 308 KB Output is correct
16 Correct 38 ms 292 KB Output is correct
17 Correct 51 ms 304 KB Output is correct
18 Correct 41 ms 312 KB Output is correct
19 Partially correct 63 ms 312 KB Output is partially correct
20 Correct 50 ms 304 KB Output is correct
21 Partially correct 59 ms 308 KB Output is partially correct
22 Partially correct 54 ms 296 KB Output is partially correct
23 Partially correct 54 ms 312 KB Output is partially correct
24 Partially correct 42 ms 208 KB Output is partially correct
25 Correct 50 ms 320 KB Output is correct
26 Correct 27 ms 320 KB Output is correct
27 Correct 27 ms 288 KB Output is correct
28 Correct 40 ms 304 KB Output is correct
29 Correct 43 ms 304 KB Output is correct
30 Correct 28 ms 424 KB Output is correct
31 Partially correct 47 ms 308 KB Output is partially correct
32 Partially correct 67 ms 300 KB Output is partially correct
33 Partially correct 46 ms 316 KB Output is partially correct
34 Partially correct 57 ms 432 KB Output is partially correct
35 Correct 29 ms 328 KB Output is correct
36 Correct 36 ms 304 KB Output is correct
37 Partially correct 52 ms 292 KB Output is partially correct
38 Partially correct 58 ms 312 KB Output is partially correct
39 Correct 18 ms 328 KB Output is correct
40 Correct 39 ms 312 KB Output is correct
41 Correct 38 ms 304 KB Output is correct
42 Correct 27 ms 300 KB Output is correct
43 Correct 10 ms 316 KB Output is correct
44 Correct 39 ms 308 KB Output is correct
45 Correct 39 ms 288 KB Output is correct
46 Correct 37 ms 220 KB Output is correct
47 Correct 35 ms 320 KB Output is correct
48 Correct 31 ms 308 KB Output is correct