Submission #1181449

#TimeUsernameProblemLanguageResultExecution timeMemory
1181449gabyferaqMarshmallow Molecules (CCO19_day2problem2)C++20
10 / 25
4091 ms11060 KiB
#include<iostream> #include<vector> #include<set> using namespace std; vector<set<long>> grafo; long cont=0; long n,q; void solve(){ long a,b,sg; cin>>n>>q; grafo.assign(n+1,set<long>()); while(q--) { cin>>a>>b; grafo[a].insert(b); } for(long 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);} grafo[i].clear(); } cout<<cont; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...