Submission #1181436

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181436		gabyferaq	Marshmallow Molecules (CCO19_day2problem2)	C++20	10 / 25	2133 ms	1114112 KiB

Main

#include<bits/stdc++.h>
using namespace std;
vector<set<int>> grafo;
int cont=0;
int n,q;
void solve(){
int a,b,sg;
cin>>n>>q;
grafo.assign(n+1,set<int>());
while(q--)
{
    cin>>a>>b;
    grafo[a].insert(b);
}
for(int i=1;i<=n;i++)
{
    cont+=grafo[i].size();
    if(!grafo[i].empty()){
    sg=*grafo[i].begin();
    grafo[i].erase(grafo[i].begin());

    for(auto x:grafo[i])
        grafo[sg].insert(x);}
}
cout<<cont;
}
int main()
{
    solve();
}

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