Submission #1181512

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181512		gabyferaq	Marshmallow Molecules (CCO19_day2problem2)	C++20	25 / 25	63 ms	10568 KiB

Main

#include <bits/stdc++.h>
using namespace std;
set<long> grafo[100005];
long cont=0;
long n,q,a,b,sg;
void solve(){
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());
    if(grafo[sg].size()<grafo[i].size()) swap(grafo[i],grafo[sg]);
    for(auto x:grafo[i]) grafo[sg].insert(x);}
    grafo[i].clear();
}
cout<<cont;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    solve();
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 10 / 10