| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1181430 | gabyferaq | Marshmallow Molecules (CCO19_day2problem2) | C++20 | 4104 ms | 1114112 KiB |
#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();
}
| # | 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... | ||||
