Submission #821304

#	Time	Username	Problem	Language	Result	Execution time	Memory
821304		Denkata	Marshmallow Molecules (CCO19_day2problem2)	C++17	0 / 25	811 ms	1048576 KiB

Main

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
const int maxn = 1e5+3;
long long i,j,p,q,n,m,k,cnt[maxn];
vector <int> v[maxn];
vector <int> rev[maxn];
int marked[maxn];
long long ans;
set <int> s[maxn];
set <int> gett(set <int> a,set <int> b)
{
    if(a.size()<b.size())
        swap(a,b);
    a.insert(b.begin(),b.end());
    return a;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    ans = m;
    for(i=1;i<=m;i++)
    {
        cin>>p>>q;
        s[p].insert(q);
    }
    for(i=1;i<=n;i++)
    {
        if(s[i].empty())continue;
        ans+=max((int)s[i].size()-1,0);
        p = *s[i].begin();
        s[i].erase(s[i].begin());
        s[p] = gett(s[p],s[i]);
    }
    cout<<ans<<endl;
    return 0;
}

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