oj.uz

답안 #1000251

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000251 2024-06-17T07:17:28 Z snpmrnhlol 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 85588 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);
    ///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
    int nr1 = -1;
    for(auto i:dsu[x].boys){
        assert(leader(i) != y);
        if(check(leader(i),x) && check(y,leader(i))){
            nr1 = leader(i);
        }
        if(check(leader(i),y) && check(x,leader(i))){
            nr1 = leader(i);
        }
        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]){
        if(check(leader(i),x) && check(y,leader(i))){
            nr1 = leader(i);
        }
        if(check(leader(i),y) && check(x,leader(i))){
            nr1 = leader(i);
        }
        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();
    for(auto i:dsu[y].boys){
        if(check(leader(i),y) && check(y,leader(i))){
            nr1 = leader(i);
        }
        if(check(leader(i),y) && check(y,leader(i))){
            nr1 = leader(i);
        }
    }
    ///check for new connections
    if(nr1 != -1){
        connect(y,nr1);
    }
}
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 dbg()':
joitter2.cpp:129:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  129 |         for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
      |         ^~~
joitter2.cpp:129:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  129 |         for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
      |                                             ^~~~
joitter2.cpp:130:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  130 |         for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
      |         ^~~
joitter2.cpp:130:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  130 |         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 6 ms 34672 KB Output is correct
3 Correct 6 ms 34652 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 6 ms 34652 KB Output is correct
6 Correct 6 ms 34652 KB Output is correct
7 Correct 6 ms 34908 KB Output is correct
8 Correct 6 ms 34908 KB Output is correct
9 Correct 8 ms 34908 KB Output is correct
10 Correct 5 ms 34904 KB Output is correct
11 Correct 5 ms 34904 KB Output is correct
12 Correct 6 ms 34912 KB Output is correct
13 Correct 7 ms 34656 KB Output is correct
14 Correct 5 ms 34908 KB Output is correct
15 Correct 6 ms 34760 KB Output is correct
16 Correct 6 ms 34656 KB Output is correct
17 Correct 6 ms 34908 KB Output is correct
18 Correct 6 ms 34672 KB Output is correct
19 Correct 6 ms 34908 KB Output is correct
20 Correct 6 ms 34920 KB Output is correct
21 Correct 6 ms 34912 KB Output is correct
22 Correct 6 ms 34904 KB Output is correct
23 Correct 6 ms 34900 KB Output is correct
24 Correct 7 ms 34908 KB Output is correct
25 Correct 6 ms 34908 KB Output is correct
26 Correct 6 ms 34908 KB Output is correct
27 Correct 6 ms 34908 KB Output is correct
28 Correct 6 ms 34908 KB Output is correct
29 Correct 5 ms 34908 KB Output is correct
30 Correct 5 ms 34652 KB Output is correct
31 Correct 6 ms 34676 KB Output is correct
32 Correct 6 ms 34676 KB Output is correct
33 Correct 6 ms 34944 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 6 ms 34672 KB Output is correct
3 Correct 6 ms 34652 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 6 ms 34652 KB Output is correct
6 Correct 6 ms 34652 KB Output is correct
7 Correct 6 ms 34908 KB Output is correct
8 Correct 6 ms 34908 KB Output is correct
9 Correct 8 ms 34908 KB Output is correct
10 Correct 5 ms 34904 KB Output is correct
11 Correct 5 ms 34904 KB Output is correct
12 Correct 6 ms 34912 KB Output is correct
13 Correct 7 ms 34656 KB Output is correct
14 Correct 5 ms 34908 KB Output is correct
15 Correct 6 ms 34760 KB Output is correct
16 Correct 6 ms 34656 KB Output is correct
17 Correct 6 ms 34908 KB Output is correct
18 Correct 6 ms 34672 KB Output is correct
19 Correct 6 ms 34908 KB Output is correct
20 Correct 6 ms 34920 KB Output is correct
21 Correct 6 ms 34912 KB Output is correct
22 Correct 6 ms 34904 KB Output is correct
23 Correct 6 ms 34900 KB Output is correct
24 Correct 7 ms 34908 KB Output is correct
25 Correct 6 ms 34908 KB Output is correct
26 Correct 6 ms 34908 KB Output is correct
27 Correct 6 ms 34908 KB Output is correct
28 Correct 6 ms 34908 KB Output is correct
29 Correct 5 ms 34908 KB Output is correct
30 Correct 5 ms 34652 KB Output is correct
31 Correct 6 ms 34676 KB Output is correct
32 Correct 6 ms 34676 KB Output is correct
33 Correct 6 ms 34944 KB Output is correct
34 Correct 8 ms 34904 KB Output is correct
35 Correct 93 ms 40540 KB Output is correct
36 Correct 366 ms 43372 KB Output is correct
37 Correct 349 ms 43352 KB Output is correct
38 Correct 339 ms 43004 KB Output is correct
39 Correct 7 ms 34908 KB Output is correct
40 Correct 8 ms 35016 KB Output is correct
41 Correct 7 ms 35164 KB Output is correct
42 Correct 6 ms 34908 KB Output is correct
43 Correct 28 ms 35024 KB Output is correct
44 Correct 28 ms 35160 KB Output is correct
45 Correct 7 ms 34908 KB Output is correct
46 Correct 7 ms 34908 KB Output is correct
47 Correct 9 ms 35164 KB Output is correct
48 Correct 9 ms 35196 KB Output is correct
49 Correct 42 ms 35924 KB Output is correct
50 Correct 366 ms 43528 KB Output is correct
51 Correct 37 ms 35420 KB Output is correct
52 Correct 263 ms 41900 KB Output is correct
53 Correct 47 ms 35676 KB Output is correct
54 Correct 333 ms 42680 KB Output is correct
55 Correct 34 ms 35676 KB Output is correct
56 Correct 34 ms 35672 KB Output is correct
57 Correct 28 ms 35676 KB Output is correct
58 Correct 28 ms 35732 KB Output is correct
59 Correct 7 ms 35164 KB Output is correct
60 Correct 55 ms 40020 KB Output is correct
61 Correct 12 ms 35160 KB Output is correct
62 Correct 345 ms 42832 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 6 ms 34672 KB Output is correct
3 Correct 6 ms 34652 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 6 ms 34652 KB Output is correct
6 Correct 6 ms 34652 KB Output is correct
7 Correct 6 ms 34908 KB Output is correct
8 Correct 6 ms 34908 KB Output is correct
9 Correct 8 ms 34908 KB Output is correct
10 Correct 5 ms 34904 KB Output is correct
11 Correct 5 ms 34904 KB Output is correct
12 Correct 6 ms 34912 KB Output is correct
13 Correct 7 ms 34656 KB Output is correct
14 Correct 5 ms 34908 KB Output is correct
15 Correct 6 ms 34760 KB Output is correct
16 Correct 6 ms 34656 KB Output is correct
17 Correct 6 ms 34908 KB Output is correct
18 Correct 6 ms 34672 KB Output is correct
19 Correct 6 ms 34908 KB Output is correct
20 Correct 6 ms 34920 KB Output is correct
21 Correct 6 ms 34912 KB Output is correct
22 Correct 6 ms 34904 KB Output is correct
23 Correct 6 ms 34900 KB Output is correct
24 Correct 7 ms 34908 KB Output is correct
25 Correct 6 ms 34908 KB Output is correct
26 Correct 6 ms 34908 KB Output is correct
27 Correct 6 ms 34908 KB Output is correct
28 Correct 6 ms 34908 KB Output is correct
29 Correct 5 ms 34908 KB Output is correct
30 Correct 5 ms 34652 KB Output is correct
31 Correct 6 ms 34676 KB Output is correct
32 Correct 6 ms 34676 KB Output is correct
33 Correct 6 ms 34944 KB Output is correct
34 Correct 8 ms 34904 KB Output is correct
35 Correct 93 ms 40540 KB Output is correct
36 Correct 366 ms 43372 KB Output is correct
37 Correct 349 ms 43352 KB Output is correct
38 Correct 339 ms 43004 KB Output is correct
39 Correct 7 ms 34908 KB Output is correct
40 Correct 8 ms 35016 KB Output is correct
41 Correct 7 ms 35164 KB Output is correct
42 Correct 6 ms 34908 KB Output is correct
43 Correct 28 ms 35024 KB Output is correct
44 Correct 28 ms 35160 KB Output is correct
45 Correct 7 ms 34908 KB Output is correct
46 Correct 7 ms 34908 KB Output is correct
47 Correct 9 ms 35164 KB Output is correct
48 Correct 9 ms 35196 KB Output is correct
49 Correct 42 ms 35924 KB Output is correct
50 Correct 366 ms 43528 KB Output is correct
51 Correct 37 ms 35420 KB Output is correct
52 Correct 263 ms 41900 KB Output is correct
53 Correct 47 ms 35676 KB Output is correct
54 Correct 333 ms 42680 KB Output is correct
55 Correct 34 ms 35676 KB Output is correct
56 Correct 34 ms 35672 KB Output is correct
57 Correct 28 ms 35676 KB Output is correct
58 Correct 28 ms 35732 KB Output is correct
59 Correct 7 ms 35164 KB Output is correct
60 Correct 55 ms 40020 KB Output is correct
61 Correct 12 ms 35160 KB Output is correct
62 Correct 345 ms 42832 KB Output is correct
63 Correct 291 ms 85584 KB Output is correct
64 Correct 315 ms 85588 KB Output is correct
65 Correct 311 ms 85588 KB Output is correct
66 Correct 71 ms 47312 KB Output is correct
67 Correct 142 ms 52288 KB Output is correct
68 Correct 85 ms 47308 KB Output is correct
69 Execution timed out 5036 ms 43644 KB Time limit exceeded
70 Halted 0 ms 0 KB -