oj.uz

Submission #953259

# Submission time Handle Problem Language Result Execution time Memory
953259 2024-03-25T18:29:15 Z andrei_boaca Making Friends on Joitter is Fun (JOI20_joitter2) C++17
17 / 100
 5000 ms 69760 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];
bool fst=1;
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;
    if(fst==1)
    {
        for(ll i:par[c1])
            if(edgecomp[comp[c1]].find(comp[i])!=edgecomp[comp[c1]].end())
                if(edgecomp[comp[i]].find(comp[c1])!=edgecomp[comp[i]].end())
                    assert(false);
    }
    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<pll> pls;
    bool found=0;
    if(fst==1)
    {
        for(ll i:why)
            if(edgecomp[comp[c1]].find(comp[i])!=edgecomp[comp[c1]].end())
                if(edgecomp[comp[i]].find(comp[c1])!=edgecomp[comp[i]].end())
                    found=1;
    }
    for(ll i:par[c1])
        if(edgecomp[comp[c1]].find(comp[i])!=edgecomp[comp[c1]].end())
            if(edgecomp[comp[i]].find(comp[c1])!=edgecomp[comp[i]].end())
            {
                /*if(fst==1)
                    assert(found);*/
                //dsu_merge(comp[i],comp[c1]);
                pls.push_back({comp[i],comp[c1]});
            }
    fst=0;
    for(pll p:pls)
    {
        ll a=p.first,b=p.second;
        if(comp[a]!=comp[b])
            dsu_merge(comp[a],comp[b]);
    }
}
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())
        {
            fst=1;
            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;
}

Compilation message

joitter2.cpp: In function 'void dsu_merge(ll, ll)':
joitter2.cpp:83:10: warning: variable 'found' set but not used [-Wunused-but-set-variable]
   83 |     bool found=0;
      |          ^~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 5 ms 16988 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 4 ms 16840 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 3 ms 17048 KB Output is correct
18 Correct 4 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 5 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 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 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16984 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 3 ms 16984 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 5 ms 16988 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 4 ms 16840 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 3 ms 17048 KB Output is correct
18 Correct 4 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 5 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 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 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16984 KB Output is correct
33 Correct 4 ms 16988 KB Output is correct
34 Correct 5 ms 16984 KB Output is correct
35 Correct 81 ms 25648 KB Output is correct
36 Correct 229 ms 49200 KB Output is correct
37 Correct 237 ms 49764 KB Output is correct
38 Correct 231 ms 48472 KB Output is correct
39 Correct 5 ms 16984 KB Output is correct
40 Correct 6 ms 17296 KB Output is correct
41 Correct 5 ms 17244 KB Output is correct
42 Correct 5 ms 16988 KB Output is correct
43 Correct 35 ms 17340 KB Output is correct
44 Correct 34 ms 17244 KB Output is correct
45 Correct 5 ms 16988 KB Output is correct
46 Correct 5 ms 16988 KB Output is correct
47 Correct 6 ms 17244 KB Output is correct
48 Correct 7 ms 17344 KB Output is correct
49 Correct 27 ms 23592 KB Output is correct
50 Correct 236 ms 48468 KB Output is correct
51 Correct 31 ms 17496 KB Output is correct
52 Correct 181 ms 41480 KB Output is correct
53 Correct 28 ms 23640 KB Output is correct
54 Correct 205 ms 46160 KB Output is correct
55 Correct 25 ms 20304 KB Output is correct
56 Correct 22 ms 19804 KB Output is correct
57 Correct 17 ms 18268 KB Output is correct
58 Correct 18 ms 18380 KB Output is correct
59 Correct 5 ms 17240 KB Output is correct
60 Correct 59 ms 19536 KB Output is correct
61 Correct 10 ms 17244 KB Output is correct
62 Correct 214 ms 47708 KB Output is correct

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 5 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 5 ms 16988 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 4 ms 16840 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 4 ms 16988 KB Output is correct
17 Correct 3 ms 17048 KB Output is correct
18 Correct 4 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 5 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 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 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 4 ms 16984 KB Output is correct
33 Correct 4 ms 16988 KB Output is correct
34 Correct 5 ms 16984 KB Output is correct
35 Correct 81 ms 25648 KB Output is correct
36 Correct 229 ms 49200 KB Output is correct
37 Correct 237 ms 49764 KB Output is correct
38 Correct 231 ms 48472 KB Output is correct
39 Correct 5 ms 16984 KB Output is correct
40 Correct 6 ms 17296 KB Output is correct
41 Correct 5 ms 17244 KB Output is correct
42 Correct 5 ms 16988 KB Output is correct
43 Correct 35 ms 17340 KB Output is correct
44 Correct 34 ms 17244 KB Output is correct
45 Correct 5 ms 16988 KB Output is correct
46 Correct 5 ms 16988 KB Output is correct
47 Correct 6 ms 17244 KB Output is correct
48 Correct 7 ms 17344 KB Output is correct
49 Correct 27 ms 23592 KB Output is correct
50 Correct 236 ms 48468 KB Output is correct
51 Correct 31 ms 17496 KB Output is correct
52 Correct 181 ms 41480 KB Output is correct
53 Correct 28 ms 23640 KB Output is correct
54 Correct 205 ms 46160 KB Output is correct
55 Correct 25 ms 20304 KB Output is correct
56 Correct 22 ms 19804 KB Output is correct
57 Correct 17 ms 18268 KB Output is correct
58 Correct 18 ms 18380 KB Output is correct
59 Correct 5 ms 17240 KB Output is correct
60 Correct 59 ms 19536 KB Output is correct
61 Correct 10 ms 17244 KB Output is correct
62 Correct 214 ms 47708 KB Output is correct
63 Correct 397 ms 69712 KB Output is correct
64 Correct 416 ms 69760 KB Output is correct
65 Correct 415 ms 69716 KB Output is correct
66 Correct 87 ms 23752 KB Output is correct
67 Correct 187 ms 34764 KB Output is correct
68 Correct 91 ms 23752 KB Output is correct
69 Execution timed out 5048 ms 25680 KB Time limit exceeded
70 Halted 0 ms 0 KB -