oj.uz

답안 #1000271

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000271 2024-06-17T07:45:11 Z snpmrnhlol 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
100 / 100
 516 ms 141748 KB 
#include<bits/stdc++.h>
//#define cin fin
//#define cout fout
using namespace std;
//ifstream fin("a.in");
//ofstream fout("a.out");
const int N = 2e5;
typedef long long ll;
ll ans = 0;
int n,m;
struct DSU{
    int p,sz;
    set <int> boys;
    vector <int> comp;
}dsu[N];
set <int> edges[N];
multiset <int> compedges[N];
int leader(int x){
    if(x == dsu[x].p)return x;
    return dsu[x].p = leader(dsu[x].p);
}
bool checkedge(int x,int y){
    int compx = leader(x);
    int compy = leader(y);
    if(compx == compy)return 1;
    if(dsu[compy].boys.find(x) != dsu[compy].boys.end())return 1;
    return 0;
}
bool check(int x,int y){
    if(x == y)return 1;
    if(compedges[x].find(y) != compedges[x].end())return 1;
    return 0;
}
void connect(int x,int y){
    x = leader(x);
    y = leader(y);
    if(x == y)return;
    if(dsu[x].sz + dsu[x].boys.size() + compedges[x].size() > dsu[y].sz + dsu[y].boys.size() + compedges[y].size())swap(x,y);
    ///check new edges
    queue <int> q;
    int nr1 = -1;
    for(auto i:dsu[x].boys){
        if(leader(i) == x || leader(i) == y)continue;
        if(check(leader(i),y) && check(x,leader(i))){
            q.push(leader(i));
        }
        if(check(leader(i),x) && check(y,leader(i))){
            q.push(leader(i));
        }
    }
    for(auto i:compedges[x]){
        if(leader(i) == x || leader(i) == y)continue;
        if(check(leader(i),y) && check(x,leader(i))){
            q.push(leader(i));
        }
        if(check(leader(i),x) && check(y,leader(i))){
            q.push(leader(i));
        }
    }
    ///y connected to x
    auto it = dsu[x].boys.begin();
    while(it != dsu[x].boys.end()){
        if(leader(*it) == y){
            ans-=dsu[x].sz;
            it = dsu[x].boys.erase(it);
            edges[*it].erase(x);
            compedges[y].erase(compedges[y].find(x));
        }else{
            it++;
        }
    }
    ///x connected to y
    for(auto i:dsu[x].comp){
        auto it = dsu[y].boys.find(i);
        if(it != dsu[y].boys.end()){
            ans-=dsu[y].sz;
            dsu[y].boys.erase(it);
            edges[*it].erase(y);
            compedges[x].erase(compedges[x].find(y));
        }
        dsu[y].comp.push_back(i);
    }
    ans+=1ll*dsu[x].boys.size()*dsu[y].sz;
    ans+=1ll*dsu[y].boys.size()*dsu[x].sz;
    ///x and y connected to random node
    for(auto i:dsu[x].boys){
        assert(leader(i) != y);
        if(dsu[y].boys.find(i) != dsu[y].boys.end()){
            ans-=dsu[x].sz;
            ans-=dsu[y].sz;
        }
        dsu[y].boys.insert(i);
        edges[i].erase(x);
        compedges[leader(i)].erase(compedges[leader(i)].find(leader(x)));
        edges[i].insert(y);
        compedges[leader(i)].insert(leader(y));
    }
    for(auto i:compedges[x]){
        compedges[y].insert(i);
    }
    ans+=2ll*dsu[x].sz*dsu[y].sz;
    dsu[x].p = y;
    dsu[y].sz+=dsu[x].sz;
    dsu[x].comp.clear();
    dsu[x].boys.clear();
    compedges[x].clear();
    while(!q.empty()){
        int x = q.front();
        q.pop();
        connect(y,x);

    }
}
void addedge(int x,int y){
    int compx = leader(x);
    int compy = leader(y);
    if(checkedge(x,y))return;
    if(check(compy,compx)){
        connect(x,y);
    }else{
        dsu[compy].boys.insert(x);
        edges[x].insert(compy);
        compedges[compx].insert(compy);
        ans+=dsu[compy].sz;
    }
}
void dbg(){
    for(int i = 0;i < n;i++){
        cout<<"dsuinvestigate:"<<i<<'\n';
        cout<<dsu[i].p<<' '<<dsu[i].sz<<'\n';
        for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
        for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(int i = 0;i < n;i++){
        dsu[i] = {i,1};
        dsu[i].comp.push_back(i);
    }
    for(int i = 0;i < m;i++){
        int u,w;
        cin>>u>>w;
        u--;w--;
        addedge(u,w);
        //dbg();
        cout<<ans<<'\n';
    }
    return 0;
}
/**
5 20
4 2
1 5
2 3
2 5
3 2
3 1
4 5
1 2
5 2
1 4
4 1
3 4
5 1
2 4
2 1
4 3
1 3
5 4
3 5
5 3

**/

Compilation message

joitter2.cpp: In function 'void connect(int, int)':
joitter2.cpp:41:9: warning: unused variable 'nr1' [-Wunused-variable]
   41 |     int nr1 = -1;
      |         ^~~
joitter2.cpp: In function 'void dbg()':
joitter2.cpp:131:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  131 |         for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
      |         ^~~
joitter2.cpp:131:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  131 |         for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
      |                                             ^~~~
joitter2.cpp:132:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  132 |         for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
      |         ^~~
joitter2.cpp:132:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  132 |         for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
      |                                             ^~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 6 ms 34652 KB Output is correct
4 Correct 5 ms 34756 KB Output is correct
5 Correct 6 ms 34652 KB Output is correct
6 Correct 6 ms 34652 KB Output is correct
7 Correct 8 ms 34908 KB Output is correct
8 Correct 6 ms 34908 KB Output is correct
9 Correct 6 ms 34908 KB Output is correct
10 Correct 6 ms 34684 KB Output is correct
11 Correct 6 ms 34652 KB Output is correct
12 Correct 6 ms 34652 KB Output is correct
13 Correct 5 ms 34652 KB Output is correct
14 Correct 6 ms 34760 KB Output is correct
15 Correct 5 ms 34652 KB Output is correct
16 Correct 5 ms 34744 KB Output is correct
17 Correct 6 ms 34652 KB Output is correct
18 Correct 6 ms 34652 KB Output is correct
19 Correct 5 ms 34908 KB Output is correct
20 Correct 6 ms 34908 KB Output is correct
21 Correct 6 ms 34908 KB Output is correct
22 Correct 6 ms 34908 KB Output is correct
23 Correct 6 ms 34932 KB Output is correct
24 Correct 5 ms 34908 KB Output is correct
25 Correct 6 ms 34908 KB Output is correct
26 Correct 5 ms 34676 KB Output is correct
27 Correct 5 ms 34908 KB Output is correct
28 Correct 6 ms 34908 KB Output is correct
29 Correct 6 ms 34908 KB Output is correct
30 Correct 6 ms 34652 KB Output is correct
31 Correct 6 ms 34908 KB Output is correct
32 Correct 6 ms 34648 KB Output is correct
33 Correct 6 ms 34908 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 6 ms 34652 KB Output is correct
4 Correct 5 ms 34756 KB Output is correct
5 Correct 6 ms 34652 KB Output is correct
6 Correct 6 ms 34652 KB Output is correct
7 Correct 8 ms 34908 KB Output is correct
8 Correct 6 ms 34908 KB Output is correct
9 Correct 6 ms 34908 KB Output is correct
10 Correct 6 ms 34684 KB Output is correct
11 Correct 6 ms 34652 KB Output is correct
12 Correct 6 ms 34652 KB Output is correct
13 Correct 5 ms 34652 KB Output is correct
14 Correct 6 ms 34760 KB Output is correct
15 Correct 5 ms 34652 KB Output is correct
16 Correct 5 ms 34744 KB Output is correct
17 Correct 6 ms 34652 KB Output is correct
18 Correct 6 ms 34652 KB Output is correct
19 Correct 5 ms 34908 KB Output is correct
20 Correct 6 ms 34908 KB Output is correct
21 Correct 6 ms 34908 KB Output is correct
22 Correct 6 ms 34908 KB Output is correct
23 Correct 6 ms 34932 KB Output is correct
24 Correct 5 ms 34908 KB Output is correct
25 Correct 6 ms 34908 KB Output is correct
26 Correct 5 ms 34676 KB Output is correct
27 Correct 5 ms 34908 KB Output is correct
28 Correct 6 ms 34908 KB Output is correct
29 Correct 6 ms 34908 KB Output is correct
30 Correct 6 ms 34652 KB Output is correct
31 Correct 6 ms 34908 KB Output is correct
32 Correct 6 ms 34648 KB Output is correct
33 Correct 6 ms 34908 KB Output is correct
34 Correct 7 ms 34908 KB Output is correct
35 Correct 57 ms 38908 KB Output is correct
36 Correct 81 ms 41608 KB Output is correct
37 Correct 80 ms 41512 KB Output is correct
38 Correct 75 ms 41132 KB Output is correct
39 Correct 7 ms 34904 KB Output is correct
40 Correct 10 ms 35108 KB Output is correct
41 Correct 7 ms 35164 KB Output is correct
42 Correct 7 ms 34904 KB Output is correct
43 Correct 7 ms 35168 KB Output is correct
44 Correct 7 ms 34908 KB Output is correct
45 Correct 7 ms 34908 KB Output is correct
46 Correct 7 ms 35012 KB Output is correct
47 Correct 8 ms 35164 KB Output is correct
48 Correct 8 ms 34996 KB Output is correct
49 Correct 15 ms 36188 KB Output is correct
50 Correct 94 ms 41604 KB Output is correct
51 Correct 11 ms 35160 KB Output is correct
52 Correct 67 ms 40128 KB Output is correct
53 Correct 13 ms 35928 KB Output is correct
54 Correct 72 ms 41116 KB Output is correct
55 Correct 11 ms 35420 KB Output is correct
56 Correct 11 ms 35420 KB Output is correct
57 Correct 13 ms 36956 KB Output is correct
58 Correct 11 ms 36956 KB Output is correct
59 Correct 7 ms 35160 KB Output is correct
60 Correct 51 ms 37424 KB Output is correct
61 Correct 8 ms 35164 KB Output is correct
62 Correct 75 ms 41132 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 6 ms 34652 KB Output is correct
4 Correct 5 ms 34756 KB Output is correct
5 Correct 6 ms 34652 KB Output is correct
6 Correct 6 ms 34652 KB Output is correct
7 Correct 8 ms 34908 KB Output is correct
8 Correct 6 ms 34908 KB Output is correct
9 Correct 6 ms 34908 KB Output is correct
10 Correct 6 ms 34684 KB Output is correct
11 Correct 6 ms 34652 KB Output is correct
12 Correct 6 ms 34652 KB Output is correct
13 Correct 5 ms 34652 KB Output is correct
14 Correct 6 ms 34760 KB Output is correct
15 Correct 5 ms 34652 KB Output is correct
16 Correct 5 ms 34744 KB Output is correct
17 Correct 6 ms 34652 KB Output is correct
18 Correct 6 ms 34652 KB Output is correct
19 Correct 5 ms 34908 KB Output is correct
20 Correct 6 ms 34908 KB Output is correct
21 Correct 6 ms 34908 KB Output is correct
22 Correct 6 ms 34908 KB Output is correct
23 Correct 6 ms 34932 KB Output is correct
24 Correct 5 ms 34908 KB Output is correct
25 Correct 6 ms 34908 KB Output is correct
26 Correct 5 ms 34676 KB Output is correct
27 Correct 5 ms 34908 KB Output is correct
28 Correct 6 ms 34908 KB Output is correct
29 Correct 6 ms 34908 KB Output is correct
30 Correct 6 ms 34652 KB Output is correct
31 Correct 6 ms 34908 KB Output is correct
32 Correct 6 ms 34648 KB Output is correct
33 Correct 6 ms 34908 KB Output is correct
34 Correct 7 ms 34908 KB Output is correct
35 Correct 57 ms 38908 KB Output is correct
36 Correct 81 ms 41608 KB Output is correct
37 Correct 80 ms 41512 KB Output is correct
38 Correct 75 ms 41132 KB Output is correct
39 Correct 7 ms 34904 KB Output is correct
40 Correct 10 ms 35108 KB Output is correct
41 Correct 7 ms 35164 KB Output is correct
42 Correct 7 ms 34904 KB Output is correct
43 Correct 7 ms 35168 KB Output is correct
44 Correct 7 ms 34908 KB Output is correct
45 Correct 7 ms 34908 KB Output is correct
46 Correct 7 ms 35012 KB Output is correct
47 Correct 8 ms 35164 KB Output is correct
48 Correct 8 ms 34996 KB Output is correct
49 Correct 15 ms 36188 KB Output is correct
50 Correct 94 ms 41604 KB Output is correct
51 Correct 11 ms 35160 KB Output is correct
52 Correct 67 ms 40128 KB Output is correct
53 Correct 13 ms 35928 KB Output is correct
54 Correct 72 ms 41116 KB Output is correct
55 Correct 11 ms 35420 KB Output is correct
56 Correct 11 ms 35420 KB Output is correct
57 Correct 13 ms 36956 KB Output is correct
58 Correct 11 ms 36956 KB Output is correct
59 Correct 7 ms 35160 KB Output is correct
60 Correct 51 ms 37424 KB Output is correct
61 Correct 8 ms 35164 KB Output is correct
62 Correct 75 ms 41132 KB Output is correct
63 Correct 316 ms 82084 KB Output is correct
64 Correct 280 ms 82212 KB Output is correct
65 Correct 314 ms 82088 KB Output is correct
66 Correct 73 ms 45048 KB Output is correct
67 Correct 161 ms 49996 KB Output is correct
68 Correct 94 ms 45000 KB Output is correct
69 Correct 183 ms 48076 KB Output is correct
70 Correct 89 ms 45124 KB Output is correct
71 Correct 76 ms 45004 KB Output is correct
72 Correct 167 ms 48292 KB Output is correct
73 Correct 156 ms 48596 KB Output is correct
74 Correct 516 ms 64492 KB Output is correct
75 Correct 270 ms 53024 KB Output is correct
76 Correct 352 ms 59344 KB Output is correct
77 Correct 356 ms 60348 KB Output is correct
78 Correct 108 ms 47792 KB Output is correct
79 Correct 235 ms 50604 KB Output is correct
80 Correct 100 ms 47820 KB Output is correct
81 Correct 159 ms 49608 KB Output is correct
82 Correct 356 ms 68060 KB Output is correct
83 Correct 354 ms 68128 KB Output is correct
84 Correct 382 ms 141340 KB Output is correct
85 Correct 442 ms 141748 KB Output is correct
86 Correct 97 ms 49184 KB Output is correct
87 Correct 111 ms 50252 KB Output is correct
88 Correct 159 ms 48468 KB Output is correct
89 Correct 336 ms 57472 KB Output is correct