oj.uz

답안 #953250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
953250 2024-03-25T17:59:59 Z andrei_boaca 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 4651 ms 141320 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll n,m,ans;
ll comp[100005];
vector<ll> dsu[100005];
set<ll> par[100005];
set<pll> edgenod[100005];
set<ll> edgecomp[100005];
void dsu_merge(ll c1,ll c2)
{
    ll nr1=(int)dsu[c1].size()+(int)par[c1].size()+(int)edgenod[c1].size();
    ll nr2=(int)dsu[c2].size()+(int)par[c2].size()+(int)edgenod[c2].size();
    if(nr1<nr2)
        swap(c1,c2);
    ll sz2=dsu[c2].size();
    ll sz1=dsu[c1].size();
    ll val=(ll)dsu[c1].size()*(ll)dsu[c2].size();
    val=val*2LL;
    ans+=val;
    val=(ll)par[c1].size()*sz2;
    ans+=val;
    set<ll> why;
    for(ll x:par[c2])
    {
        edgenod[comp[x]].erase({x,c2});
        if(edgecomp[comp[x]].find(c2)!=edgecomp[comp[x]].end())
            edgecomp[comp[x]].erase(c2);
        if(comp[x]==c1)
        {
            ans-=sz2;
            continue;
        }
        if(par[c1].find(x)==par[c1].end())
        {
            why.insert(comp[x]);
            par[c1].insert(x);
            ans+=sz1;
            edgenod[comp[x]].insert({x,c1});
            edgecomp[comp[x]].insert(c1);
        }
        else
            ans-=sz2;
    }
    for(pll p:edgenod[c2])
    {
        ll x=p.first;
        ll c=p.second;
        if(par[c].find(x)!=par[c].end())
            par[c].erase(x);
        if(c==c1)
        {
            ans-=(sz1+sz2);
            continue;
        }
        why.insert(comp[x]);
        edgenod[c1].insert({x,c});
        edgecomp[c1].insert(c);
        par[c].insert(x);
    }
    edgenod[c2].clear();
    par[c2].clear();
    edgecomp[c2].clear();
    for(ll i:dsu[c2])
    {
        dsu[c1].push_back(i);
        comp[i]=c1;
    }
    dsu[c2].clear();
    if(par[c1].empty())
        return;
    vector<ll> v;
    for(ll i:par[c1])
    {
        v.push_back(comp[i]);
        if(v.size()>500)
            break;
    }
    for(ll i:edgecomp[c1])
    {
        v.push_back(i);
        if(v.size()>1000)
            break;
    }
    for(ll i:v)
        if(edgecomp[c1].find(i)!=edgecomp[c1].end())
            if(edgecomp[i].find(c1)!=edgecomp[i].end())
            {
                dsu_merge(i,c1);
                break;
            }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        comp[i]=i;
        dsu[i].push_back(i);
    }
    while(m--)
    {
        ll a,b;
        cin>>a>>b;
        ll c1=comp[a];
        ll c2=comp[b];
        if(c1==c2)
        {
            cout<<ans<<'\n';
            continue;
        }
        if(edgecomp[c2].find(c1)!=edgecomp[c2].end())
        {
            dsu_merge(c1,c2);
            cout<<ans<<'\n';
            continue;
        }
        if(edgenod[c1].find({a,c2})==edgenod[c1].end())
        {
            ans+=dsu[c2].size();
            edgenod[c1].insert({a,c2});
            edgecomp[c1].insert(c2);
            par[c2].insert(a);
        }
        cout<<ans<<'\n';
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 4 ms 16984 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 4 ms 16984 KB Output is correct
14 Correct 4 ms 16984 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16984 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 4 ms 16988 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 3 ms 16988 KB Output is correct
27 Correct 4 ms 17076 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 17188 KB Output is correct
30 Correct 3 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16988 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 4 ms 16984 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 4 ms 16984 KB Output is correct
14 Correct 4 ms 16984 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16984 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 4 ms 16988 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 3 ms 16988 KB Output is correct
27 Correct 4 ms 17076 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 17188 KB Output is correct
30 Correct 3 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16988 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct
34 Correct 5 ms 16988 KB Output is correct
35 Correct 67 ms 24916 KB Output is correct
36 Correct 101 ms 34920 KB Output is correct
37 Correct 103 ms 35420 KB Output is correct
38 Correct 98 ms 34900 KB Output is correct
39 Correct 5 ms 16988 KB Output is correct
40 Correct 5 ms 17244 KB Output is correct
41 Correct 5 ms 17244 KB Output is correct
42 Correct 5 ms 16984 KB Output is correct
43 Correct 40 ms 17240 KB Output is correct
44 Correct 38 ms 17240 KB Output is correct
45 Correct 5 ms 16984 KB Output is correct
46 Correct 5 ms 16988 KB Output is correct
47 Correct 7 ms 17244 KB Output is correct
48 Correct 7 ms 17324 KB Output is correct
49 Correct 24 ms 24488 KB Output is correct
50 Correct 102 ms 35152 KB Output is correct
51 Correct 35 ms 17496 KB Output is correct
52 Correct 90 ms 33680 KB Output is correct
53 Correct 26 ms 25948 KB Output is correct
54 Correct 111 ms 34680 KB Output is correct
55 Correct 28 ms 30804 KB Output is correct
56 Correct 28 ms 30956 KB Output is correct
57 Correct 24 ms 29788 KB Output is correct
58 Correct 29 ms 29932 KB Output is correct
59 Correct 5 ms 17244 KB Output is correct
60 Correct 57 ms 19424 KB Output is correct
61 Correct 10 ms 17244 KB Output is correct
62 Correct 98 ms 34644 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 4 ms 16984 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16988 KB Output is correct
13 Correct 4 ms 16984 KB Output is correct
14 Correct 4 ms 16984 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16984 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 4 ms 16988 KB Output is correct
22 Correct 4 ms 16988 KB Output is correct
23 Correct 4 ms 16988 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 3 ms 16988 KB Output is correct
27 Correct 4 ms 17076 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 17188 KB Output is correct
30 Correct 3 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16988 KB Output is correct
33 Correct 4 ms 16984 KB Output is correct
34 Correct 5 ms 16988 KB Output is correct
35 Correct 67 ms 24916 KB Output is correct
36 Correct 101 ms 34920 KB Output is correct
37 Correct 103 ms 35420 KB Output is correct
38 Correct 98 ms 34900 KB Output is correct
39 Correct 5 ms 16988 KB Output is correct
40 Correct 5 ms 17244 KB Output is correct
41 Correct 5 ms 17244 KB Output is correct
42 Correct 5 ms 16984 KB Output is correct
43 Correct 40 ms 17240 KB Output is correct
44 Correct 38 ms 17240 KB Output is correct
45 Correct 5 ms 16984 KB Output is correct
46 Correct 5 ms 16988 KB Output is correct
47 Correct 7 ms 17244 KB Output is correct
48 Correct 7 ms 17324 KB Output is correct
49 Correct 24 ms 24488 KB Output is correct
50 Correct 102 ms 35152 KB Output is correct
51 Correct 35 ms 17496 KB Output is correct
52 Correct 90 ms 33680 KB Output is correct
53 Correct 26 ms 25948 KB Output is correct
54 Correct 111 ms 34680 KB Output is correct
55 Correct 28 ms 30804 KB Output is correct
56 Correct 28 ms 30956 KB Output is correct
57 Correct 24 ms 29788 KB Output is correct
58 Correct 29 ms 29932 KB Output is correct
59 Correct 5 ms 17244 KB Output is correct
60 Correct 57 ms 19424 KB Output is correct
61 Correct 10 ms 17244 KB Output is correct
62 Correct 98 ms 34644 KB Output is correct
63 Correct 408 ms 69712 KB Output is correct
64 Correct 428 ms 69712 KB Output is correct
65 Correct 418 ms 69712 KB Output is correct
66 Correct 87 ms 23736 KB Output is correct
67 Correct 188 ms 34740 KB Output is correct
68 Correct 95 ms 24020 KB Output is correct
69 Correct 4258 ms 31572 KB Output is correct
70 Correct 83 ms 23740 KB Output is correct
71 Correct 82 ms 23824 KB Output is correct
72 Correct 856 ms 32236 KB Output is correct
73 Correct 872 ms 32832 KB Output is correct
74 Correct 1159 ms 141320 KB Output is correct
75 Incorrect 4651 ms 37860 KB Output isn't correct
76 Halted 0 ms 0 KB -