oj.uz

Submission #772951

# Submission time Handle Problem Language Result Execution time Memory
772951 2023-07-04T13:28:31 Z bachhoangxuan Making Friends on Joitter is Fun (JOI20_joitter2) C++17
100 / 100
 554 ms 51092 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m,ans=0;cin >> n >> m;
    vector<set<pii>> s(n);
    vector<set<int>> t(n);
    vector<int> par(n),sz(n);
    for(int i=0;i<n;i++) par[i]=i,sz[i]=1;
    function<int(int)> findpar = [&](int u){
        if(u!=par[u]) return par[u]=findpar(par[u]);
        return u;
    };
    function<void(int,int)> add = [&](int u,int v){
        int x=findpar(u),y=findpar(v);
        if(x==y) return;
        auto it=s[y].lower_bound({x,0});
        if(it!=s[y].end() && it->fi==x){
            if(sz[y]>sz[x]) swap(x,y);
            vector<pii> nw;
            for(pii p:s[y]){
                ans-=sz[p.fi];
                t[p.fi].erase(p.se);
                if(p.fi!=x) nw.push_back({p.se,p.fi});
            }
            ans+=sz[y]*(2*sz[x]+(int)t[x].size()-(int)t[y].size());
            for(int p:t[y]){
                int pr=findpar(p);
                s[pr].erase({y,p});
                if(pr!=x) nw.push_back({p,x});
            }
            par[y]=x;sz[x]+=sz[y];
            for(pii p:nw) add(p.fi,p.se);
        }
        else if(t[y].find(u)==t[y].end()){
            ans+=sz[y];
            s[x].insert({y,u});
            t[y].insert(u);
        }
    };
    for(int i=1;i<=m;i++){
        int u,v;cin >> u >> v;
        u--;v--;add(u,v);
        cout << ans << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 2 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 65 ms 6148 KB Output is correct
36 Correct 86 ms 8912 KB Output is correct
37 Correct 80 ms 9076 KB Output is correct
38 Correct 89 ms 8676 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 852 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 668 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 2 ms 756 KB Output is correct
49 Correct 7 ms 1620 KB Output is correct
50 Correct 81 ms 9080 KB Output is correct
51 Correct 5 ms 992 KB Output is correct
52 Correct 81 ms 7500 KB Output is correct
53 Correct 6 ms 1492 KB Output is correct
54 Correct 71 ms 8324 KB Output is correct
55 Correct 3 ms 972 KB Output is correct
56 Correct 3 ms 980 KB Output is correct
57 Correct 3 ms 1032 KB Output is correct
58 Correct 4 ms 980 KB Output is correct
59 Correct 2 ms 612 KB Output is correct
60 Correct 71 ms 5596 KB Output is correct
61 Correct 5 ms 852 KB Output is correct
62 Correct 76 ms 8548 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 65 ms 6148 KB Output is correct
36 Correct 86 ms 8912 KB Output is correct
37 Correct 80 ms 9076 KB Output is correct
38 Correct 89 ms 8676 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 852 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 668 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 2 ms 756 KB Output is correct
49 Correct 7 ms 1620 KB Output is correct
50 Correct 81 ms 9080 KB Output is correct
51 Correct 5 ms 992 KB Output is correct
52 Correct 81 ms 7500 KB Output is correct
53 Correct 6 ms 1492 KB Output is correct
54 Correct 71 ms 8324 KB Output is correct
55 Correct 3 ms 972 KB Output is correct
56 Correct 3 ms 980 KB Output is correct
57 Correct 3 ms 1032 KB Output is correct
58 Correct 4 ms 980 KB Output is correct
59 Correct 2 ms 612 KB Output is correct
60 Correct 71 ms 5596 KB Output is correct
61 Correct 5 ms 852 KB Output is correct
62 Correct 76 ms 8548 KB Output is correct
63 Correct 286 ms 49576 KB Output is correct
64 Correct 317 ms 49552 KB Output is correct
65 Correct 319 ms 49528 KB Output is correct
66 Correct 76 ms 20280 KB Output is correct
67 Correct 160 ms 24916 KB Output is correct
68 Correct 74 ms 20368 KB Output is correct
69 Correct 167 ms 22852 KB Output is correct
70 Correct 76 ms 20296 KB Output is correct
71 Correct 75 ms 20304 KB Output is correct
72 Correct 169 ms 25584 KB Output is correct
73 Correct 167 ms 25552 KB Output is correct
74 Correct 554 ms 51092 KB Output is correct
75 Correct 284 ms 29104 KB Output is correct
76 Correct 389 ms 38144 KB Output is correct
77 Correct 416 ms 38324 KB Output is correct
78 Correct 106 ms 23940 KB Output is correct
79 Correct 216 ms 29036 KB Output is correct
80 Correct 107 ms 24628 KB Output is correct
81 Correct 171 ms 28432 KB Output is correct
82 Correct 378 ms 37964 KB Output is correct
83 Correct 364 ms 38012 KB Output is correct
84 Correct 354 ms 37924 KB Output is correct
85 Correct 348 ms 37832 KB Output is correct
86 Correct 97 ms 21100 KB Output is correct
87 Correct 101 ms 23340 KB Output is correct
88 Correct 171 ms 25932 KB Output is correct
89 Correct 389 ms 36744 KB Output is correct