oj.uz

Submission #938488

# Submission time Handle Problem Language Result Execution time Memory
938488 2024-03-05T07:54:12 Z guagua0407 Making Friends on Joitter is Fun (JOI20_joitter2) C++17
17 / 100
 5000 ms 81596 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

vector<map<int,int>> S1,S2,R1,R2;
queue<pair<int,int>> q;
ll ans=0;

struct DSU{
    vector<int> e;
    DSU(int n){
        e=vector<int>(n,-1);
    }
    int find(int x){
        return (e[x]<0?x:e[x]=find(e[x]));
    }
    bool same(int a,int b){
        return find(a)==find(b);
    }
    int sz(int x){
        return -e[find(x)];
    }
    bool unite(int a,int b){
        a=find(a);
        b=find(b);
        if(a==b) return false;
        ans+=2ll*sz(a)*sz(b)-1ll*S2[a][b]*sz(b)-1ll*S2[b][a]*sz(a);
        //cout<<S2[a][b]<<' '<<sz(b)<<'\n';
        //cout<<S2[b][a]<<' '<<sz(a)<<'\n';
        //cout<<a+1<<' '<<b+1<<' '<<2ll*sz(a)*sz(b)-1ll*S2[a][b]*sz(b)-1ll*S2[b][a]*sz(a)<<'\n';
        // clear (a,b) edges
        S2[a].erase(b);
        S2[b].erase(a);
        R2[a].erase(b);
        R2[b].erase(a);
        int cnt=0;
        for(auto it=R1[a].begin();it!=R1[a].end();){
            if(find((*it).f)==b){
                S1[(*it).f].erase(a);
                it=R1[a].erase(it);
            }
            else{
                it++;
            }
        }
        for(auto it=R1[b].begin();it!=R1[b].end();){
            if(find((*it).f)==a){
                S1[(*it).f].erase(b);
                it=R1[b].erase(it);
            }
            else{
                it++;
            }
        }
        //new one way edges
        for(auto v:R1[a]){
            if(R1[b].find(v.f)!=R1[b].end()){
                cnt++;
            }
        }
        ans+=1ll*((int)R1[a].size()-cnt)*sz(b)+1ll*((int)R1[b].size()-cnt)*sz(a);
        //out<<a+1<<' '<<b+1<<' '<<1ll*((int)R1[a].size()-cnt)*sz(b)+1ll*((int)R1[b].size()-cnt)*sz(a)<<'\n';
        //new scc edges
        for(auto v:R2[a]){
            if(S2[b].find(v.f)!=S2[b].end()){
                q.push({v.f,b});
            }
        }
        for(auto v:R2[b]){
            if(S2[a].find(v.f)!=S2[a].end()){
                q.push({v.f,a});
            }
        }
        // merge
        if(S2[a].size()+R1[a].size()+R2[a].size()<S2[b].size()+R1[b].size()+R2[b].size()) swap(a,b);
        for(auto v:R1[a]){
            if(R1[b].find(v.f)!=R1[b].end()){
                S2[find(v.f)][b]--;
                R2[b][find(v.f)]--;
            }
        }
        for(auto v:S2[b]){
            S2[a][v.f]+=v.s;
            R2[v.f].erase(b);
            R2[v.f][a]+=v.s;
        }
        for(auto v:R1[b]){
            S1[v.f].erase(b);
            S1[v.f][a]=1;
            R1[a][v.f]=1;
        }
        for(auto v:R2[b]){
            S2[v.f].erase(b);
            S2[v.f][a]+=v.s;
            R2[a][v.f]+=v.s;
        }
        e[a]+=e[b];
        e[b]=a;
        return true;
    }
};

