Submission #1181430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181430		gabyferaq	Marshmallow Molecules (CCO19_day2problem2)	C++20	0 / 25	4104 ms	1114112 KiB

Main

#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> grafo;
int cont=0;
int n,q;
void solve(){
int a,b;
cin>>n>>q;
grafo.assign(n+1,vector<int> ());
while(q--)
{
    cin>>a>>b;
    grafo[a].push_back(b);
}
for(int i=1;i<=n;i++)
{
    sort(grafo[i].begin(),grafo[i].end());
    cont+=grafo[i].size();
    for(int j=1;j<grafo[i].size();j++)
        grafo[grafo[i][0]].push_back(grafo[i][j]);
}
cout<<cont;
}
int main()
{
    solve();
}

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