| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1181484 | gabyferaq | Marshmallow Molecules (CCO19_day2problem2) | C++20 | 4096 ms | 11084 KiB |
#include <bits/stdc++.h>
using namespace std;
set<long> grafo[100005];
long cont=0;
long n,q;
void solve(){
long a,b,sg;
cin>>n>>q;
while(q--)
{
cin>>a>>b;
if(a>b) swap(a,b);
grafo[a].insert(b);
}
for(long i=1;i<=n;i++)
{
if(!grafo[i].empty()){
cont+=grafo[i].size();
sg=*grafo[i].begin();
grafo[i].erase(grafo[i].begin());
for(auto x:grafo[i]) grafo[sg].insert(x);}
grafo[i].clear();
}
cout<<cont;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
solve();
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