int main() {_
    int n,m;
    cin>>n>>m;
    //assert(n==4 and m==6);
    S1.resize(n);
    S2.resize(n);
    R1.resize(n);
    R2.resize(n);
    DSU dsu(n);
    for(int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        a--;
        b--;
        if(dsu.same(a,b)){
            cout<<ans<<'\n';
            continue;
        }
        int pa=dsu.find(a);
        int pb=dsu.find(b);
        if(S1[a].find(pb)!=S1[a].end()){
            cout<<ans<<'\n';
            continue;
        }
        S1[a][pb]++;
        S2[pa][pb]++;
        R1[pb][a]=1;
        R2[pb][pa]++;
        ans+=dsu.sz(pb);
        //cout<<"-"<<'\n';
        if(S2[pb].find(pa)!=S2[pb].end()){
            //cout<<i+1<<' '<<pa+1<<' '<<pb+1<<'\n';
            q.push({pa,pb});
            while(!q.empty()){
                auto tmp=q.front();
                q.pop();
                dsu.unite(tmp.f,tmp.s);
            }
        }
        cout<<ans<<'\n';
    }
    return 0;
}
//maybe its multiset not set
//yeeorz
//laborz
/*

1
2
3
4
5
6
9
9
10
10
12
20
20
20
20
20
20

1
2
3
4
5
6
9
9
10
10
12
22
22
22
22
22
22
*/

Compilation message

joitter2.cpp: In function 'void setIO(std::string)':
joitter2.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 452 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 500 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 452 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 70 ms 6744 KB Output is correct
36 Correct 143 ms 10320 KB Output is correct
37 Correct 145 ms 10388 KB Output is correct
38 Correct 145 ms 9808 KB Output is correct
39 Correct 2 ms 856 KB Output is correct
40 Correct 3 ms 856 KB Output is correct
41 Correct 3 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 18 ms 860 KB Output is correct
44 Correct 18 ms 860 KB Output is correct
45 Correct 2 ms 908 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 4 ms 860 KB Output is correct
48 Correct 4 ms 860 KB Output is correct
49 Correct 22 ms 2104 KB Output is correct
50 Correct 154 ms 10472 KB Output is correct
51 Correct 25 ms 1368 KB Output is correct
52 Correct 116 ms 8188 KB Output is correct
53 Correct 24 ms 1884 KB Output is correct
54 Correct 130 ms 9292 KB Output is correct
55 Correct 25 ms 1628 KB Output is correct
56 Correct 25 ms 1628 KB Output is correct
57 Correct 17 ms 1628 KB Output is correct
58 Correct 17 ms 1628 KB Output is correct
59 Correct 2 ms 856 KB Output is correct
60 Correct 52 ms 5620 KB Output is correct
61 Correct 7 ms 1112 KB Output is correct
62 Correct 137 ms 9664 KB Output is correct

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 452 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 500 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 452 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 70 ms 6744 KB Output is correct
36 Correct 143 ms 10320 KB Output is correct
37 Correct 145 ms 10388 KB Output is correct
38 Correct 145 ms 9808 KB Output is correct
39 Correct 2 ms 856 KB Output is correct
40 Correct 3 ms 856 KB Output is correct
41 Correct 3 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 18 ms 860 KB Output is correct
44 Correct 18 ms 860 KB Output is correct
45 Correct 2 ms 908 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 4 ms 860 KB Output is correct
48 Correct 4 ms 860 KB Output is correct
49 Correct 22 ms 2104 KB Output is correct
50 Correct 154 ms 10472 KB Output is correct
51 Correct 25 ms 1368 KB Output is correct
52 Correct 116 ms 8188 KB Output is correct
53 Correct 24 ms 1884 KB Output is correct
54 Correct 130 ms 9292 KB Output is correct
55 Correct 25 ms 1628 KB Output is correct
56 Correct 25 ms 1628 KB Output is correct
57 Correct 17 ms 1628 KB Output is correct
58 Correct 17 ms 1628 KB Output is correct
59 Correct 2 ms 856 KB Output is correct
60 Correct 52 ms 5620 KB Output is correct
61 Correct 7 ms 1112 KB Output is correct
62 Correct 137 ms 9664 KB Output is correct
63 Correct 532 ms 81596 KB Output is correct
64 Correct 518 ms 81388 KB Output is correct
65 Correct 508 ms 81236 KB Output is correct
66 Correct 98 ms 23892 KB Output is correct
67 Correct 231 ms 33136 KB Output is correct
68 Correct 103 ms 23888 KB Output is correct
69 Execution timed out 5062 ms 27608 KB Time limit exceeded
70 Halted 0 ms 0 KB -