# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1136278 | Saul0906 | 드문 곤충 (IOI22_insects) | C++20 | 0 ms | 412 KiB |
#include "insects.h"
#include <vector>
#include <bits/stdc++.h>
#define rep(a,b,c) for(ll a=b; a<c; a++)
#define repr(a,b,c) for(ll a=b-1; a>c-1; a--)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define mid ((l+r)>>1)
#define ppb pop_back()
using namespace std;
using vi = vector<int>;
const int N=2005;
int dsu[N], sz[N];
int find(int x){
if(dsu[x]==-1) return x;
return dsu[x]=find(dsu[x]);
}
void join(int x, int y){
x=find(x);
y=find(y);
if(x==y) return;
dsu[x]=y;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |