oj.uz

답안 #858702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858702 2023-10-09T05:00:09 Z imarn 드문 곤충 (IOI22_insects) C++17
0 / 100
 1 ms 344 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++){
            move_inside(i);
            move_inside(j);
            int u=get(i);
            int v=get(j);
            if(u==v)continue;
            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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 0 ms 344 KB Wrong answer.
6 Halted 0 ms 0 KB -