oj.uz

Submission #858706

# Submission time Handle Problem Language Result Execution time Memory
858706 2023-10-09T05:01:54 Z imarn Rarest Insects (IOI22_insects) C++17
10 / 100
 117 ms 544 KB 
#include<bits/stdc++.h>
#include "insects.h"
#define f first
#define s second
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
//#define sz(x) (ll)x.size()
#define all(x) x.begin(),x.end()
using namespace std;
int pr[2001]{0};
int sz[2001]{0};
int get(int r){
    return pr[r]==r?r:pr[r]=get(pr[r]);
}
int min_cardinality(int N)
{
    iota(pr,pr+N+1,0);
    for(int i=0;i<N+1;i++)sz[i]=1;
    for(int i=0;i<N;i++){
        for(int j=i+1;j<N;j++){
            int u=get(i);
            int v=get(j);
            if(u==v)continue;
            move_inside(i);
            move_inside(j);
            if(press_button()==2&&u!=v){
                sz[u]+=sz[v];
                pr[v]=get(u);
            }move_outside(i);
            move_outside(j);
        }
    }int ans=1e9;
    for(int i=0;i<N;i++)ans=min(ans,sz[get(i)]);
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 116 ms 344 KB Output is correct
8 Correct 117 ms 344 KB Output is correct
9 Correct 94 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 116 ms 344 KB Output is correct
12 Correct 95 ms 344 KB Output is correct
13 Correct 82 ms 344 KB Output is correct
14 Correct 75 ms 344 KB Output is correct
15 Correct 78 ms 344 KB Output is correct
16 Correct 92 ms 344 KB Output is correct
17 Correct 89 ms 344 KB Output is correct
18 Correct 95 ms 344 KB Output is correct
19 Correct 87 ms 344 KB Output is correct
20 Correct 109 ms 344 KB Output is correct
21 Correct 95 ms 344 KB Output is correct
22 Correct 87 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 116 ms 344 KB Output is correct
8 Correct 117 ms 344 KB Output is correct
9 Correct 94 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 116 ms 344 KB Output is correct
12 Correct 95 ms 344 KB Output is correct
13 Correct 82 ms 344 KB Output is correct
14 Correct 75 ms 344 KB Output is correct
15 Correct 78 ms 344 KB Output is correct
16 Correct 92 ms 344 KB Output is correct
17 Correct 89 ms 344 KB Output is correct
18 Correct 95 ms 344 KB Output is correct
19 Correct 87 ms 344 KB Output is correct
20 Correct 109 ms 344 KB Output is correct
21 Correct 95 ms 344 KB Output is correct
22 Correct 87 ms 344 KB Output is correct
23 Correct 6 ms 544 KB Output is correct
24 Incorrect 92 ms 344 KB Too many queries.
25 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 14 ms 344 KB Output is correct
8 Incorrect 110 ms 344 KB Too many queries.
9 Halted 0 ms 0 KB -