oj.uz

Submission #953224

# Submission time Handle Problem Language Result Execution time Memory
953224 2024-03-25T17:41:24 Z andrei_boaca Making Friends on Joitter is Fun (JOI20_joitter2) C++17
17 / 100
 1834 ms 94412 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;
    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())
        {
            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;
        }
        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();
    vector<ll> v;
    for(ll i:par[c1])
    {
        v.push_back(comp[i]);
        if(v.size()>500)
            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

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 17012 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 17036 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 6 ms 16988 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 4 ms 16988 KB Output is correct
12 Correct 3 ms 17240 KB Output is correct
13 Correct 4 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 3 ms 16828 KB Output is correct
16 Correct 4 ms 16984 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 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 3 ms 16988 KB Output is correct
23 Correct 4 ms 17244 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 17076 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 16988 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 17012 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 17036 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 6 ms 16988 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 4 ms 16988 KB Output is correct
12 Correct 3 ms 17240 KB Output is correct
13 Correct 4 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 3 ms 16828 KB Output is correct
16 Correct 4 ms 16984 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 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 3 ms 16988 KB Output is correct
23 Correct 4 ms 17244 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 17076 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 16988 KB Output is correct
34 Correct 5 ms 16988 KB Output is correct
35 Correct 87 ms 22740 KB Output is correct
36 Correct 94 ms 27728 KB Output is correct
37 Correct 102 ms 27984 KB Output is correct
38 Correct 96 ms 27728 KB Output is correct
39 Correct 5 ms 16988 KB Output is correct
40 Correct 6 ms 17340 KB Output is correct
41 Correct 6 ms 17244 KB Output is correct
42 Correct 5 ms 16988 KB Output is correct
43 Correct 19 ms 17244 KB Output is correct
44 Correct 22 ms 17500 KB Output is correct
45 Correct 5 ms 16988 KB Output is correct
46 Correct 5 ms 16988 KB Output is correct
47 Correct 7 ms 17240 KB Output is correct
48 Correct 6 ms 17496 KB Output is correct
49 Correct 19 ms 21340 KB Output is correct
50 Correct 97 ms 27988 KB Output is correct
51 Correct 22 ms 17496 KB Output is correct
52 Correct 85 ms 26456 KB Output is correct
53 Correct 19 ms 21848 KB Output is correct
54 Correct 90 ms 27132 KB Output is correct
55 Correct 21 ms 24156 KB Output is correct
56 Correct 22 ms 24412 KB Output is correct
57 Correct 20 ms 23440 KB Output is correct
58 Correct 21 ms 23644 KB Output is correct
59 Correct 5 ms 17244 KB Output is correct
60 Correct 67 ms 19548 KB Output is correct
61 Correct 8 ms 17240 KB Output is correct
62 Correct 92 ms 27312 KB Output is correct

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 17012 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 17036 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 6 ms 16988 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 4 ms 16988 KB Output is correct
12 Correct 3 ms 17240 KB Output is correct
13 Correct 4 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 3 ms 16828 KB Output is correct
16 Correct 4 ms 16984 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 4 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 3 ms 16988 KB Output is correct
23 Correct 4 ms 17244 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 4 ms 16988 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct
29 Correct 4 ms 17076 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 16988 KB Output is correct
34 Correct 5 ms 16988 KB Output is correct
35 Correct 87 ms 22740 KB Output is correct
36 Correct 94 ms 27728 KB Output is correct
37 Correct 102 ms 27984 KB Output is correct
38 Correct 96 ms 27728 KB Output is correct
39 Correct 5 ms 16988 KB Output is correct
40 Correct 6 ms 17340 KB Output is correct
41 Correct 6 ms 17244 KB Output is correct
42 Correct 5 ms 16988 KB Output is correct
43 Correct 19 ms 17244 KB Output is correct
44 Correct 22 ms 17500 KB Output is correct
45 Correct 5 ms 16988 KB Output is correct
46 Correct 5 ms 16988 KB Output is correct
47 Correct 7 ms 17240 KB Output is correct
48 Correct 6 ms 17496 KB Output is correct
49 Correct 19 ms 21340 KB Output is correct
50 Correct 97 ms 27988 KB Output is correct
51 Correct 22 ms 17496 KB Output is correct
52 Correct 85 ms 26456 KB Output is correct
53 Correct 19 ms 21848 KB Output is correct
54 Correct 90 ms 27132 KB Output is correct
55 Correct 21 ms 24156 KB Output is correct
56 Correct 22 ms 24412 KB Output is correct
57 Correct 20 ms 23440 KB Output is correct
58 Correct 21 ms 23644 KB Output is correct
59 Correct 5 ms 17244 KB Output is correct
60 Correct 67 ms 19548 KB Output is correct
61 Correct 8 ms 17240 KB Output is correct
62 Correct 92 ms 27312 KB Output is correct
63 Correct 432 ms 69712 KB Output is correct
64 Correct 439 ms 69716 KB Output is correct
65 Correct 410 ms 69752 KB Output is correct
66 Correct 101 ms 23844 KB Output is correct
67 Correct 176 ms 34880 KB Output is correct
68 Correct 84 ms 23724 KB Output is correct
69 Correct 1635 ms 33092 KB Output is correct
70 Correct 91 ms 26116 KB Output is correct
71 Correct 96 ms 26052 KB Output is correct
72 Correct 430 ms 34504 KB Output is correct
73 Correct 434 ms 35072 KB Output is correct
74 Correct 953 ms 94412 KB Output is correct
75 Incorrect 1834 ms 41292 KB Output isn't correct
76 Halted 0 ms 0 KB -